./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 --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix009.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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-07_14-17-48.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:16:55,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:16:55,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:16:55,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:16:55,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:16:55,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:16:55,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:16:55,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:16:55,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:16:55,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:16:55,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:16:55,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:16:55,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:16:55,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:16:55,361 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:16:55,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:16:55,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:16:55,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:16:55,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:16:55,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:16:55,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:16:55,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:16:55,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:16:55,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:16:55,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:16:55,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:16:55,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:16:55,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:16:55,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:16:55,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:16:55,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:16:55,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:16:55,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:16:55,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:16:55,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:16:55,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:16:55,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:16:55,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:16:55,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:16:55,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:16:55,367 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:16:55,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:16:55,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:16:55,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:16:55,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:16:55,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:16:55,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:16:55,575 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:16:55,575 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:16:55,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix009.oepc.yml/witness.yml [2024-05-12 11:16:55,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:16:55,758 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:16:55,759 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-05-12 11:16:56,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:16:57,021 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:16:57,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-05-12 11:16:57,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956c3b899/877022bac8fb4448aed10718e37b3a3b/FLAG17483dcff [2024-05-12 11:16:57,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956c3b899/877022bac8fb4448aed10718e37b3a3b [2024-05-12 11:16:57,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:16:57,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:16:57,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:16:57,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:16:57,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:16:57,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:16:55" (1/2) ... [2024-05-12 11:16:57,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db163f5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:16:57, skipping insertion in model container [2024-05-12 11:16:57,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:16:55" (1/2) ... [2024-05-12 11:16:57,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@445fb6fe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:16:57, skipping insertion in model container [2024-05-12 11:16:57,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:16:57" (2/2) ... [2024-05-12 11:16:57,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db163f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57, skipping insertion in model container [2024-05-12 11:16:57,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:16:57" (2/2) ... [2024-05-12 11:16:57,059 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:16:57,159 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:16:57,160 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-05-12 11:16:57,160 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-05-12 11:16:57,161 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:16:57,161 INFO L106 edCorrectnessWitness]: ghost_update [L823-L823] multithreaded = 1; [2024-05-12 11:16:57,187 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:16:57,293 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i[945,958] [2024-05-12 11:16:57,397 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:16:57,412 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:16:57,447 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:16:57,673 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:16:57,712 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:16:57,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57 WrapperNode [2024-05-12 11:16:57,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:16:57,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:16:57,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:16:57,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:16:57,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,857 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-05-12 11:16:57,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:16:57,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:16:57,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:16:57,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:16:57,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,904 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 11:16:57,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:16:57,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:16:57,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:16:57,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:16:57,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (1/1) ... [2024-05-12 11:16:57,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:16:57,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:16:57,971 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-05-12 11:16:57,980 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-05-12 11:16:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:16:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:16:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:16:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:16:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:16:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:16:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:16:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:16:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:16:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:16:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:16:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:16:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:16:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:16:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:16:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:16:58,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:16:58,004 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:16:58,191 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:16:58,193 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:16:58,915 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:16:58,915 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:16:59,077 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:16:59,081 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:16:59,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:16:59 BoogieIcfgContainer [2024-05-12 11:16:59,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:16:59,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:16:59,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:16:59,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:16:59,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:16:55" (1/4) ... [2024-05-12 11:16:59,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3c6a62 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:16:59, skipping insertion in model container [2024-05-12 11:16:59,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:16:57" (2/4) ... [2024-05-12 11:16:59,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3c6a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:16:59, skipping insertion in model container [2024-05-12 11:16:59,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:16:57" (3/4) ... [2024-05-12 11:16:59,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3c6a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:16:59, skipping insertion in model container [2024-05-12 11:16:59,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:16:59" (4/4) ... [2024-05-12 11:16:59,089 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2024-05-12 11:16:59,101 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:16:59,101 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 11:16:59,101 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:16:59,172 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:16:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 86 flow [2024-05-12 11:16:59,237 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-05-12 11:16:59,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:16:59,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-05-12 11:16:59,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 86 flow [2024-05-12 11:16:59,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 80 flow [2024-05-12 11:16:59,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:16:59,260 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;@688d43e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:16:59,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 11:16:59,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:16:59,268 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:16:59,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:16:59,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:59,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:16:59,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:16:59,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1459076115, now seen corresponding path program 1 times [2024-05-12 11:16:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578556225] [2024-05-12 11:16:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578556225] [2024-05-12 11:17:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578556225] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:17:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868410449] [2024-05-12 11:17:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:04,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:17:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:17:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:17:04,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-05-12 11:17:04,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:04,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:04,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-05-12 11:17:04,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:04,557 INFO L124 PetriNetUnfolderBase]: 475/854 cut-off events. [2024-05-12 11:17:04,557 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 11:17:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 854 events. 475/854 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4440 event pairs, 182 based on Foata normal form. 43/842 useless extension candidates. Maximal degree in co-relation 1658. Up to 787 conditions per place. [2024-05-12 11:17:04,563 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 32 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-05-12 11:17:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 175 flow [2024-05-12 11:17:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:17:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:17:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-05-12 11:17:04,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2024-05-12 11:17:04,573 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 80 flow. Second operand 3 states and 79 transitions. [2024-05-12 11:17:04,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 175 flow [2024-05-12 11:17:04,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:17:04,577 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 104 flow [2024-05-12 11:17:04,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-05-12 11:17:04,580 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-05-12 11:17:04,581 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 104 flow [2024-05-12 11:17:04,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:04,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:04,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:17:04,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:17:04,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:04,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1459076530, now seen corresponding path program 1 times [2024-05-12 11:17:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157425224] [2024-05-12 11:17:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:04,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-05-12 11:17:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157425224] [2024-05-12 11:17:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157425224] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:17:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897211670] [2024-05-12 11:17:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:04,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:17:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:17:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:17:04,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-05-12 11:17:04,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:04,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:04,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-05-12 11:17:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:04,762 INFO L124 PetriNetUnfolderBase]: 169/442 cut-off events. [2024-05-12 11:17:04,762 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 11:17:04,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 442 events. 169/442 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2415 event pairs, 96 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 798. Up to 256 conditions per place. [2024-05-12 11:17:04,765 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 25 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2024-05-12 11:17:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 179 flow [2024-05-12 11:17:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:17:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:17:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-05-12 11:17:04,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-05-12 11:17:04,782 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-05-12 11:17:04,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 179 flow [2024-05-12 11:17:04,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:17:04,783 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 96 flow [2024-05-12 11:17:04,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-05-12 11:17:04,784 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-05-12 11:17:04,784 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 96 flow [2024-05-12 11:17:04,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:04,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:04,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:04,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:17:04,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:04,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2012828625, now seen corresponding path program 1 times [2024-05-12 11:17:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51227217] [2024-05-12 11:17:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51227217] [2024-05-12 11:17:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51227217] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:08,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:08,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:17:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875161999] [2024-05-12 11:17:08,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:08,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:17:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:08,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:17:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:17:08,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-05-12 11:17:08,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:08,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:08,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-05-12 11:17:08,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:08,645 INFO L124 PetriNetUnfolderBase]: 342/727 cut-off events. [2024-05-12 11:17:08,645 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-05-12 11:17:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 727 events. 342/727 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3939 event pairs, 160 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 1464. Up to 562 conditions per place. [2024-05-12 11:17:08,649 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-05-12 11:17:08,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 226 flow [2024-05-12 11:17:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:17:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:17:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-05-12 11:17:08,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-05-12 11:17:08,652 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 4 states and 94 transitions. [2024-05-12 11:17:08,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 226 flow [2024-05-12 11:17:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:17:08,653 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 139 flow [2024-05-12 11:17:08,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-05-12 11:17:08,654 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-05-12 11:17:08,654 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 139 flow [2024-05-12 11:17:08,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:08,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:08,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:08,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:17:08,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:08,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2026821330, now seen corresponding path program 1 times [2024-05-12 11:17:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308794358] [2024-05-12 11:17:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308794358] [2024-05-12 11:17:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308794358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:11,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:17:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431274109] [2024-05-12 11:17:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:17:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:17:11,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:17:11,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-05-12 11:17:11,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:11,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:11,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-05-12 11:17:11,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:12,188 INFO L124 PetriNetUnfolderBase]: 406/853 cut-off events. [2024-05-12 11:17:12,188 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2024-05-12 11:17:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 853 events. 406/853 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4714 event pairs, 235 based on Foata normal form. 2/820 useless extension candidates. Maximal degree in co-relation 1869. Up to 651 conditions per place. [2024-05-12 11:17:12,193 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 44 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-05-12 11:17:12,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 299 flow [2024-05-12 11:17:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:17:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:17:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-05-12 11:17:12,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5743589743589743 [2024-05-12 11:17:12,197 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 139 flow. Second operand 5 states and 112 transitions. [2024-05-12 11:17:12,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 299 flow [2024-05-12 11:17:12,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 292 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 11:17:12,201 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 167 flow [2024-05-12 11:17:12,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-05-12 11:17:12,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-05-12 11:17:12,203 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 167 flow [2024-05-12 11:17:12,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:12,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:12,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:12,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:17:12,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:12,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1953222166, now seen corresponding path program 1 times [2024-05-12 11:17:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202198191] [2024-05-12 11:17:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202198191] [2024-05-12 11:17:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202198191] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:15,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:17:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473447814] [2024-05-12 11:17:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:15,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:17:15,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:17:15,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:17:15,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-05-12 11:17:15,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-05-12 11:17:15,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:15,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-05-12 11:17:15,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:15,702 INFO L124 PetriNetUnfolderBase]: 406/854 cut-off events. [2024-05-12 11:17:15,702 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-05-12 11:17:15,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 854 events. 406/854 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4676 event pairs, 135 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 1997. Up to 636 conditions per place. [2024-05-12 11:17:15,706 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 51 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-05-12 11:17:15,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 365 flow [2024-05-12 11:17:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:17:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:17:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-05-12 11:17:15,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683760683760684 [2024-05-12 11:17:15,711 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 167 flow. Second operand 6 states and 133 transitions. [2024-05-12 11:17:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 365 flow [2024-05-12 11:17:15,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 348 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 11:17:15,719 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 191 flow [2024-05-12 11:17:15,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-05-12 11:17:15,721 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2024-05-12 11:17:15,721 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 191 flow [2024-05-12 11:17:15,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-05-12 11:17:15,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:15,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:15,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:17:15,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:15,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1867590164, now seen corresponding path program 1 times [2024-05-12 11:17:15,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:15,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464044844] [2024-05-12 11:17:15,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464044844] [2024-05-12 11:17:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464044844] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:17:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538019879] [2024-05-12 11:17:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:23,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:17:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:23,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:17:23,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:17:23,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:17:23,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-05-12 11:17:23,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:23,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:17:23,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:24,092 INFO L124 PetriNetUnfolderBase]: 603/1216 cut-off events. [2024-05-12 11:17:24,092 INFO L125 PetriNetUnfolderBase]: For 1102/1104 co-relation queries the response was YES. [2024-05-12 11:17:24,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 1216 events. 603/1216 cut-off events. For 1102/1104 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6831 event pairs, 274 based on Foata normal form. 3/1172 useless extension candidates. Maximal degree in co-relation 2944. Up to 987 conditions per place. [2024-05-12 11:17:24,097 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2024-05-12 11:17:24,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 325 flow [2024-05-12 11:17:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:17:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:17:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-05-12 11:17:24,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2024-05-12 11:17:24,099 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 191 flow. Second operand 5 states and 94 transitions. [2024-05-12 11:17:24,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 325 flow [2024-05-12 11:17:24,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 302 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:17:24,101 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 200 flow [2024-05-12 11:17:24,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-05-12 11:17:24,102 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-05-12 11:17:24,102 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 200 flow [2024-05-12 11:17:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-05-12 11:17:24,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:24,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:24,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:17:24,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:24,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 145818709, now seen corresponding path program 1 times [2024-05-12 11:17:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319240239] [2024-05-12 11:17:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319240239] [2024-05-12 11:17:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319240239] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:17:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782091969] [2024-05-12 11:17:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:17:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:17:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:17:28,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 11:17:28,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:28,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:28,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 11:17:28,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:28,899 INFO L124 PetriNetUnfolderBase]: 512/1009 cut-off events. [2024-05-12 11:17:28,899 INFO L125 PetriNetUnfolderBase]: For 1254/1254 co-relation queries the response was YES. [2024-05-12 11:17:28,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1009 events. 512/1009 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5528 event pairs, 193 based on Foata normal form. 2/979 useless extension candidates. Maximal degree in co-relation 2598. Up to 767 conditions per place. [2024-05-12 11:17:28,904 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 67 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-05-12 11:17:28,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 482 flow [2024-05-12 11:17:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-05-12 11:17:28,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2024-05-12 11:17:28,906 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 200 flow. Second operand 8 states and 168 transitions. [2024-05-12 11:17:28,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 482 flow [2024-05-12 11:17:28,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 468 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 11:17:28,910 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 248 flow [2024-05-12 11:17:28,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-05-12 11:17:28,911 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2024-05-12 11:17:28,911 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 248 flow [2024-05-12 11:17:28,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:28,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:28,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:17:28,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:28,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2060721489, now seen corresponding path program 1 times [2024-05-12 11:17:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659987828] [2024-05-12 11:17:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659987828] [2024-05-12 11:17:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659987828] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:37,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:17:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853450086] [2024-05-12 11:17:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:17:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:17:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:17:37,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:17:37,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:37,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:37,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:17:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:38,432 INFO L124 PetriNetUnfolderBase]: 596/1143 cut-off events. [2024-05-12 11:17:38,432 INFO L125 PetriNetUnfolderBase]: For 1769/1773 co-relation queries the response was YES. [2024-05-12 11:17:38,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1143 events. 596/1143 cut-off events. For 1769/1773 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6232 event pairs, 180 based on Foata normal form. 7/1118 useless extension candidates. Maximal degree in co-relation 3166. Up to 945 conditions per place. [2024-05-12 11:17:38,438 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 53 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2024-05-12 11:17:38,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 426 flow [2024-05-12 11:17:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:17:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:17:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-05-12 11:17:38,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2024-05-12 11:17:38,440 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 248 flow. Second operand 6 states and 113 transitions. [2024-05-12 11:17:38,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 426 flow [2024-05-12 11:17:38,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 395 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:17:38,442 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 254 flow [2024-05-12 11:17:38,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-05-12 11:17:38,444 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-05-12 11:17:38,444 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 254 flow [2024-05-12 11:17:38,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:38,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:38,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:17:38,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:38,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1461679960, now seen corresponding path program 1 times [2024-05-12 11:17:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:38,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550057854] [2024-05-12 11:17:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:43,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-05-12 11:17:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550057854] [2024-05-12 11:17:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550057854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:17:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777902964] [2024-05-12 11:17:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:17:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:17:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:17:44,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:17:44,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:44,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:44,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:17:44,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:44,551 INFO L124 PetriNetUnfolderBase]: 613/1153 cut-off events. [2024-05-12 11:17:44,551 INFO L125 PetriNetUnfolderBase]: For 1993/1995 co-relation queries the response was YES. [2024-05-12 11:17:44,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1153 events. 613/1153 cut-off events. For 1993/1995 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6184 event pairs, 141 based on Foata normal form. 3/1123 useless extension candidates. Maximal degree in co-relation 3313. Up to 970 conditions per place. [2024-05-12 11:17:44,561 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 58 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2024-05-12 11:17:44,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 491 flow [2024-05-12 11:17:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:17:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:17:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-05-12 11:17:44,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2024-05-12 11:17:44,562 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 254 flow. Second operand 6 states and 116 transitions. [2024-05-12 11:17:44,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 491 flow [2024-05-12 11:17:44,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 467 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 11:17:44,567 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 310 flow [2024-05-12 11:17:44,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-05-12 11:17:44,568 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-05-12 11:17:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 310 flow [2024-05-12 11:17:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:44,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:44,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:44,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:17:44,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:44,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 225413542, now seen corresponding path program 1 times [2024-05-12 11:17:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043427840] [2024-05-12 11:17:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043427840] [2024-05-12 11:17:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043427840] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:48,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:48,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:48,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809991072] [2024-05-12 11:17:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:48,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:48,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:49,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-05-12 11:17:49,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 310 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:49,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:49,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-05-12 11:17:49,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:49,476 INFO L124 PetriNetUnfolderBase]: 533/1039 cut-off events. [2024-05-12 11:17:49,477 INFO L125 PetriNetUnfolderBase]: For 2393/2395 co-relation queries the response was YES. [2024-05-12 11:17:49,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1039 events. 533/1039 cut-off events. For 2393/2395 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5650 event pairs, 153 based on Foata normal form. 6/1012 useless extension candidates. Maximal degree in co-relation 3097. Up to 764 conditions per place. [2024-05-12 11:17:49,482 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 77 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2024-05-12 11:17:49,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 105 transitions, 620 flow [2024-05-12 11:17:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:17:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:17:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-05-12 11:17:49,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242165242165242 [2024-05-12 11:17:49,484 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 310 flow. Second operand 9 states and 184 transitions. [2024-05-12 11:17:49,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 105 transitions, 620 flow [2024-05-12 11:17:49,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 614 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 11:17:49,490 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 340 flow [2024-05-12 11:17:49,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=340, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-05-12 11:17:49,492 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2024-05-12 11:17:49,492 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 340 flow [2024-05-12 11:17:49,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:49,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:49,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:49,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:17:49,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:49,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -542152878, now seen corresponding path program 2 times [2024-05-12 11:17:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619017938] [2024-05-12 11:17:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619017938] [2024-05-12 11:17:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619017938] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:17:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444326810] [2024-05-12 11:17:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:56,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:17:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:17:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:17:56,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:17:56,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 340 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:56,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:56,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:17:56,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:56,735 INFO L124 PetriNetUnfolderBase]: 613/1176 cut-off events. [2024-05-12 11:17:56,735 INFO L125 PetriNetUnfolderBase]: For 3022/3026 co-relation queries the response was YES. [2024-05-12 11:17:56,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1176 events. 613/1176 cut-off events. For 3022/3026 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6437 event pairs, 179 based on Foata normal form. 5/1148 useless extension candidates. Maximal degree in co-relation 3662. Up to 990 conditions per place. [2024-05-12 11:17:56,742 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 55 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-05-12 11:17:56,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 528 flow [2024-05-12 11:17:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:17:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:17:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-05-12 11:17:56,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2024-05-12 11:17:56,743 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 340 flow. Second operand 6 states and 110 transitions. [2024-05-12 11:17:56,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 528 flow [2024-05-12 11:17:56,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 488 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-05-12 11:17:56,747 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 352 flow [2024-05-12 11:17:56,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-05-12 11:17:56,748 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-05-12 11:17:56,748 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 352 flow [2024-05-12 11:17:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-05-12 11:17:56,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:56,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:56,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:17:56,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:17:56,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1932383011, now seen corresponding path program 1 times [2024-05-12 11:17:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978232985] [2024-05-12 11:17:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978232985] [2024-05-12 11:18:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978232985] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99887234] [2024-05-12 11:18:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:04,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:04,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:18:04,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 352 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:04,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:04,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:18:04,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:04,644 INFO L124 PetriNetUnfolderBase]: 670/1221 cut-off events. [2024-05-12 11:18:04,645 INFO L125 PetriNetUnfolderBase]: For 3452/3452 co-relation queries the response was YES. [2024-05-12 11:18:04,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 1221 events. 670/1221 cut-off events. For 3452/3452 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6448 event pairs, 141 based on Foata normal form. 1/1189 useless extension candidates. Maximal degree in co-relation 3898. Up to 1011 conditions per place. [2024-05-12 11:18:04,651 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 69 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2024-05-12 11:18:04,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 644 flow [2024-05-12 11:18:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-05-12 11:18:04,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-05-12 11:18:04,653 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 352 flow. Second operand 7 states and 130 transitions. [2024-05-12 11:18:04,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 644 flow [2024-05-12 11:18:04,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 616 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:18:04,657 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 393 flow [2024-05-12 11:18:04,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-05-12 11:18:04,658 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2024-05-12 11:18:04,658 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 393 flow [2024-05-12 11:18:04,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:04,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:04,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:04,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:18:04,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:04,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1932562749, now seen corresponding path program 1 times [2024-05-12 11:18:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765404175] [2024-05-12 11:18:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765404175] [2024-05-12 11:18:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765404175] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:11,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763702398] [2024-05-12 11:18:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:11,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:11,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:18:11,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:11,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:11,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:18:11,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:12,163 INFO L124 PetriNetUnfolderBase]: 694/1293 cut-off events. [2024-05-12 11:18:12,163 INFO L125 PetriNetUnfolderBase]: For 4427/4429 co-relation queries the response was YES. [2024-05-12 11:18:12,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 1293 events. 694/1293 cut-off events. For 4427/4429 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7052 event pairs, 155 based on Foata normal form. 5/1260 useless extension candidates. Maximal degree in co-relation 4254. Up to 1001 conditions per place. [2024-05-12 11:18:12,172 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 73 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2024-05-12 11:18:12,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 707 flow [2024-05-12 11:18:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-05-12 11:18:12,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-05-12 11:18:12,173 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 393 flow. Second operand 7 states and 138 transitions. [2024-05-12 11:18:12,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 707 flow [2024-05-12 11:18:12,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 102 transitions, 682 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 11:18:12,178 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 463 flow [2024-05-12 11:18:12,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-05-12 11:18:12,179 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2024-05-12 11:18:12,179 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 463 flow [2024-05-12 11:18:12,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:12,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:12,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:12,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:18:12,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:12,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 112518773, now seen corresponding path program 2 times [2024-05-12 11:18:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310455813] [2024-05-12 11:18:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310455813] [2024-05-12 11:18:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310455813] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381721669] [2024-05-12 11:18:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:18,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:18,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:18:18,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:18,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:18,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:18:18,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:19,492 INFO L124 PetriNetUnfolderBase]: 743/1358 cut-off events. [2024-05-12 11:18:19,493 INFO L125 PetriNetUnfolderBase]: For 5338/5338 co-relation queries the response was YES. [2024-05-12 11:18:19,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4913 conditions, 1358 events. 743/1358 cut-off events. For 5338/5338 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7309 event pairs, 156 based on Foata normal form. 1/1320 useless extension candidates. Maximal degree in co-relation 4877. Up to 1119 conditions per place. [2024-05-12 11:18:19,500 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 74 selfloop transitions, 19 changer transitions 0/100 dead transitions. [2024-05-12 11:18:19,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 759 flow [2024-05-12 11:18:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-05-12 11:18:19,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2024-05-12 11:18:19,502 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 463 flow. Second operand 7 states and 128 transitions. [2024-05-12 11:18:19,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 759 flow [2024-05-12 11:18:19,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 746 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 11:18:19,507 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 507 flow [2024-05-12 11:18:19,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=507, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-05-12 11:18:19,508 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-05-12 11:18:19,508 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 507 flow [2024-05-12 11:18:19,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:19,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:19,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:19,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:18:19,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:19,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1370859399, now seen corresponding path program 2 times [2024-05-12 11:18:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805370755] [2024-05-12 11:18:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:25,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805370755] [2024-05-12 11:18:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805370755] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:25,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:25,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127486524] [2024-05-12 11:18:25,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:25,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:25,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:18:25,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 507 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:25,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:25,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:18:25,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:26,417 INFO L124 PetriNetUnfolderBase]: 733/1402 cut-off events. [2024-05-12 11:18:26,417 INFO L125 PetriNetUnfolderBase]: For 6266/6270 co-relation queries the response was YES. [2024-05-12 11:18:26,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5030 conditions, 1402 events. 733/1402 cut-off events. For 6266/6270 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7978 event pairs, 210 based on Foata normal form. 7/1366 useless extension candidates. Maximal degree in co-relation 4991. Up to 1142 conditions per place. [2024-05-12 11:18:26,431 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 71 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2024-05-12 11:18:26,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 96 transitions, 739 flow [2024-05-12 11:18:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 11:18:26,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 11:18:26,432 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 507 flow. Second operand 7 states and 126 transitions. [2024-05-12 11:18:26,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 96 transitions, 739 flow [2024-05-12 11:18:26,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 96 transitions, 706 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:18:26,440 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 525 flow [2024-05-12 11:18:26,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2024-05-12 11:18:26,441 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-05-12 11:18:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 525 flow [2024-05-12 11:18:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:26,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:26,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:18:26,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:26,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 373131219, now seen corresponding path program 3 times [2024-05-12 11:18:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899339047] [2024-05-12 11:18:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:32,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899339047] [2024-05-12 11:18:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899339047] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:32,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:32,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:32,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122984784] [2024-05-12 11:18:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:32,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:32,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:18:32,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 525 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:32,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:32,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:18:32,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:33,510 INFO L124 PetriNetUnfolderBase]: 727/1390 cut-off events. [2024-05-12 11:18:33,510 INFO L125 PetriNetUnfolderBase]: For 6720/6724 co-relation queries the response was YES. [2024-05-12 11:18:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1390 events. 727/1390 cut-off events. For 6720/6724 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7899 event pairs, 202 based on Foata normal form. 7/1354 useless extension candidates. Maximal degree in co-relation 4975. Up to 1091 conditions per place. [2024-05-12 11:18:33,546 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 72 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-05-12 11:18:33,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 100 transitions, 765 flow [2024-05-12 11:18:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-05-12 11:18:33,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2024-05-12 11:18:33,548 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 525 flow. Second operand 7 states and 131 transitions. [2024-05-12 11:18:33,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 100 transitions, 765 flow [2024-05-12 11:18:33,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 100 transitions, 720 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:18:33,557 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 517 flow [2024-05-12 11:18:33,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=517, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-05-12 11:18:33,558 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-05-12 11:18:33,558 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 517 flow [2024-05-12 11:18:33,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:33,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:33,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:33,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:18:33,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:33,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 377293493, now seen corresponding path program 3 times [2024-05-12 11:18:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616789177] [2024-05-12 11:18:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616789177] [2024-05-12 11:18:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616789177] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:18:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875429150] [2024-05-12 11:18:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:18:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:18:39,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:18:39,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:18:39,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 517 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:39,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:39,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:18:39,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:40,407 INFO L124 PetriNetUnfolderBase]: 768/1438 cut-off events. [2024-05-12 11:18:40,408 INFO L125 PetriNetUnfolderBase]: For 6966/6966 co-relation queries the response was YES. [2024-05-12 11:18:40,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 1438 events. 768/1438 cut-off events. For 6966/6966 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8048 event pairs, 207 based on Foata normal form. 1/1395 useless extension candidates. Maximal degree in co-relation 5196. Up to 1224 conditions per place. [2024-05-12 11:18:40,418 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 77 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2024-05-12 11:18:40,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 747 flow [2024-05-12 11:18:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-05-12 11:18:40,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2024-05-12 11:18:40,422 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 517 flow. Second operand 7 states and 119 transitions. [2024-05-12 11:18:40,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 747 flow [2024-05-12 11:18:40,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 700 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:18:40,456 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 499 flow [2024-05-12 11:18:40,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2024-05-12 11:18:40,457 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-05-12 11:18:40,457 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 499 flow [2024-05-12 11:18:40,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05-12 11:18:40,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:40,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:40,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:18:40,458 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:40,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash -812598217, now seen corresponding path program 1 times [2024-05-12 11:18:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354911928] [2024-05-12 11:18:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354911928] [2024-05-12 11:18:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354911928] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:18:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101358364] [2024-05-12 11:18:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:47,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:18:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:47,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:18:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:18:47,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:18:47,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 499 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:47,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:47,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:18:47,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:48,117 INFO L124 PetriNetUnfolderBase]: 782/1412 cut-off events. [2024-05-12 11:18:48,117 INFO L125 PetriNetUnfolderBase]: For 7246/7246 co-relation queries the response was YES. [2024-05-12 11:18:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5196 conditions, 1412 events. 782/1412 cut-off events. For 7246/7246 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7684 event pairs, 152 based on Foata normal form. 1/1376 useless extension candidates. Maximal degree in co-relation 5156. Up to 1129 conditions per place. [2024-05-12 11:18:48,124 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 85 selfloop transitions, 25 changer transitions 0/117 dead transitions. [2024-05-12 11:18:48,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 117 transitions, 883 flow [2024-05-12 11:18:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:18:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:18:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-05-12 11:18:48,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-05-12 11:18:48,125 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 499 flow. Second operand 8 states and 150 transitions. [2024-05-12 11:18:48,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 117 transitions, 883 flow [2024-05-12 11:18:48,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 117 transitions, 834 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 11:18:48,132 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 537 flow [2024-05-12 11:18:48,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=537, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-05-12 11:18:48,133 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-05-12 11:18:48,133 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 537 flow [2024-05-12 11:18:48,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:48,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:48,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:48,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:18:48,133 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:48,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash -812448270, now seen corresponding path program 1 times [2024-05-12 11:18:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:48,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043258461] [2024-05-12 11:18:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:54,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:54,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043258461] [2024-05-12 11:18:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043258461] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:54,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:18:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119192935] [2024-05-12 11:18:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:54,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:18:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:54,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:18:54,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:18:55,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:18:55,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 537 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:55,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:55,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:18:55,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:55,618 INFO L124 PetriNetUnfolderBase]: 844/1516 cut-off events. [2024-05-12 11:18:55,618 INFO L125 PetriNetUnfolderBase]: For 8615/8615 co-relation queries the response was YES. [2024-05-12 11:18:55,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 1516 events. 844/1516 cut-off events. For 8615/8615 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8325 event pairs, 172 based on Foata normal form. 3/1481 useless extension candidates. Maximal degree in co-relation 5677. Up to 1042 conditions per place. [2024-05-12 11:18:55,625 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 89 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-05-12 11:18:55,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 124 transitions, 943 flow [2024-05-12 11:18:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:18:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:18:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-05-12 11:18:55,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967948717948718 [2024-05-12 11:18:55,637 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 537 flow. Second operand 8 states and 155 transitions. [2024-05-12 11:18:55,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 124 transitions, 943 flow [2024-05-12 11:18:55,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 124 transitions, 902 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 11:18:55,647 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 585 flow [2024-05-12 11:18:55,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=585, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-05-12 11:18:55,647 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-05-12 11:18:55,647 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 585 flow [2024-05-12 11:18:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:55,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:55,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:55,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:18:55,648 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:18:55,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -812448487, now seen corresponding path program 2 times [2024-05-12 11:18:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535877450] [2024-05-12 11:18:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535877450] [2024-05-12 11:19:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535877450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497986471] [2024-05-12 11:19:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:02,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:02,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:02,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:02,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:02,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:02,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:03,398 INFO L124 PetriNetUnfolderBase]: 855/1530 cut-off events. [2024-05-12 11:19:03,399 INFO L125 PetriNetUnfolderBase]: For 9377/9377 co-relation queries the response was YES. [2024-05-12 11:19:03,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 1530 events. 855/1530 cut-off events. For 9377/9377 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8425 event pairs, 166 based on Foata normal form. 1/1493 useless extension candidates. Maximal degree in co-relation 5982. Up to 1237 conditions per place. [2024-05-12 11:19:03,407 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 88 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2024-05-12 11:19:03,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 957 flow [2024-05-12 11:19:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 11:19:03,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-05-12 11:19:03,425 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 585 flow. Second operand 8 states and 148 transitions. [2024-05-12 11:19:03,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 957 flow [2024-05-12 11:19:03,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 120 transitions, 922 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 11:19:03,434 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 619 flow [2024-05-12 11:19:03,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2024-05-12 11:19:03,435 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-05-12 11:19:03,435 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 619 flow [2024-05-12 11:19:03,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:03,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:03,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:03,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:19:03,436 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:03,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash -806884080, now seen corresponding path program 2 times [2024-05-12 11:19:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173472154] [2024-05-12 11:19:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173472154] [2024-05-12 11:19:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173472154] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504735994] [2024-05-12 11:19:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:10,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:10,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:10,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 619 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:10,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:10,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:10,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:11,103 INFO L124 PetriNetUnfolderBase]: 927/1639 cut-off events. [2024-05-12 11:19:11,103 INFO L125 PetriNetUnfolderBase]: For 11181/11181 co-relation queries the response was YES. [2024-05-12 11:19:11,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 1639 events. 927/1639 cut-off events. For 11181/11181 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9043 event pairs, 188 based on Foata normal form. 3/1605 useless extension candidates. Maximal degree in co-relation 6545. Up to 1111 conditions per place. [2024-05-12 11:19:11,114 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 94 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2024-05-12 11:19:11,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 1083 flow [2024-05-12 11:19:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-05-12 11:19:11,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032051282051282 [2024-05-12 11:19:11,132 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 619 flow. Second operand 8 states and 157 transitions. [2024-05-12 11:19:11,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 1083 flow [2024-05-12 11:19:11,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 130 transitions, 1040 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:19:11,143 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 667 flow [2024-05-12 11:19:11,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2024-05-12 11:19:11,144 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-05-12 11:19:11,144 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 667 flow [2024-05-12 11:19:11,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:11,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:11,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:19:11,146 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:11,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -806876640, now seen corresponding path program 3 times [2024-05-12 11:19:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188528839] [2024-05-12 11:19:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188528839] [2024-05-12 11:19:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188528839] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:18,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:18,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:18,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675791433] [2024-05-12 11:19:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:18,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:18,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:18,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:18,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:18,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:18,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 667 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:18,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:18,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:18,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:18,949 INFO L124 PetriNetUnfolderBase]: 921/1630 cut-off events. [2024-05-12 11:19:18,950 INFO L125 PetriNetUnfolderBase]: For 11733/11733 co-relation queries the response was YES. [2024-05-12 11:19:18,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 1630 events. 921/1630 cut-off events. For 11733/11733 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9017 event pairs, 176 based on Foata normal form. 3/1596 useless extension candidates. Maximal degree in co-relation 6610. Up to 1107 conditions per place. [2024-05-12 11:19:18,960 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 90 selfloop transitions, 30 changer transitions 0/127 dead transitions. [2024-05-12 11:19:18,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 127 transitions, 1053 flow [2024-05-12 11:19:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-05-12 11:19:18,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2024-05-12 11:19:18,961 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 667 flow. Second operand 8 states and 153 transitions. [2024-05-12 11:19:18,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 127 transitions, 1053 flow [2024-05-12 11:19:18,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 127 transitions, 1005 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 11:19:18,975 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 684 flow [2024-05-12 11:19:18,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2024-05-12 11:19:18,976 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2024-05-12 11:19:18,976 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 684 flow [2024-05-12 11:19:18,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:18,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:18,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:18,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:19:18,977 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:18,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash -806884297, now seen corresponding path program 3 times [2024-05-12 11:19:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661838385] [2024-05-12 11:19:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661838385] [2024-05-12 11:19:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661838385] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012793227] [2024-05-12 11:19:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:26,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:26,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 684 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:26,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:26,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:26,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:26,640 INFO L124 PetriNetUnfolderBase]: 932/1682 cut-off events. [2024-05-12 11:19:26,640 INFO L125 PetriNetUnfolderBase]: For 12547/12547 co-relation queries the response was YES. [2024-05-12 11:19:26,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 1682 events. 932/1682 cut-off events. For 12547/12547 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9577 event pairs, 205 based on Foata normal form. 1/1636 useless extension candidates. Maximal degree in co-relation 6764. Up to 1351 conditions per place. [2024-05-12 11:19:26,649 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 90 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2024-05-12 11:19:26,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 123 transitions, 1062 flow [2024-05-12 11:19:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 11:19:26,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2024-05-12 11:19:26,650 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 684 flow. Second operand 8 states and 146 transitions. [2024-05-12 11:19:26,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 123 transitions, 1062 flow [2024-05-12 11:19:26,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 123 transitions, 997 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 11:19:26,670 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 692 flow [2024-05-12 11:19:26,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=692, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-05-12 11:19:26,671 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-05-12 11:19:26,672 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 692 flow [2024-05-12 11:19:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:26,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:26,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:26,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:19:26,672 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:26,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash -453030586, now seen corresponding path program 4 times [2024-05-12 11:19:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988115327] [2024-05-12 11:19:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988115327] [2024-05-12 11:19:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988115327] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067960281] [2024-05-12 11:19:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:33,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:33,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:33,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:33,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:33,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:33,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:34,147 INFO L124 PetriNetUnfolderBase]: 965/1777 cut-off events. [2024-05-12 11:19:34,147 INFO L125 PetriNetUnfolderBase]: For 13880/13880 co-relation queries the response was YES. [2024-05-12 11:19:34,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 1777 events. 965/1777 cut-off events. For 13880/13880 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10408 event pairs, 272 based on Foata normal form. 3/1727 useless extension candidates. Maximal degree in co-relation 6943. Up to 1466 conditions per place. [2024-05-12 11:19:34,161 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 99 selfloop transitions, 15 changer transitions 0/121 dead transitions. [2024-05-12 11:19:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 121 transitions, 1006 flow [2024-05-12 11:19:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-05-12 11:19:34,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2024-05-12 11:19:34,163 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 692 flow. Second operand 8 states and 138 transitions. [2024-05-12 11:19:34,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 121 transitions, 1006 flow [2024-05-12 11:19:34,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 121 transitions, 961 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:19:34,176 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 702 flow [2024-05-12 11:19:34,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2024-05-12 11:19:34,177 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-05-12 11:19:34,177 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 702 flow [2024-05-12 11:19:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:34,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:34,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:34,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:19:34,178 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:34,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash -23169192, now seen corresponding path program 5 times [2024-05-12 11:19:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:34,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874474887] [2024-05-12 11:19:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:40,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-05-12 11:19:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874474887] [2024-05-12 11:19:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874474887] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:40,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:40,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485362770] [2024-05-12 11:19:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:40,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:40,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:40,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:40,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:40,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 702 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:40,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:40,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:40,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:41,596 INFO L124 PetriNetUnfolderBase]: 998/1825 cut-off events. [2024-05-12 11:19:41,596 INFO L125 PetriNetUnfolderBase]: For 15418/15418 co-relation queries the response was YES. [2024-05-12 11:19:41,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7232 conditions, 1825 events. 998/1825 cut-off events. For 15418/15418 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10714 event pairs, 268 based on Foata normal form. 3/1775 useless extension candidates. Maximal degree in co-relation 7183. Up to 1381 conditions per place. [2024-05-12 11:19:41,605 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 99 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-05-12 11:19:41,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 128 transitions, 1098 flow [2024-05-12 11:19:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 11:19:41,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2024-05-12 11:19:41,607 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 702 flow. Second operand 8 states and 146 transitions. [2024-05-12 11:19:41,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 128 transitions, 1098 flow [2024-05-12 11:19:41,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 1065 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:19:41,620 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 738 flow [2024-05-12 11:19:41,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=738, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2024-05-12 11:19:41,620 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2024-05-12 11:19:41,620 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 738 flow [2024-05-12 11:19:41,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:41,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:41,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:41,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:19:41,621 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:41,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1188802352, now seen corresponding path program 6 times [2024-05-12 11:19:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799352656] [2024-05-12 11:19:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:48,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799352656] [2024-05-12 11:19:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799352656] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31343433] [2024-05-12 11:19:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:48,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:48,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 738 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:48,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:48,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:48,901 INFO L124 PetriNetUnfolderBase]: 992/1815 cut-off events. [2024-05-12 11:19:48,902 INFO L125 PetriNetUnfolderBase]: For 15668/15668 co-relation queries the response was YES. [2024-05-12 11:19:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7237 conditions, 1815 events. 992/1815 cut-off events. For 15668/15668 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10673 event pairs, 248 based on Foata normal form. 3/1765 useless extension candidates. Maximal degree in co-relation 7187. Up to 1377 conditions per place. [2024-05-12 11:19:48,912 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 97 selfloop transitions, 23 changer transitions 0/127 dead transitions. [2024-05-12 11:19:48,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 127 transitions, 1064 flow [2024-05-12 11:19:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-05-12 11:19:48,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 11:19:48,933 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 738 flow. Second operand 8 states and 144 transitions. [2024-05-12 11:19:48,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 127 transitions, 1064 flow [2024-05-12 11:19:48,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 127 transitions, 994 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 11:19:48,948 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 719 flow [2024-05-12 11:19:48,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2024-05-12 11:19:48,948 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-05-12 11:19:48,948 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 719 flow [2024-05-12 11:19:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:48,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:48,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:48,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:19:48,949 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1188802569, now seen corresponding path program 4 times [2024-05-12 11:19:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610249917] [2024-05-12 11:19:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:55,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610249917] [2024-05-12 11:19:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610249917] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:19:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121876733] [2024-05-12 11:19:55,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:55,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:19:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:55,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:19:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:19:55,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:19:55,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:55,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:55,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:19:55,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:56,347 INFO L124 PetriNetUnfolderBase]: 990/1823 cut-off events. [2024-05-12 11:19:56,348 INFO L125 PetriNetUnfolderBase]: For 15303/15303 co-relation queries the response was YES. [2024-05-12 11:19:56,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 1823 events. 990/1823 cut-off events. For 15303/15303 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10756 event pairs, 286 based on Foata normal form. 1/1770 useless extension candidates. Maximal degree in co-relation 7127. Up to 1557 conditions per place. [2024-05-12 11:19:56,358 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 100 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2024-05-12 11:19:56,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 121 transitions, 1015 flow [2024-05-12 11:19:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:19:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:19:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 11:19:56,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2024-05-12 11:19:56,359 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 719 flow. Second operand 8 states and 135 transitions. [2024-05-12 11:19:56,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 121 transitions, 1015 flow [2024-05-12 11:19:56,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 121 transitions, 942 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:19:56,406 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 679 flow [2024-05-12 11:19:56,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=679, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2024-05-12 11:19:56,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-05-12 11:19:56,407 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 679 flow [2024-05-12 11:19:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:56,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:56,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:56,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:19:56,407 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:19:56,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1307387055, now seen corresponding path program 1 times [2024-05-12 11:19:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117175421] [2024-05-12 11:19:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:02,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-05-12 11:20:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117175421] [2024-05-12 11:20:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117175421] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:02,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:20:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150039717] [2024-05-12 11:20:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:02,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:20:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:20:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:20:02,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:20:02,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:02,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:02,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:20:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:03,537 INFO L124 PetriNetUnfolderBase]: 881/1708 cut-off events. [2024-05-12 11:20:03,537 INFO L125 PetriNetUnfolderBase]: For 15540/15542 co-relation queries the response was YES. [2024-05-12 11:20:03,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 1708 events. 881/1708 cut-off events. For 15540/15542 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10481 event pairs, 258 based on Foata normal form. 4/1658 useless extension candidates. Maximal degree in co-relation 6396. Up to 1353 conditions per place. [2024-05-12 11:20:03,546 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 90 selfloop transitions, 16 changer transitions 0/124 dead transitions. [2024-05-12 11:20:03,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 979 flow [2024-05-12 11:20:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:20:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:20:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 11:20:03,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-05-12 11:20:03,548 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 679 flow. Second operand 8 states and 142 transitions. [2024-05-12 11:20:03,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 979 flow [2024-05-12 11:20:03,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 124 transitions, 915 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-05-12 11:20:03,564 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 702 flow [2024-05-12 11:20:03,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-05-12 11:20:03,564 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-05-12 11:20:03,564 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 702 flow [2024-05-12 11:20:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:03,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:03,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:03,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:20:03,565 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:03,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1307374190, now seen corresponding path program 1 times [2024-05-12 11:20:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625812216] [2024-05-12 11:20:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625812216] [2024-05-12 11:20:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625812216] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:11,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322984264] [2024-05-12 11:20:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:11,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:12,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:20:12,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 702 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:12,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:12,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:20:12,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:12,842 INFO L124 PetriNetUnfolderBase]: 881/1714 cut-off events. [2024-05-12 11:20:12,843 INFO L125 PetriNetUnfolderBase]: For 15963/15965 co-relation queries the response was YES. [2024-05-12 11:20:12,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 1714 events. 881/1714 cut-off events. For 15963/15965 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10566 event pairs, 252 based on Foata normal form. 4/1661 useless extension candidates. Maximal degree in co-relation 6508. Up to 1332 conditions per place. [2024-05-12 11:20:12,851 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 93 selfloop transitions, 19 changer transitions 0/130 dead transitions. [2024-05-12 11:20:12,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 130 transitions, 1000 flow [2024-05-12 11:20:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:20:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:20:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-05-12 11:20:12,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 11:20:12,853 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 702 flow. Second operand 8 states and 144 transitions. [2024-05-12 11:20:12,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 130 transitions, 1000 flow [2024-05-12 11:20:12,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 953 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:20:12,871 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 718 flow [2024-05-12 11:20:12,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=718, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2024-05-12 11:20:12,872 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-05-12 11:20:12,872 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 718 flow [2024-05-12 11:20:12,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:12,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:12,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:12,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:20:12,873 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:12,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1662109514, now seen corresponding path program 1 times [2024-05-12 11:20:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45083378] [2024-05-12 11:20:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45083378] [2024-05-12 11:20:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45083378] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363297715] [2024-05-12 11:20:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:20,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:20,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:20:20,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 718 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:20,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:20,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:20:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:20,882 INFO L124 PetriNetUnfolderBase]: 1000/1833 cut-off events. [2024-05-12 11:20:20,883 INFO L125 PetriNetUnfolderBase]: For 16890/16890 co-relation queries the response was YES. [2024-05-12 11:20:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1833 events. 1000/1833 cut-off events. For 16890/16890 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10773 event pairs, 222 based on Foata normal form. 1/1774 useless extension candidates. Maximal degree in co-relation 7192. Up to 1534 conditions per place. [2024-05-12 11:20:20,893 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 127 selfloop transitions, 15 changer transitions 0/149 dead transitions. [2024-05-12 11:20:20,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 149 transitions, 1154 flow [2024-05-12 11:20:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 11:20:20,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2024-05-12 11:20:20,895 INFO L175 Difference]: Start difference. First operand has 116 places, 104 transitions, 718 flow. Second operand 9 states and 164 transitions. [2024-05-12 11:20:20,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 149 transitions, 1154 flow [2024-05-12 11:20:20,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 149 transitions, 1113 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 11:20:20,918 INFO L231 Difference]: Finished difference. Result has 120 places, 106 transitions, 732 flow [2024-05-12 11:20:20,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=120, PETRI_TRANSITIONS=106} [2024-05-12 11:20:20,918 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-05-12 11:20:20,918 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 106 transitions, 732 flow [2024-05-12 11:20:20,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:20,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:20,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:20,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:20:20,919 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:20,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1589593438, now seen corresponding path program 1 times [2024-05-12 11:20:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145793995] [2024-05-12 11:20:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145793995] [2024-05-12 11:20:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145793995] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998278242] [2024-05-12 11:20:28,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:28,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:28,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:20:28,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 106 transitions, 732 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:28,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:28,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:20:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:29,369 INFO L124 PetriNetUnfolderBase]: 1062/1859 cut-off events. [2024-05-12 11:20:29,370 INFO L125 PetriNetUnfolderBase]: For 19643/19643 co-relation queries the response was YES. [2024-05-12 11:20:29,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7660 conditions, 1859 events. 1062/1859 cut-off events. For 19643/19643 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10504 event pairs, 170 based on Foata normal form. 3/1823 useless extension candidates. Maximal degree in co-relation 7604. Up to 1025 conditions per place. [2024-05-12 11:20:29,381 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 107 selfloop transitions, 45 changer transitions 0/159 dead transitions. [2024-05-12 11:20:29,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 159 transitions, 1284 flow [2024-05-12 11:20:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 11:20:29,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071225071225072 [2024-05-12 11:20:29,382 INFO L175 Difference]: Start difference. First operand has 120 places, 106 transitions, 732 flow. Second operand 9 states and 178 transitions. [2024-05-12 11:20:29,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 159 transitions, 1284 flow [2024-05-12 11:20:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 159 transitions, 1245 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-05-12 11:20:29,409 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 820 flow [2024-05-12 11:20:29,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=820, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-05-12 11:20:29,410 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-05-12 11:20:29,410 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 820 flow [2024-05-12 11:20:29,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:29,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:29,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:29,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:20:29,411 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:29,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1589593252, now seen corresponding path program 2 times [2024-05-12 11:20:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451453098] [2024-05-12 11:20:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451453098] [2024-05-12 11:20:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451453098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:36,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:36,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524960237] [2024-05-12 11:20:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:36,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:36,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:20:36,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 820 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:36,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:36,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:20:36,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:37,227 INFO L124 PetriNetUnfolderBase]: 1211/2203 cut-off events. [2024-05-12 11:20:37,227 INFO L125 PetriNetUnfolderBase]: For 21659/21659 co-relation queries the response was YES. [2024-05-12 11:20:37,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9274 conditions, 2203 events. 1211/2203 cut-off events. For 21659/21659 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13273 event pairs, 512 based on Foata normal form. 1/2144 useless extension candidates. Maximal degree in co-relation 9217. Up to 1739 conditions per place. [2024-05-12 11:20:37,240 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 130 selfloop transitions, 35 changer transitions 0/172 dead transitions. [2024-05-12 11:20:37,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 172 transitions, 1541 flow [2024-05-12 11:20:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:20:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:20:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 11:20:37,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2024-05-12 11:20:37,242 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 820 flow. Second operand 10 states and 172 transitions. [2024-05-12 11:20:37,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 172 transitions, 1541 flow [2024-05-12 11:20:37,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 172 transitions, 1468 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:20:37,271 INFO L231 Difference]: Finished difference. Result has 132 places, 133 transitions, 1082 flow [2024-05-12 11:20:37,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1082, PETRI_PLACES=132, PETRI_TRANSITIONS=133} [2024-05-12 11:20:37,271 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places. [2024-05-12 11:20:37,272 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 133 transitions, 1082 flow [2024-05-12 11:20:37,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:37,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:37,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:20:37,272 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:37,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -502026776, now seen corresponding path program 3 times [2024-05-12 11:20:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546906067] [2024-05-12 11:20:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546906067] [2024-05-12 11:20:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546906067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132190705] [2024-05-12 11:20:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:46,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:46,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:20:46,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 133 transitions, 1082 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:46,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:46,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:20:46,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:47,677 INFO L124 PetriNetUnfolderBase]: 1556/3037 cut-off events. [2024-05-12 11:20:47,678 INFO L125 PetriNetUnfolderBase]: For 26685/26689 co-relation queries the response was YES. [2024-05-12 11:20:47,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12865 conditions, 3037 events. 1556/3037 cut-off events. For 26685/26689 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20660 event pairs, 288 based on Foata normal form. 5/2913 useless extension candidates. Maximal degree in co-relation 12801. Up to 1909 conditions per place. [2024-05-12 11:20:47,698 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 192 selfloop transitions, 102 changer transitions 0/301 dead transitions. [2024-05-12 11:20:47,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 3197 flow [2024-05-12 11:20:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:20:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:20:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 11:20:47,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2024-05-12 11:20:47,701 INFO L175 Difference]: Start difference. First operand has 132 places, 133 transitions, 1082 flow. Second operand 10 states and 188 transitions. [2024-05-12 11:20:47,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 3197 flow [2024-05-12 11:20:47,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 301 transitions, 3115 flow, removed 40 selfloop flow, removed 1 redundant places. [2024-05-12 11:20:47,745 INFO L231 Difference]: Finished difference. Result has 146 places, 227 transitions, 2339 flow [2024-05-12 11:20:47,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2339, PETRI_PLACES=146, PETRI_TRANSITIONS=227} [2024-05-12 11:20:47,746 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places. [2024-05-12 11:20:47,746 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 227 transitions, 2339 flow [2024-05-12 11:20:47,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:47,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:47,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:47,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:20:47,747 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:47,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -656336128, now seen corresponding path program 4 times [2024-05-12 11:20:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820642340] [2024-05-12 11:20:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820642340] [2024-05-12 11:20:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820642340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549474576] [2024-05-12 11:20:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:57,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:57,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:20:57,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 227 transitions, 2339 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:57,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:57,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:20:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:58,344 INFO L124 PetriNetUnfolderBase]: 1787/3359 cut-off events. [2024-05-12 11:20:58,344 INFO L125 PetriNetUnfolderBase]: For 33871/33871 co-relation queries the response was YES. [2024-05-12 11:20:58,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16670 conditions, 3359 events. 1787/3359 cut-off events. For 33871/33871 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23259 event pairs, 344 based on Foata normal form. 1/3239 useless extension candidates. Maximal degree in co-relation 16598. Up to 2012 conditions per place. [2024-05-12 11:20:58,370 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 193 selfloop transitions, 181 changer transitions 0/381 dead transitions. [2024-05-12 11:20:58,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 381 transitions, 4782 flow [2024-05-12 11:20:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:20:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:20:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 11:20:58,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2024-05-12 11:20:58,373 INFO L175 Difference]: Start difference. First operand has 146 places, 227 transitions, 2339 flow. Second operand 10 states and 189 transitions. [2024-05-12 11:20:58,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 381 transitions, 4782 flow [2024-05-12 11:20:58,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 381 transitions, 4665 flow, removed 54 selfloop flow, removed 2 redundant places. [2024-05-12 11:20:58,448 INFO L231 Difference]: Finished difference. Result has 159 places, 312 transitions, 3963 flow [2024-05-12 11:20:58,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3963, PETRI_PLACES=159, PETRI_TRANSITIONS=312} [2024-05-12 11:20:58,448 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-05-12 11:20:58,449 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 312 transitions, 3963 flow [2024-05-12 11:20:58,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:58,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:58,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:58,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:20:58,449 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:20:58,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2143996270, now seen corresponding path program 5 times [2024-05-12 11:20:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157052272] [2024-05-12 11:20:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157052272] [2024-05-12 11:21:05,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157052272] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:05,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397189724] [2024-05-12 11:21:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:05,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:21:05,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 312 transitions, 3963 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:05,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:05,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:21:05,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:06,838 INFO L124 PetriNetUnfolderBase]: 1897/3765 cut-off events. [2024-05-12 11:21:06,838 INFO L125 PetriNetUnfolderBase]: For 39420/39420 co-relation queries the response was YES. [2024-05-12 11:21:06,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19578 conditions, 3765 events. 1897/3765 cut-off events. For 39420/39420 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 27429 event pairs, 374 based on Foata normal form. 1/3594 useless extension candidates. Maximal degree in co-relation 19499. Up to 2348 conditions per place. [2024-05-12 11:21:06,871 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 274 selfloop transitions, 195 changer transitions 0/476 dead transitions. [2024-05-12 11:21:06,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 476 transitions, 6866 flow [2024-05-12 11:21:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:21:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:21:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 11:21:06,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717948717948718 [2024-05-12 11:21:06,873 INFO L175 Difference]: Start difference. First operand has 159 places, 312 transitions, 3963 flow. Second operand 10 states and 184 transitions. [2024-05-12 11:21:06,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 476 transitions, 6866 flow [2024-05-12 11:21:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 476 transitions, 6777 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-05-12 11:21:06,977 INFO L231 Difference]: Finished difference. Result has 171 places, 409 transitions, 6002 flow [2024-05-12 11:21:06,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6002, PETRI_PLACES=171, PETRI_TRANSITIONS=409} [2024-05-12 11:21:06,978 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places. [2024-05-12 11:21:06,978 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 409 transitions, 6002 flow [2024-05-12 11:21:06,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:06,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:06,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:21:06,979 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:21:06,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2078533958, now seen corresponding path program 2 times [2024-05-12 11:21:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141973898] [2024-05-12 11:21:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141973898] [2024-05-12 11:21:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141973898] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218930242] [2024-05-12 11:21:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:16,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:16,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:21:16,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 409 transitions, 6002 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:16,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:16,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:21:16,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:17,688 INFO L124 PetriNetUnfolderBase]: 2231/4303 cut-off events. [2024-05-12 11:21:17,688 INFO L125 PetriNetUnfolderBase]: For 50302/50302 co-relation queries the response was YES. [2024-05-12 11:21:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23873 conditions, 4303 events. 2231/4303 cut-off events. For 50302/50302 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31512 event pairs, 415 based on Foata normal form. 3/4123 useless extension candidates. Maximal degree in co-relation 23788. Up to 2459 conditions per place. [2024-05-12 11:21:17,728 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 430 selfloop transitions, 101 changer transitions 0/538 dead transitions. [2024-05-12 11:21:17,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 538 transitions, 8279 flow [2024-05-12 11:21:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:21:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:21:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-05-12 11:21:17,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025641025641026 [2024-05-12 11:21:17,731 INFO L175 Difference]: Start difference. First operand has 171 places, 409 transitions, 6002 flow. Second operand 10 states and 196 transitions. [2024-05-12 11:21:17,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 538 transitions, 8279 flow [2024-05-12 11:21:17,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 538 transitions, 8177 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-05-12 11:21:17,872 INFO L231 Difference]: Finished difference. Result has 183 places, 465 transitions, 6916 flow [2024-05-12 11:21:17,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=5940, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6916, PETRI_PLACES=183, PETRI_TRANSITIONS=465} [2024-05-12 11:21:17,873 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places. [2024-05-12 11:21:17,873 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 465 transitions, 6916 flow [2024-05-12 11:21:17,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:17,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:17,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:17,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:21:17,873 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:21:17,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 483201060, now seen corresponding path program 6 times [2024-05-12 11:21:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451919860] [2024-05-12 11:21:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:26,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-05-12 11:21:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451919860] [2024-05-12 11:21:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451919860] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:26,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:26,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142552670] [2024-05-12 11:21:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:26,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:26,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:26,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:27,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:21:27,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 465 transitions, 6916 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:27,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:27,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:21:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:28,525 INFO L124 PetriNetUnfolderBase]: 2243/4325 cut-off events. [2024-05-12 11:21:28,526 INFO L125 PetriNetUnfolderBase]: For 54443/54443 co-relation queries the response was YES. [2024-05-12 11:21:28,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25855 conditions, 4325 events. 2243/4325 cut-off events. For 54443/54443 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 31542 event pairs, 419 based on Foata normal form. 1/4146 useless extension candidates. Maximal degree in co-relation 25763. Up to 2729 conditions per place. [2024-05-12 11:21:28,571 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 278 selfloop transitions, 241 changer transitions 0/526 dead transitions. [2024-05-12 11:21:28,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 526 transitions, 8611 flow [2024-05-12 11:21:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:21:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:21:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 11:21:28,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717948717948718 [2024-05-12 11:21:28,573 INFO L175 Difference]: Start difference. First operand has 183 places, 465 transitions, 6916 flow. Second operand 10 states and 184 transitions. [2024-05-12 11:21:28,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 526 transitions, 8611 flow [2024-05-12 11:21:28,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 526 transitions, 8460 flow, removed 70 selfloop flow, removed 2 redundant places. [2024-05-12 11:21:28,810 INFO L231 Difference]: Finished difference. Result has 191 places, 477 transitions, 7492 flow [2024-05-12 11:21:28,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=6797, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7492, PETRI_PLACES=191, PETRI_TRANSITIONS=477} [2024-05-12 11:21:28,811 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2024-05-12 11:21:28,811 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 477 transitions, 7492 flow [2024-05-12 11:21:28,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:28,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:28,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:28,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:21:28,812 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:21:28,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 483207756, now seen corresponding path program 3 times [2024-05-12 11:21:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906480775] [2024-05-12 11:21:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906480775] [2024-05-12 11:21:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906480775] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106731435] [2024-05-12 11:21:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:37,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:21:37,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 477 transitions, 7492 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:37,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:37,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:21:37,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:38,992 INFO L124 PetriNetUnfolderBase]: 2237/4319 cut-off events. [2024-05-12 11:21:38,992 INFO L125 PetriNetUnfolderBase]: For 57513/57513 co-relation queries the response was YES. [2024-05-12 11:21:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26276 conditions, 4319 events. 2237/4319 cut-off events. For 57513/57513 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 31701 event pairs, 419 based on Foata normal form. 3/4137 useless extension candidates. Maximal degree in co-relation 26182. Up to 2474 conditions per place. [2024-05-12 11:21:39,037 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 422 selfloop transitions, 112 changer transitions 0/541 dead transitions. [2024-05-12 11:21:39,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 541 transitions, 9058 flow [2024-05-12 11:21:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:21:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:21:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 11:21:39,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2024-05-12 11:21:39,039 INFO L175 Difference]: Start difference. First operand has 191 places, 477 transitions, 7492 flow. Second operand 10 states and 192 transitions. [2024-05-12 11:21:39,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 541 transitions, 9058 flow [2024-05-12 11:21:39,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 541 transitions, 8711 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 11:21:39,204 INFO L231 Difference]: Finished difference. Result has 195 places, 477 transitions, 7374 flow [2024-05-12 11:21:39,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7145, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7374, PETRI_PLACES=195, PETRI_TRANSITIONS=477} [2024-05-12 11:21:39,205 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places. [2024-05-12 11:21:39,205 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 477 transitions, 7374 flow [2024-05-12 11:21:39,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:39,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:39,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:39,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:21:39,206 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:21:39,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash 75197614, now seen corresponding path program 7 times [2024-05-12 11:21:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059081953] [2024-05-12 11:21:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059081953] [2024-05-12 11:21:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059081953] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16841738] [2024-05-12 11:21:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:48,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:21:48,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 477 transitions, 7374 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:48,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:48,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:21:48,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:50,225 INFO L124 PetriNetUnfolderBase]: 2269/4352 cut-off events. [2024-05-12 11:21:50,226 INFO L125 PetriNetUnfolderBase]: For 59962/59962 co-relation queries the response was YES. [2024-05-12 11:21:50,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26631 conditions, 4352 events. 2269/4352 cut-off events. For 59962/59962 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32286 event pairs, 400 based on Foata normal form. 1/4175 useless extension candidates. Maximal degree in co-relation 26537. Up to 2640 conditions per place. [2024-05-12 11:21:50,262 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 273 selfloop transitions, 280 changer transitions 0/560 dead transitions. [2024-05-12 11:21:50,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 560 transitions, 9463 flow [2024-05-12 11:21:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:21:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:21:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 11:21:50,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2024-05-12 11:21:50,264 INFO L175 Difference]: Start difference. First operand has 195 places, 477 transitions, 7374 flow. Second operand 10 states and 188 transitions. [2024-05-12 11:21:50,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 560 transitions, 9463 flow [2024-05-12 11:21:50,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 560 transitions, 9302 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 11:21:50,410 INFO L231 Difference]: Finished difference. Result has 201 places, 497 transitions, 8212 flow [2024-05-12 11:21:50,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7235, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8212, PETRI_PLACES=201, PETRI_TRANSITIONS=497} [2024-05-12 11:21:50,411 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places. [2024-05-12 11:21:50,411 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 497 transitions, 8212 flow [2024-05-12 11:21:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:50,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:50,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:50,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:21:50,412 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:21:50,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 75197800, now seen corresponding path program 4 times [2024-05-12 11:21:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519058264] [2024-05-12 11:21:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:59,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519058264] [2024-05-12 11:21:59,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519058264] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:59,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:59,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733253207] [2024-05-12 11:21:59,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:59,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:00,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:00,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 497 transitions, 8212 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:00,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:00,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:00,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:01,934 INFO L124 PetriNetUnfolderBase]: 2881/5552 cut-off events. [2024-05-12 11:22:01,935 INFO L125 PetriNetUnfolderBase]: For 76008/76008 co-relation queries the response was YES. [2024-05-12 11:22:01,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32420 conditions, 5552 events. 2881/5552 cut-off events. For 76008/76008 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 43508 event pairs, 503 based on Foata normal form. 3/5309 useless extension candidates. Maximal degree in co-relation 32323. Up to 2692 conditions per place. [2024-05-12 11:22:01,996 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 484 selfloop transitions, 159 changer transitions 0/650 dead transitions. [2024-05-12 11:22:01,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 650 transitions, 10940 flow [2024-05-12 11:22:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:22:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:22:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-05-12 11:22:01,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2024-05-12 11:22:01,998 INFO L175 Difference]: Start difference. First operand has 201 places, 497 transitions, 8212 flow. Second operand 10 states and 201 transitions. [2024-05-12 11:22:01,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 650 transitions, 10940 flow [2024-05-12 11:22:02,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 650 transitions, 10483 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-05-12 11:22:02,224 INFO L231 Difference]: Finished difference. Result has 210 places, 558 transitions, 8852 flow [2024-05-12 11:22:02,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7755, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8852, PETRI_PLACES=210, PETRI_TRANSITIONS=558} [2024-05-12 11:22:02,234 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places. [2024-05-12 11:22:02,234 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 558 transitions, 8852 flow [2024-05-12 11:22:02,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:02,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:02,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:02,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:22:02,235 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:22:02,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash -656156452, now seen corresponding path program 5 times [2024-05-12 11:22:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181659990] [2024-05-12 11:22:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181659990] [2024-05-12 11:22:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181659990] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278141632] [2024-05-12 11:22:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:11,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:11,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 558 transitions, 8852 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:11,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:11,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:13,380 INFO L124 PetriNetUnfolderBase]: 2875/5515 cut-off events. [2024-05-12 11:22:13,380 INFO L125 PetriNetUnfolderBase]: For 77594/77594 co-relation queries the response was YES. [2024-05-12 11:22:13,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33572 conditions, 5515 events. 2875/5515 cut-off events. For 77594/77594 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 43098 event pairs, 493 based on Foata normal form. 3/5279 useless extension candidates. Maximal degree in co-relation 33470. Up to 2688 conditions per place. [2024-05-12 11:22:13,434 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 466 selfloop transitions, 167 changer transitions 0/640 dead transitions. [2024-05-12 11:22:13,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 640 transitions, 10878 flow [2024-05-12 11:22:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:22:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:22:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-05-12 11:22:13,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051282051282051 [2024-05-12 11:22:13,436 INFO L175 Difference]: Start difference. First operand has 210 places, 558 transitions, 8852 flow. Second operand 10 states and 197 transitions. [2024-05-12 11:22:13,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 640 transitions, 10878 flow [2024-05-12 11:22:13,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 640 transitions, 10835 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-05-12 11:22:13,655 INFO L231 Difference]: Finished difference. Result has 218 places, 558 transitions, 9154 flow [2024-05-12 11:22:13,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=8809, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9154, PETRI_PLACES=218, PETRI_TRANSITIONS=558} [2024-05-12 11:22:13,657 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-05-12 11:22:13,657 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 558 transitions, 9154 flow [2024-05-12 11:22:13,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:13,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:13,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:13,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:22:13,657 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:22:13,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 509804236, now seen corresponding path program 6 times [2024-05-12 11:22:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407072230] [2024-05-12 11:22:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407072230] [2024-05-12 11:22:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407072230] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487202946] [2024-05-12 11:22:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:23,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:23,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 558 transitions, 9154 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:23,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:23,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:23,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:25,137 INFO L124 PetriNetUnfolderBase]: 3034/5621 cut-off events. [2024-05-12 11:22:25,138 INFO L125 PetriNetUnfolderBase]: For 83813/83813 co-relation queries the response was YES. [2024-05-12 11:22:25,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36011 conditions, 5621 events. 3034/5621 cut-off events. For 83813/83813 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 42680 event pairs, 489 based on Foata normal form. 3/5422 useless extension candidates. Maximal degree in co-relation 35907. Up to 2760 conditions per place. [2024-05-12 11:22:25,198 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 453 selfloop transitions, 206 changer transitions 0/666 dead transitions. [2024-05-12 11:22:25,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 666 transitions, 11698 flow [2024-05-12 11:22:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:22:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:22:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-05-12 11:22:25,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:22:25,203 INFO L175 Difference]: Start difference. First operand has 218 places, 558 transitions, 9154 flow. Second operand 10 states and 195 transitions. [2024-05-12 11:22:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 666 transitions, 11698 flow [2024-05-12 11:22:25,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 666 transitions, 11447 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:22:25,451 INFO L231 Difference]: Finished difference. Result has 226 places, 581 transitions, 9929 flow [2024-05-12 11:22:25,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=8921, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9929, PETRI_PLACES=226, PETRI_TRANSITIONS=581} [2024-05-12 11:22:25,453 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-05-12 11:22:25,453 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 581 transitions, 9929 flow [2024-05-12 11:22:25,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:25,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:25,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:25,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:22:25,454 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:22:25,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -487835594, now seen corresponding path program 7 times [2024-05-12 11:22:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510223312] [2024-05-12 11:22:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510223312] [2024-05-12 11:22:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510223312] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:35,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215593256] [2024-05-12 11:22:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:35,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:35,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:35,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 581 transitions, 9929 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:35,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:35,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:35,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:37,201 INFO L124 PetriNetUnfolderBase]: 3088/5733 cut-off events. [2024-05-12 11:22:37,201 INFO L125 PetriNetUnfolderBase]: For 90557/90557 co-relation queries the response was YES. [2024-05-12 11:22:37,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37865 conditions, 5733 events. 3088/5733 cut-off events. For 90557/90557 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 43720 event pairs, 492 based on Foata normal form. 3/5527 useless extension candidates. Maximal degree in co-relation 37756. Up to 2800 conditions per place. [2024-05-12 11:22:37,264 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 505 selfloop transitions, 170 changer transitions 0/682 dead transitions. [2024-05-12 11:22:37,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 682 transitions, 12381 flow [2024-05-12 11:22:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:22:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:22:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-05-12 11:22:37,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-05-12 11:22:37,266 INFO L175 Difference]: Start difference. First operand has 226 places, 581 transitions, 9929 flow. Second operand 10 states and 198 transitions. [2024-05-12 11:22:37,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 682 transitions, 12381 flow [2024-05-12 11:22:37,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 682 transitions, 12195 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 11:22:37,522 INFO L231 Difference]: Finished difference. Result has 234 places, 591 transitions, 10381 flow [2024-05-12 11:22:37,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=9754, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10381, PETRI_PLACES=234, PETRI_TRANSITIONS=591} [2024-05-12 11:22:37,523 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places. [2024-05-12 11:22:37,523 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 591 transitions, 10381 flow [2024-05-12 11:22:37,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:37,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:37,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:37,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:22:37,524 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:22:37,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash -487835780, now seen corresponding path program 8 times [2024-05-12 11:22:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567552614] [2024-05-12 11:22:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567552614] [2024-05-12 11:22:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567552614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848519722] [2024-05-12 11:22:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:47,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:47,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:47,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 591 transitions, 10381 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:47,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:47,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:47,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:49,071 INFO L124 PetriNetUnfolderBase]: 3093/5834 cut-off events. [2024-05-12 11:22:49,071 INFO L125 PetriNetUnfolderBase]: For 95509/95509 co-relation queries the response was YES. [2024-05-12 11:22:49,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38717 conditions, 5834 events. 3093/5834 cut-off events. For 95509/95509 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 45201 event pairs, 566 based on Foata normal form. 1/5601 useless extension candidates. Maximal degree in co-relation 38605. Up to 3903 conditions per place. [2024-05-12 11:22:49,129 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 350 selfloop transitions, 293 changer transitions 0/650 dead transitions. [2024-05-12 11:22:49,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 650 transitions, 12292 flow [2024-05-12 11:22:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:22:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:22:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 11:22:49,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717948717948718 [2024-05-12 11:22:49,131 INFO L175 Difference]: Start difference. First operand has 234 places, 591 transitions, 10381 flow. Second operand 10 states and 184 transitions. [2024-05-12 11:22:49,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 650 transitions, 12292 flow [2024-05-12 11:22:49,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 650 transitions, 12022 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:22:49,459 INFO L231 Difference]: Finished difference. Result has 239 places, 595 transitions, 10796 flow [2024-05-12 11:22:49,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10127, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10796, PETRI_PLACES=239, PETRI_TRANSITIONS=595} [2024-05-12 11:22:49,460 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-05-12 11:22:49,460 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 595 transitions, 10796 flow [2024-05-12 11:22:49,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:49,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:49,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:49,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:22:49,461 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:22:49,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash -483666562, now seen corresponding path program 8 times [2024-05-12 11:22:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532409025] [2024-05-12 11:22:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532409025] [2024-05-12 11:22:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532409025] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:58,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:58,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333528646] [2024-05-12 11:22:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:58,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:59,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:22:59,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 595 transitions, 10796 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:59,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:59,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:22:59,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:00,962 INFO L124 PetriNetUnfolderBase]: 3087/5761 cut-off events. [2024-05-12 11:23:00,963 INFO L125 PetriNetUnfolderBase]: For 98239/98239 co-relation queries the response was YES. [2024-05-12 11:23:01,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38529 conditions, 5761 events. 3087/5761 cut-off events. For 98239/98239 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 44140 event pairs, 522 based on Foata normal form. 3/5548 useless extension candidates. Maximal degree in co-relation 38416. Up to 2804 conditions per place. [2024-05-12 11:23:01,029 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 509 selfloop transitions, 169 changer transitions 0/685 dead transitions. [2024-05-12 11:23:01,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 685 transitions, 12990 flow [2024-05-12 11:23:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:23:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:23:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-05-12 11:23:01,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-05-12 11:23:01,031 INFO L175 Difference]: Start difference. First operand has 239 places, 595 transitions, 10796 flow. Second operand 10 states and 198 transitions. [2024-05-12 11:23:01,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 685 transitions, 12990 flow [2024-05-12 11:23:01,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 685 transitions, 12599 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-05-12 11:23:01,325 INFO L231 Difference]: Finished difference. Result has 245 places, 595 transitions, 10751 flow [2024-05-12 11:23:01,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10405, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10751, PETRI_PLACES=245, PETRI_TRANSITIONS=595} [2024-05-12 11:23:01,325 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-05-12 11:23:01,326 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 595 transitions, 10751 flow [2024-05-12 11:23:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:01,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:01,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:23:01,326 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:01,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 583908442, now seen corresponding path program 9 times [2024-05-12 11:23:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049908210] [2024-05-12 11:23:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049908210] [2024-05-12 11:23:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049908210] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769655811] [2024-05-12 11:23:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:08,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:08,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 595 transitions, 10751 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:08,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:08,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:08,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:10,467 INFO L124 PetriNetUnfolderBase]: 3201/6082 cut-off events. [2024-05-12 11:23:10,468 INFO L125 PetriNetUnfolderBase]: For 109595/109595 co-relation queries the response was YES. [2024-05-12 11:23:10,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39966 conditions, 6082 events. 3201/6082 cut-off events. For 109595/109595 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 47358 event pairs, 542 based on Foata normal form. 3/5839 useless extension candidates. Maximal degree in co-relation 39853. Up to 2432 conditions per place. [2024-05-12 11:23:10,528 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 413 selfloop transitions, 254 changer transitions 0/674 dead transitions. [2024-05-12 11:23:10,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 674 transitions, 13046 flow [2024-05-12 11:23:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-05-12 11:23:10,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2024-05-12 11:23:10,530 INFO L175 Difference]: Start difference. First operand has 245 places, 595 transitions, 10751 flow. Second operand 9 states and 177 transitions. [2024-05-12 11:23:10,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 674 transitions, 13046 flow [2024-05-12 11:23:10,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 674 transitions, 12743 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 11:23:10,837 INFO L231 Difference]: Finished difference. Result has 247 places, 605 transitions, 11132 flow [2024-05-12 11:23:10,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10480, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11132, PETRI_PLACES=247, PETRI_TRANSITIONS=605} [2024-05-12 11:23:10,838 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-05-12 11:23:10,838 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 605 transitions, 11132 flow [2024-05-12 11:23:10,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:10,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:10,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:10,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:23:10,839 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:10,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 583901932, now seen corresponding path program 10 times [2024-05-12 11:23:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:10,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884238500] [2024-05-12 11:23:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:17,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-05-12 11:23:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884238500] [2024-05-12 11:23:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884238500] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508481721] [2024-05-12 11:23:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:17,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:17,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 605 transitions, 11132 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:17,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:17,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:19,667 INFO L124 PetriNetUnfolderBase]: 3195/6073 cut-off events. [2024-05-12 11:23:19,667 INFO L125 PetriNetUnfolderBase]: For 112449/112449 co-relation queries the response was YES. [2024-05-12 11:23:19,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40362 conditions, 6073 events. 3195/6073 cut-off events. For 112449/112449 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 47262 event pairs, 536 based on Foata normal form. 3/5830 useless extension candidates. Maximal degree in co-relation 40248. Up to 2428 conditions per place. [2024-05-12 11:23:19,738 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 445 selfloop transitions, 235 changer transitions 0/687 dead transitions. [2024-05-12 11:23:19,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 687 transitions, 13391 flow [2024-05-12 11:23:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-05-12 11:23:19,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50997150997151 [2024-05-12 11:23:19,739 INFO L175 Difference]: Start difference. First operand has 247 places, 605 transitions, 11132 flow. Second operand 9 states and 179 transitions. [2024-05-12 11:23:19,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 687 transitions, 13391 flow [2024-05-12 11:23:20,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 687 transitions, 13058 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-05-12 11:23:20,048 INFO L231 Difference]: Finished difference. Result has 249 places, 605 transitions, 11308 flow [2024-05-12 11:23:20,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10803, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11308, PETRI_PLACES=249, PETRI_TRANSITIONS=605} [2024-05-12 11:23:20,049 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-05-12 11:23:20,049 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 605 transitions, 11308 flow [2024-05-12 11:23:20,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:20,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:20,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:20,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:23:20,049 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:20,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 583901746, now seen corresponding path program 9 times [2024-05-12 11:23:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760337930] [2024-05-12 11:23:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760337930] [2024-05-12 11:23:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760337930] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395712235] [2024-05-12 11:23:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:27,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:27,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 605 transitions, 11308 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:27,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:27,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:27,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:28,704 INFO L124 PetriNetUnfolderBase]: 3220/6055 cut-off events. [2024-05-12 11:23:28,705 INFO L125 PetriNetUnfolderBase]: For 114893/114893 co-relation queries the response was YES. [2024-05-12 11:23:28,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40914 conditions, 6055 events. 3220/6055 cut-off events. For 114893/114893 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 47167 event pairs, 565 based on Foata normal form. 1/5817 useless extension candidates. Maximal degree in co-relation 40801. Up to 4026 conditions per place. [2024-05-12 11:23:28,772 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 328 selfloop transitions, 339 changer transitions 0/674 dead transitions. [2024-05-12 11:23:28,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 674 transitions, 13507 flow [2024-05-12 11:23:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-05-12 11:23:28,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47293447293447294 [2024-05-12 11:23:28,792 INFO L175 Difference]: Start difference. First operand has 249 places, 605 transitions, 11308 flow. Second operand 9 states and 166 transitions. [2024-05-12 11:23:28,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 674 transitions, 13507 flow [2024-05-12 11:23:29,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 674 transitions, 12943 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-05-12 11:23:29,111 INFO L231 Difference]: Finished difference. Result has 248 places, 615 transitions, 11656 flow [2024-05-12 11:23:29,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10748, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11656, PETRI_PLACES=248, PETRI_TRANSITIONS=615} [2024-05-12 11:23:29,112 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places. [2024-05-12 11:23:29,112 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 615 transitions, 11656 flow [2024-05-12 11:23:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:29,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:29,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:23:29,113 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:29,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 756391636, now seen corresponding path program 10 times [2024-05-12 11:23:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143200026] [2024-05-12 11:23:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143200026] [2024-05-12 11:23:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143200026] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759713972] [2024-05-12 11:23:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:36,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:36,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:36,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 615 transitions, 11656 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:36,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:36,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:36,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:37,912 INFO L124 PetriNetUnfolderBase]: 3252/6166 cut-off events. [2024-05-12 11:23:37,912 INFO L125 PetriNetUnfolderBase]: For 110692/110692 co-relation queries the response was YES. [2024-05-12 11:23:37,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41019 conditions, 6166 events. 3252/6166 cut-off events. For 110692/110692 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 48506 event pairs, 602 based on Foata normal form. 1/5919 useless extension candidates. Maximal degree in co-relation 40907. Up to 4062 conditions per place. [2024-05-12 11:23:37,981 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 344 selfloop transitions, 340 changer transitions 0/691 dead transitions. [2024-05-12 11:23:37,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 691 transitions, 14068 flow [2024-05-12 11:23:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 11:23:37,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2024-05-12 11:23:37,983 INFO L175 Difference]: Start difference. First operand has 248 places, 615 transitions, 11656 flow. Second operand 9 states and 164 transitions. [2024-05-12 11:23:37,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 691 transitions, 14068 flow [2024-05-12 11:23:38,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 691 transitions, 13463 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-05-12 11:23:38,329 INFO L231 Difference]: Finished difference. Result has 249 places, 629 transitions, 12051 flow [2024-05-12 11:23:38,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11069, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12051, PETRI_PLACES=249, PETRI_TRANSITIONS=629} [2024-05-12 11:23:38,330 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-05-12 11:23:38,330 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 629 transitions, 12051 flow [2024-05-12 11:23:38,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:38,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:38,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:38,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:23:38,331 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:38,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 756391822, now seen corresponding path program 11 times [2024-05-12 11:23:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583791273] [2024-05-12 11:23:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:45,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583791273] [2024-05-12 11:23:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583791273] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718709650] [2024-05-12 11:23:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:45,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:45,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:45,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 629 transitions, 12051 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:45,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:45,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:45,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:47,428 INFO L124 PetriNetUnfolderBase]: 3408/6432 cut-off events. [2024-05-12 11:23:47,428 INFO L125 PetriNetUnfolderBase]: For 119527/119527 co-relation queries the response was YES. [2024-05-12 11:23:47,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42569 conditions, 6432 events. 3408/6432 cut-off events. For 119527/119527 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 50847 event pairs, 527 based on Foata normal form. 3/6179 useless extension candidates. Maximal degree in co-relation 42458. Up to 2633 conditions per place. [2024-05-12 11:23:47,498 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 511 selfloop transitions, 225 changer transitions 0/743 dead transitions. [2024-05-12 11:23:47,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 743 transitions, 14950 flow [2024-05-12 11:23:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 11:23:47,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071225071225072 [2024-05-12 11:23:47,500 INFO L175 Difference]: Start difference. First operand has 249 places, 629 transitions, 12051 flow. Second operand 9 states and 178 transitions. [2024-05-12 11:23:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 743 transitions, 14950 flow [2024-05-12 11:23:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 743 transitions, 14312 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-05-12 11:23:47,816 INFO L231 Difference]: Finished difference. Result has 251 places, 645 transitions, 12118 flow [2024-05-12 11:23:47,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11417, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12118, PETRI_PLACES=251, PETRI_TRANSITIONS=645} [2024-05-12 11:23:47,817 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-05-12 11:23:47,817 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 645 transitions, 12118 flow [2024-05-12 11:23:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:47,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:47,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:47,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:23:47,818 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:47,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash 756398332, now seen corresponding path program 12 times [2024-05-12 11:23:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956394361] [2024-05-12 11:23:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956394361] [2024-05-12 11:23:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956394361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:54,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:54,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:54,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228636467] [2024-05-12 11:23:54,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:54,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:55,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:23:55,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 645 transitions, 12118 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:55,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:55,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:23:55,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:56,892 INFO L124 PetriNetUnfolderBase]: 3483/6603 cut-off events. [2024-05-12 11:23:56,892 INFO L125 PetriNetUnfolderBase]: For 126250/126250 co-relation queries the response was YES. [2024-05-12 11:23:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43821 conditions, 6603 events. 3483/6603 cut-off events. For 126250/126250 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 52626 event pairs, 601 based on Foata normal form. 3/6337 useless extension candidates. Maximal degree in co-relation 43710. Up to 2689 conditions per place. [2024-05-12 11:23:56,968 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 513 selfloop transitions, 231 changer transitions 0/751 dead transitions. [2024-05-12 11:23:56,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 751 transitions, 14938 flow [2024-05-12 11:23:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-05-12 11:23:56,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50997150997151 [2024-05-12 11:23:56,970 INFO L175 Difference]: Start difference. First operand has 251 places, 645 transitions, 12118 flow. Second operand 9 states and 179 transitions. [2024-05-12 11:23:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 751 transitions, 14938 flow [2024-05-12 11:23:57,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 751 transitions, 14583 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 11:23:57,339 INFO L231 Difference]: Finished difference. Result has 254 places, 653 transitions, 12373 flow [2024-05-12 11:23:57,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11775, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12373, PETRI_PLACES=254, PETRI_TRANSITIONS=653} [2024-05-12 11:23:57,340 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2024-05-12 11:23:57,340 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 653 transitions, 12373 flow [2024-05-12 11:23:57,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:57,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:57,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:57,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:23:57,341 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:23:57,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1766962108, now seen corresponding path program 13 times [2024-05-12 11:23:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751141627] [2024-05-12 11:23:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:57,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:03,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751141627] [2024-05-12 11:24:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751141627] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:03,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777827932] [2024-05-12 11:24:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:03,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:03,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:03,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:03,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:03,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 653 transitions, 12373 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:03,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:03,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:03,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:05,234 INFO L124 PetriNetUnfolderBase]: 3771/7114 cut-off events. [2024-05-12 11:24:05,234 INFO L125 PetriNetUnfolderBase]: For 139070/139070 co-relation queries the response was YES. [2024-05-12 11:24:05,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47147 conditions, 7114 events. 3771/7114 cut-off events. For 139070/139070 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 57331 event pairs, 1086 based on Foata normal form. 3/6841 useless extension candidates. Maximal degree in co-relation 47036. Up to 3967 conditions per place. [2024-05-12 11:24:05,302 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 567 selfloop transitions, 205 changer transitions 0/779 dead transitions. [2024-05-12 11:24:05,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 779 transitions, 15681 flow [2024-05-12 11:24:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:24:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:24:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 11:24:05,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 11:24:05,304 INFO L175 Difference]: Start difference. First operand has 254 places, 653 transitions, 12373 flow. Second operand 10 states and 182 transitions. [2024-05-12 11:24:05,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 779 transitions, 15681 flow [2024-05-12 11:24:05,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 779 transitions, 15192 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-05-12 11:24:05,638 INFO L231 Difference]: Finished difference. Result has 261 places, 697 transitions, 13518 flow [2024-05-12 11:24:05,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11966, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13518, PETRI_PLACES=261, PETRI_TRANSITIONS=697} [2024-05-12 11:24:05,639 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places. [2024-05-12 11:24:05,639 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 697 transitions, 13518 flow [2024-05-12 11:24:05,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:05,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:05,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:05,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:24:05,639 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:05,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1159045242, now seen corresponding path program 14 times [2024-05-12 11:24:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338743118] [2024-05-12 11:24:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:05,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338743118] [2024-05-12 11:24:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338743118] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868719242] [2024-05-12 11:24:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:12,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:12,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:12,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 697 transitions, 13518 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:12,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:12,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:12,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:14,634 INFO L124 PetriNetUnfolderBase]: 3846/6985 cut-off events. [2024-05-12 11:24:14,635 INFO L125 PetriNetUnfolderBase]: For 139248/139248 co-relation queries the response was YES. [2024-05-12 11:24:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48513 conditions, 6985 events. 3846/6985 cut-off events. For 139248/139248 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 54417 event pairs, 1290 based on Foata normal form. 3/6772 useless extension candidates. Maximal degree in co-relation 48398. Up to 5804 conditions per place. [2024-05-12 11:24:14,717 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 715 selfloop transitions, 30 changer transitions 0/752 dead transitions. [2024-05-12 11:24:14,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 752 transitions, 15541 flow [2024-05-12 11:24:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 11:24:14,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 11:24:14,735 INFO L175 Difference]: Start difference. First operand has 261 places, 697 transitions, 13518 flow. Second operand 9 states and 156 transitions. [2024-05-12 11:24:14,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 752 transitions, 15541 flow [2024-05-12 11:24:15,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 752 transitions, 15144 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-05-12 11:24:15,168 INFO L231 Difference]: Finished difference. Result has 262 places, 705 transitions, 13351 flow [2024-05-12 11:24:15,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13137, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13351, PETRI_PLACES=262, PETRI_TRANSITIONS=705} [2024-05-12 11:24:15,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-05-12 11:24:15,169 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 705 transitions, 13351 flow [2024-05-12 11:24:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:15,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:15,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:15,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 11:24:15,169 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:15,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1874292036, now seen corresponding path program 1 times [2024-05-12 11:24:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786797589] [2024-05-12 11:24:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:21,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786797589] [2024-05-12 11:24:21,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786797589] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:21,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:21,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:21,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086475614] [2024-05-12 11:24:21,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:21,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:21,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:21,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:21,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 705 transitions, 13351 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:21,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:21,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:21,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:23,667 INFO L124 PetriNetUnfolderBase]: 3848/7018 cut-off events. [2024-05-12 11:24:23,667 INFO L125 PetriNetUnfolderBase]: For 134105/134105 co-relation queries the response was YES. [2024-05-12 11:24:23,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47627 conditions, 7018 events. 3848/7018 cut-off events. For 134105/134105 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 54823 event pairs, 1321 based on Foata normal form. 2/6797 useless extension candidates. Maximal degree in co-relation 47511. Up to 5984 conditions per place. [2024-05-12 11:24:23,752 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 708 selfloop transitions, 19 changer transitions 0/734 dead transitions. [2024-05-12 11:24:23,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 734 transitions, 14981 flow [2024-05-12 11:24:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 11:24:23,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43304843304843305 [2024-05-12 11:24:23,753 INFO L175 Difference]: Start difference. First operand has 262 places, 705 transitions, 13351 flow. Second operand 9 states and 152 transitions. [2024-05-12 11:24:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 734 transitions, 14981 flow [2024-05-12 11:24:24,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 734 transitions, 14916 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-05-12 11:24:24,159 INFO L231 Difference]: Finished difference. Result has 264 places, 707 transitions, 13353 flow [2024-05-12 11:24:24,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13286, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13353, PETRI_PLACES=264, PETRI_TRANSITIONS=707} [2024-05-12 11:24:24,159 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places. [2024-05-12 11:24:24,160 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 707 transitions, 13353 flow [2024-05-12 11:24:24,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:24,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:24,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 11:24:24,160 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:24,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2096848082, now seen corresponding path program 15 times [2024-05-12 11:24:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921686699] [2024-05-12 11:24:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921686699] [2024-05-12 11:24:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921686699] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142602268] [2024-05-12 11:24:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:30,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:30,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:30,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 707 transitions, 13353 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:30,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:30,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:30,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:32,548 INFO L124 PetriNetUnfolderBase]: 3923/7211 cut-off events. [2024-05-12 11:24:32,549 INFO L125 PetriNetUnfolderBase]: For 138448/138448 co-relation queries the response was YES. [2024-05-12 11:24:32,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48520 conditions, 7211 events. 3923/7211 cut-off events. For 138448/138448 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 57027 event pairs, 1294 based on Foata normal form. 3/6973 useless extension candidates. Maximal degree in co-relation 48403. Up to 5415 conditions per place. [2024-05-12 11:24:32,634 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 711 selfloop transitions, 75 changer transitions 0/793 dead transitions. [2024-05-12 11:24:32,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 793 transitions, 15937 flow [2024-05-12 11:24:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-05-12 11:24:32,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47293447293447294 [2024-05-12 11:24:32,635 INFO L175 Difference]: Start difference. First operand has 264 places, 707 transitions, 13353 flow. Second operand 9 states and 166 transitions. [2024-05-12 11:24:32,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 793 transitions, 15937 flow [2024-05-12 11:24:33,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 793 transitions, 15886 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-05-12 11:24:33,101 INFO L231 Difference]: Finished difference. Result has 266 places, 715 transitions, 13606 flow [2024-05-12 11:24:33,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13302, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13606, PETRI_PLACES=266, PETRI_TRANSITIONS=715} [2024-05-12 11:24:33,101 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places. [2024-05-12 11:24:33,102 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 715 transitions, 13606 flow [2024-05-12 11:24:33,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:33,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:33,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:33,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 11:24:33,102 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:33,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2096610746, now seen corresponding path program 11 times [2024-05-12 11:24:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098021084] [2024-05-12 11:24:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098021084] [2024-05-12 11:24:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098021084] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059962627] [2024-05-12 11:24:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:39,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:39,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:39,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 715 transitions, 13606 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:39,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:39,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:39,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:41,978 INFO L124 PetriNetUnfolderBase]: 3921/7225 cut-off events. [2024-05-12 11:24:41,979 INFO L125 PetriNetUnfolderBase]: For 138747/138747 co-relation queries the response was YES. [2024-05-12 11:24:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48814 conditions, 7225 events. 3921/7225 cut-off events. For 138747/138747 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 57248 event pairs, 1391 based on Foata normal form. 1/6981 useless extension candidates. Maximal degree in co-relation 48696. Up to 6078 conditions per place. [2024-05-12 11:24:42,049 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 690 selfloop transitions, 55 changer transitions 0/752 dead transitions. [2024-05-12 11:24:42,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 752 transitions, 15427 flow [2024-05-12 11:24:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 11:24:42,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4301994301994302 [2024-05-12 11:24:42,051 INFO L175 Difference]: Start difference. First operand has 266 places, 715 transitions, 13606 flow. Second operand 9 states and 151 transitions. [2024-05-12 11:24:42,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 752 transitions, 15427 flow [2024-05-12 11:24:42,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 752 transitions, 15260 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-05-12 11:24:42,460 INFO L231 Difference]: Finished difference. Result has 269 places, 715 transitions, 13570 flow [2024-05-12 11:24:42,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13439, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13570, PETRI_PLACES=269, PETRI_TRANSITIONS=715} [2024-05-12 11:24:42,461 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-05-12 11:24:42,461 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 715 transitions, 13570 flow [2024-05-12 11:24:42,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:42,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:42,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:42,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 11:24:42,462 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:42,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2096617442, now seen corresponding path program 16 times [2024-05-12 11:24:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240699235] [2024-05-12 11:24:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240699235] [2024-05-12 11:24:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240699235] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:24:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388944606] [2024-05-12 11:24:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:49,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:24:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:24:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:24:49,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:24:49,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 715 transitions, 13570 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:49,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:49,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:24:49,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:51,494 INFO L124 PetriNetUnfolderBase]: 3996/7330 cut-off events. [2024-05-12 11:24:51,494 INFO L125 PetriNetUnfolderBase]: For 142850/142850 co-relation queries the response was YES. [2024-05-12 11:24:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49291 conditions, 7330 events. 3996/7330 cut-off events. For 142850/142850 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 58000 event pairs, 1273 based on Foata normal form. 3/7091 useless extension candidates. Maximal degree in co-relation 49172. Up to 5468 conditions per place. [2024-05-12 11:24:51,592 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 697 selfloop transitions, 87 changer transitions 0/791 dead transitions. [2024-05-12 11:24:51,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 791 transitions, 16033 flow [2024-05-12 11:24:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 11:24:51,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2024-05-12 11:24:51,594 INFO L175 Difference]: Start difference. First operand has 269 places, 715 transitions, 13570 flow. Second operand 9 states and 165 transitions. [2024-05-12 11:24:51,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 791 transitions, 16033 flow [2024-05-12 11:24:52,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 791 transitions, 15691 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 11:24:52,113 INFO L231 Difference]: Finished difference. Result has 269 places, 723 transitions, 13554 flow [2024-05-12 11:24:52,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13228, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13554, PETRI_PLACES=269, PETRI_TRANSITIONS=723} [2024-05-12 11:24:52,114 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-05-12 11:24:52,114 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 723 transitions, 13554 flow [2024-05-12 11:24:52,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:52,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:52,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:52,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 11:24:52,115 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:24:52,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2096610932, now seen corresponding path program 17 times [2024-05-12 11:24:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776005026] [2024-05-12 11:24:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776005026] [2024-05-12 11:24:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776005026] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:24:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976384965] [2024-05-12 11:24:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:24:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:24:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:24:58,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:24:58,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 723 transitions, 13554 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:58,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:58,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:24:58,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:00,044 INFO L124 PetriNetUnfolderBase]: 3851/7116 cut-off events. [2024-05-12 11:25:00,044 INFO L125 PetriNetUnfolderBase]: For 133452/133461 co-relation queries the response was YES. [2024-05-12 11:25:00,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47797 conditions, 7116 events. 3851/7116 cut-off events. For 133452/133461 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 56835 event pairs, 1168 based on Foata normal form. 5/6833 useless extension candidates. Maximal degree in co-relation 47677. Up to 5227 conditions per place. [2024-05-12 11:25:00,266 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 669 selfloop transitions, 89 changer transitions 0/777 dead transitions. [2024-05-12 11:25:00,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 777 transitions, 15515 flow [2024-05-12 11:25:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:25:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:25:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 11:25:00,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2024-05-12 11:25:00,267 INFO L175 Difference]: Start difference. First operand has 269 places, 723 transitions, 13554 flow. Second operand 9 states and 165 transitions. [2024-05-12 11:25:00,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 777 transitions, 15515 flow [2024-05-12 11:25:00,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 777 transitions, 15116 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-05-12 11:25:00,672 INFO L231 Difference]: Finished difference. Result has 270 places, 723 transitions, 13350 flow [2024-05-12 11:25:00,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13155, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13350, PETRI_PLACES=270, PETRI_TRANSITIONS=723} [2024-05-12 11:25:00,673 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 227 predicate places. [2024-05-12 11:25:00,673 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 723 transitions, 13350 flow [2024-05-12 11:25:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:00,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:00,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 11:25:00,674 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:00,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash 874925627, now seen corresponding path program 1 times [2024-05-12 11:25:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278223590] [2024-05-12 11:25:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278223590] [2024-05-12 11:25:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278223590] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:25:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378585657] [2024-05-12 11:25:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:25:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:25:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:25:00,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-05-12 11:25:00,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 723 transitions, 13350 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-05-12 11:25:00,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:00,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-05-12 11:25:00,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:01,591 INFO L124 PetriNetUnfolderBase]: 1076/2139 cut-off events. [2024-05-12 11:25:01,592 INFO L125 PetriNetUnfolderBase]: For 45797/45938 co-relation queries the response was YES. [2024-05-12 11:25:01,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14622 conditions, 2139 events. 1076/2139 cut-off events. For 45797/45938 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 14422 event pairs, 238 based on Foata normal form. 225/2156 useless extension candidates. Maximal degree in co-relation 14501. Up to 777 conditions per place. [2024-05-12 11:25:01,617 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 109 selfloop transitions, 99 changer transitions 0/555 dead transitions. [2024-05-12 11:25:01,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 555 transitions, 10520 flow [2024-05-12 11:25:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:25:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:25:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-05-12 11:25:01,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2024-05-12 11:25:01,619 INFO L175 Difference]: Start difference. First operand has 270 places, 723 transitions, 13350 flow. Second operand 4 states and 105 transitions. [2024-05-12 11:25:01,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 555 transitions, 10520 flow [2024-05-12 11:25:01,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 555 transitions, 9587 flow, removed 18 selfloop flow, removed 25 redundant places. [2024-05-12 11:25:01,785 INFO L231 Difference]: Finished difference. Result has 250 places, 540 transitions, 9497 flow [2024-05-12 11:25:01,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=9073, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9497, PETRI_PLACES=250, PETRI_TRANSITIONS=540} [2024-05-12 11:25:01,786 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-05-12 11:25:01,786 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 540 transitions, 9497 flow [2024-05-12 11:25:01,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-05-12 11:25:01,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:01,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:01,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 11:25:01,787 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:01,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1854733784, now seen corresponding path program 1 times [2024-05-12 11:25:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531349736] [2024-05-12 11:25:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531349736] [2024-05-12 11:25:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531349736] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901784274] [2024-05-12 11:25:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:09,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:09,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:10,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:25:10,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 540 transitions, 9497 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:10,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:10,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:25:10,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:11,639 INFO L124 PetriNetUnfolderBase]: 1497/2701 cut-off events. [2024-05-12 11:25:11,639 INFO L125 PetriNetUnfolderBase]: For 64404/64404 co-relation queries the response was YES. [2024-05-12 11:25:11,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19718 conditions, 2701 events. 1497/2701 cut-off events. For 64404/64404 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 16340 event pairs, 337 based on Foata normal form. 1/2571 useless extension candidates. Maximal degree in co-relation 19606. Up to 2387 conditions per place. [2024-05-12 11:25:11,667 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 502 selfloop transitions, 84 changer transitions 0/594 dead transitions. [2024-05-12 11:25:11,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 594 transitions, 11304 flow [2024-05-12 11:25:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:25:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:25:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-05-12 11:25:11,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40559440559440557 [2024-05-12 11:25:11,669 INFO L175 Difference]: Start difference. First operand has 250 places, 540 transitions, 9497 flow. Second operand 11 states and 174 transitions. [2024-05-12 11:25:11,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 594 transitions, 11304 flow [2024-05-12 11:25:11,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 594 transitions, 11302 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:25:11,902 INFO L231 Difference]: Finished difference. Result has 263 places, 566 transitions, 10219 flow [2024-05-12 11:25:11,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=9495, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10219, PETRI_PLACES=263, PETRI_TRANSITIONS=566} [2024-05-12 11:25:11,904 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-05-12 11:25:11,904 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 566 transitions, 10219 flow [2024-05-12 11:25:11,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:11,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:11,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:11,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 11:25:11,905 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:11,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 918896090, now seen corresponding path program 2 times [2024-05-12 11:25:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:11,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608920718] [2024-05-12 11:25:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608920718] [2024-05-12 11:25:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608920718] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:25:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716486985] [2024-05-12 11:25:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:25:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:25:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:25:21,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:25:21,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 566 transitions, 10219 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:21,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:21,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:25:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:22,707 INFO L124 PetriNetUnfolderBase]: 1527/2752 cut-off events. [2024-05-12 11:25:22,707 INFO L125 PetriNetUnfolderBase]: For 68888/68888 co-relation queries the response was YES. [2024-05-12 11:25:22,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20468 conditions, 2752 events. 1527/2752 cut-off events. For 68888/68888 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 16732 event pairs, 329 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 20350. Up to 2333 conditions per place. [2024-05-12 11:25:22,739 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 507 selfloop transitions, 105 changer transitions 0/620 dead transitions. [2024-05-12 11:25:22,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 620 transitions, 12093 flow [2024-05-12 11:25:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:25:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:25:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-05-12 11:25:22,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4081196581196581 [2024-05-12 11:25:22,749 INFO L175 Difference]: Start difference. First operand has 263 places, 566 transitions, 10219 flow. Second operand 12 states and 191 transitions. [2024-05-12 11:25:22,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 620 transitions, 12093 flow [2024-05-12 11:25:22,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 620 transitions, 11942 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-05-12 11:25:23,005 INFO L231 Difference]: Finished difference. Result has 272 places, 588 transitions, 10684 flow [2024-05-12 11:25:23,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10107, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10684, PETRI_PLACES=272, PETRI_TRANSITIONS=588} [2024-05-12 11:25:23,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 229 predicate places. [2024-05-12 11:25:23,006 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 588 transitions, 10684 flow [2024-05-12 11:25:23,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:23,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:23,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:23,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 11:25:23,007 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:23,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash 369368743, now seen corresponding path program 1 times [2024-05-12 11:25:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570150217] [2024-05-12 11:25:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570150217] [2024-05-12 11:25:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570150217] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767553816] [2024-05-12 11:25:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:31,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:25:31,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 588 transitions, 10684 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:31,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:31,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:25:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:32,968 INFO L124 PetriNetUnfolderBase]: 1554/2796 cut-off events. [2024-05-12 11:25:32,968 INFO L125 PetriNetUnfolderBase]: For 76696/76696 co-relation queries the response was YES. [2024-05-12 11:25:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21213 conditions, 2796 events. 1554/2796 cut-off events. For 76696/76696 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 17045 event pairs, 329 based on Foata normal form. 3/2662 useless extension candidates. Maximal degree in co-relation 21092. Up to 2412 conditions per place. [2024-05-12 11:25:32,999 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 511 selfloop transitions, 116 changer transitions 0/635 dead transitions. [2024-05-12 11:25:32,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 635 transitions, 12452 flow [2024-05-12 11:25:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:25:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:25:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-05-12 11:25:33,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40433925049309666 [2024-05-12 11:25:33,001 INFO L175 Difference]: Start difference. First operand has 272 places, 588 transitions, 10684 flow. Second operand 13 states and 205 transitions. [2024-05-12 11:25:33,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 635 transitions, 12452 flow [2024-05-12 11:25:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 635 transitions, 12258 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-05-12 11:25:33,277 INFO L231 Difference]: Finished difference. Result has 281 places, 600 transitions, 10976 flow [2024-05-12 11:25:33,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10499, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10976, PETRI_PLACES=281, PETRI_TRANSITIONS=600} [2024-05-12 11:25:33,278 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2024-05-12 11:25:33,278 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 600 transitions, 10976 flow [2024-05-12 11:25:33,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:33,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:33,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:33,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 11:25:33,279 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:33,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2137386744, now seen corresponding path program 3 times [2024-05-12 11:25:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:33,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248464225] [2024-05-12 11:25:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248464225] [2024-05-12 11:25:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248464225] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752441929] [2024-05-12 11:25:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:42,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:43,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:25:43,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 600 transitions, 10976 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:43,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:43,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:25:43,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:44,617 INFO L124 PetriNetUnfolderBase]: 1573/2828 cut-off events. [2024-05-12 11:25:44,618 INFO L125 PetriNetUnfolderBase]: For 77864/77864 co-relation queries the response was YES. [2024-05-12 11:25:44,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21858 conditions, 2828 events. 1573/2828 cut-off events. For 77864/77864 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 17249 event pairs, 339 based on Foata normal form. 1/2689 useless extension candidates. Maximal degree in co-relation 21734. Up to 2486 conditions per place. [2024-05-12 11:25:44,646 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 527 selfloop transitions, 105 changer transitions 0/640 dead transitions. [2024-05-12 11:25:44,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 640 transitions, 12573 flow [2024-05-12 11:25:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:25:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:25:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 189 transitions. [2024-05-12 11:25:44,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2024-05-12 11:25:44,647 INFO L175 Difference]: Start difference. First operand has 281 places, 600 transitions, 10976 flow. Second operand 12 states and 189 transitions. [2024-05-12 11:25:44,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 640 transitions, 12573 flow [2024-05-12 11:25:44,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 640 transitions, 12456 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-05-12 11:25:44,928 INFO L231 Difference]: Finished difference. Result has 289 places, 610 transitions, 11230 flow [2024-05-12 11:25:44,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10859, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11230, PETRI_PLACES=289, PETRI_TRANSITIONS=610} [2024-05-12 11:25:44,930 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-05-12 11:25:44,930 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 610 transitions, 11230 flow [2024-05-12 11:25:44,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:44,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:44,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:44,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 11:25:44,930 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:44,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2042914187, now seen corresponding path program 2 times [2024-05-12 11:25:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745864757] [2024-05-12 11:25:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:54,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-05-12 11:25:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745864757] [2024-05-12 11:25:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745864757] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:54,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050400661] [2024-05-12 11:25:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:54,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:25:54,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 610 transitions, 11230 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:54,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:54,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:25:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:56,198 INFO L124 PetriNetUnfolderBase]: 1597/2867 cut-off events. [2024-05-12 11:25:56,199 INFO L125 PetriNetUnfolderBase]: For 83146/83146 co-relation queries the response was YES. [2024-05-12 11:25:56,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22263 conditions, 2867 events. 1597/2867 cut-off events. For 83146/83146 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 17584 event pairs, 342 based on Foata normal form. 3/2727 useless extension candidates. Maximal degree in co-relation 22136. Up to 2528 conditions per place. [2024-05-12 11:25:56,232 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 543 selfloop transitions, 96 changer transitions 0/647 dead transitions. [2024-05-12 11:25:56,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 647 transitions, 12805 flow [2024-05-12 11:25:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:25:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:25:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-05-12 11:25:56,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-05-12 11:25:56,234 INFO L175 Difference]: Start difference. First operand has 289 places, 610 transitions, 11230 flow. Second operand 11 states and 176 transitions. [2024-05-12 11:25:56,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 647 transitions, 12805 flow [2024-05-12 11:25:56,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 647 transitions, 12660 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 11:25:56,589 INFO L231 Difference]: Finished difference. Result has 294 places, 617 transitions, 11377 flow [2024-05-12 11:25:56,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11085, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11377, PETRI_PLACES=294, PETRI_TRANSITIONS=617} [2024-05-12 11:25:56,590 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 251 predicate places. [2024-05-12 11:25:56,590 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 617 transitions, 11377 flow [2024-05-12 11:25:56,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:56,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:56,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:56,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 11:25:56,591 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:25:56,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash -842026690, now seen corresponding path program 4 times [2024-05-12 11:25:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080446909] [2024-05-12 11:25:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:05,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080446909] [2024-05-12 11:26:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080446909] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125665970] [2024-05-12 11:26:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:05,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:05,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:05,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:26:05,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 617 transitions, 11377 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:05,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:05,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:26:05,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:07,128 INFO L124 PetriNetUnfolderBase]: 1603/2864 cut-off events. [2024-05-12 11:26:07,129 INFO L125 PetriNetUnfolderBase]: For 82715/82715 co-relation queries the response was YES. [2024-05-12 11:26:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 2864 events. 1603/2864 cut-off events. For 82715/82715 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 17353 event pairs, 309 based on Foata normal form. 1/2721 useless extension candidates. Maximal degree in co-relation 22309. Up to 2327 conditions per place. [2024-05-12 11:26:07,164 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 382 selfloop transitions, 260 changer transitions 0/650 dead transitions. [2024-05-12 11:26:07,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 650 transitions, 13005 flow [2024-05-12 11:26:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:26:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:26:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-05-12 11:26:07,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4172494172494173 [2024-05-12 11:26:07,166 INFO L175 Difference]: Start difference. First operand has 294 places, 617 transitions, 11377 flow. Second operand 11 states and 179 transitions. [2024-05-12 11:26:07,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 650 transitions, 13005 flow [2024-05-12 11:26:07,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 650 transitions, 12798 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 11:26:07,518 INFO L231 Difference]: Finished difference. Result has 296 places, 619 transitions, 11734 flow [2024-05-12 11:26:07,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11170, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11734, PETRI_PLACES=296, PETRI_TRANSITIONS=619} [2024-05-12 11:26:07,519 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 253 predicate places. [2024-05-12 11:26:07,519 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 619 transitions, 11734 flow [2024-05-12 11:26:07,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:07,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:07,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 11:26:07,520 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:26:07,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2038445537, now seen corresponding path program 3 times [2024-05-12 11:26:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695329288] [2024-05-12 11:26:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695329288] [2024-05-12 11:26:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695329288] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086860232] [2024-05-12 11:26:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:16,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:16,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:26:16,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 619 transitions, 11734 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:16,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:16,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:26:16,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:17,944 INFO L124 PetriNetUnfolderBase]: 1737/3098 cut-off events. [2024-05-12 11:26:17,944 INFO L125 PetriNetUnfolderBase]: For 96583/96583 co-relation queries the response was YES. [2024-05-12 11:26:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24713 conditions, 3098 events. 1737/3098 cut-off events. For 96583/96583 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 19108 event pairs, 242 based on Foata normal form. 3/2934 useless extension candidates. Maximal degree in co-relation 24584. Up to 1955 conditions per place. [2024-05-12 11:26:17,981 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 517 selfloop transitions, 226 changer transitions 0/751 dead transitions. [2024-05-12 11:26:17,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 751 transitions, 15267 flow [2024-05-12 11:26:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:26:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:26:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 11:26:17,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568764568764569 [2024-05-12 11:26:17,982 INFO L175 Difference]: Start difference. First operand has 296 places, 619 transitions, 11734 flow. Second operand 11 states and 196 transitions. [2024-05-12 11:26:17,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 751 transitions, 15267 flow [2024-05-12 11:26:18,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 751 transitions, 14729 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-05-12 11:26:18,363 INFO L231 Difference]: Finished difference. Result has 302 places, 670 transitions, 12831 flow [2024-05-12 11:26:18,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11196, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12831, PETRI_PLACES=302, PETRI_TRANSITIONS=670} [2024-05-12 11:26:18,364 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 259 predicate places. [2024-05-12 11:26:18,364 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 670 transitions, 12831 flow [2024-05-12 11:26:18,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:18,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:18,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:18,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 11:26:18,365 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:26:18,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2071542377, now seen corresponding path program 4 times [2024-05-12 11:26:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944885411] [2024-05-12 11:26:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944885411] [2024-05-12 11:26:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944885411] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204327015] [2024-05-12 11:26:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:27,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:27,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:27,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:26:27,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 670 transitions, 12831 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:27,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:27,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:26:27,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:29,328 INFO L124 PetriNetUnfolderBase]: 1731/3088 cut-off events. [2024-05-12 11:26:29,328 INFO L125 PetriNetUnfolderBase]: For 98473/98473 co-relation queries the response was YES. [2024-05-12 11:26:29,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25736 conditions, 3088 events. 1731/3088 cut-off events. For 98473/98473 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 19007 event pairs, 246 based on Foata normal form. 3/2924 useless extension candidates. Maximal degree in co-relation 25602. Up to 1951 conditions per place. [2024-05-12 11:26:29,365 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 504 selfloop transitions, 236 changer transitions 0/748 dead transitions. [2024-05-12 11:26:29,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 748 transitions, 15457 flow [2024-05-12 11:26:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:26:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:26:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 11:26:29,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44755244755244755 [2024-05-12 11:26:29,367 INFO L175 Difference]: Start difference. First operand has 302 places, 670 transitions, 12831 flow. Second operand 11 states and 192 transitions. [2024-05-12 11:26:29,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 748 transitions, 15457 flow [2024-05-12 11:26:29,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 748 transitions, 15369 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-05-12 11:26:29,794 INFO L231 Difference]: Finished difference. Result has 311 places, 670 transitions, 13222 flow [2024-05-12 11:26:29,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=12743, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13222, PETRI_PLACES=311, PETRI_TRANSITIONS=670} [2024-05-12 11:26:29,795 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2024-05-12 11:26:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 670 transitions, 13222 flow [2024-05-12 11:26:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:29,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:29,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:29,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 11:26:29,796 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:26:29,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1946632260, now seen corresponding path program 5 times [2024-05-12 11:26:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210293974] [2024-05-12 11:26:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210293974] [2024-05-12 11:26:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210293974] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478397965] [2024-05-12 11:26:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:40,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:26:40,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 670 transitions, 13222 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:40,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:40,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:26:40,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:42,012 INFO L124 PetriNetUnfolderBase]: 1756/3131 cut-off events. [2024-05-12 11:26:42,012 INFO L125 PetriNetUnfolderBase]: For 100151/100151 co-relation queries the response was YES. [2024-05-12 11:26:42,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26450 conditions, 3131 events. 1756/3131 cut-off events. For 100151/100151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 19393 event pairs, 312 based on Foata normal form. 1/2960 useless extension candidates. Maximal degree in co-relation 26314. Up to 2788 conditions per place. [2024-05-12 11:26:42,052 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 603 selfloop transitions, 103 changer transitions 0/714 dead transitions. [2024-05-12 11:26:42,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 714 transitions, 15052 flow [2024-05-12 11:26:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:26:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:26:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-05-12 11:26:42,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2024-05-12 11:26:42,054 INFO L175 Difference]: Start difference. First operand has 311 places, 670 transitions, 13222 flow. Second operand 12 states and 188 transitions. [2024-05-12 11:26:42,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 714 transitions, 15052 flow [2024-05-12 11:26:42,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 714 transitions, 14654 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 11:26:42,528 INFO L231 Difference]: Finished difference. Result has 317 places, 689 transitions, 13401 flow [2024-05-12 11:26:42,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=12825, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13401, PETRI_PLACES=317, PETRI_TRANSITIONS=689} [2024-05-12 11:26:42,529 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-05-12 11:26:42,529 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 689 transitions, 13401 flow [2024-05-12 11:26:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:42,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:42,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:42,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 11:26:42,529 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:26:42,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1349762657, now seen corresponding path program 5 times [2024-05-12 11:26:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582472950] [2024-05-12 11:26:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582472950] [2024-05-12 11:26:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582472950] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701391234] [2024-05-12 11:26:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:52,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:53,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:26:53,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 689 transitions, 13401 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:53,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:53,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:26:53,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:54,652 INFO L124 PetriNetUnfolderBase]: 1784/3178 cut-off events. [2024-05-12 11:26:54,653 INFO L125 PetriNetUnfolderBase]: For 105182/105182 co-relation queries the response was YES. [2024-05-12 11:26:54,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26536 conditions, 3178 events. 1784/3178 cut-off events. For 105182/105182 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 19730 event pairs, 319 based on Foata normal form. 3/3005 useless extension candidates. Maximal degree in co-relation 26396. Up to 2834 conditions per place. [2024-05-12 11:26:54,693 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 621 selfloop transitions, 97 changer transitions 0/726 dead transitions. [2024-05-12 11:26:54,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 726 transitions, 15163 flow [2024-05-12 11:26:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:26:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:26:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-05-12 11:26:54,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-05-12 11:26:54,695 INFO L175 Difference]: Start difference. First operand has 317 places, 689 transitions, 13401 flow. Second operand 11 states and 176 transitions. [2024-05-12 11:26:54,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 726 transitions, 15163 flow [2024-05-12 11:26:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 726 transitions, 14979 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:26:55,187 INFO L231 Difference]: Finished difference. Result has 323 places, 699 transitions, 13584 flow [2024-05-12 11:26:55,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13217, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13584, PETRI_PLACES=323, PETRI_TRANSITIONS=699} [2024-05-12 11:26:55,188 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 280 predicate places. [2024-05-12 11:26:55,188 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 699 transitions, 13584 flow [2024-05-12 11:26:55,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:55,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:55,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:55,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 11:26:55,189 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:26:55,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1346222302, now seen corresponding path program 6 times [2024-05-12 11:26:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089106842] [2024-05-12 11:26:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:04,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089106842] [2024-05-12 11:27:04,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089106842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:04,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:04,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:27:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147759450] [2024-05-12 11:27:04,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:04,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:27:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:27:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:27:05,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:27:05,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 699 transitions, 13584 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:05,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:05,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:27:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:06,690 INFO L124 PetriNetUnfolderBase]: 1792/3184 cut-off events. [2024-05-12 11:27:06,691 INFO L125 PetriNetUnfolderBase]: For 104411/104411 co-relation queries the response was YES. [2024-05-12 11:27:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26698 conditions, 3184 events. 1792/3184 cut-off events. For 104411/104411 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 19720 event pairs, 216 based on Foata normal form. 1/3005 useless extension candidates. Maximal degree in co-relation 26558. Up to 2637 conditions per place. [2024-05-12 11:27:06,732 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 476 selfloop transitions, 246 changer transitions 0/730 dead transitions. [2024-05-12 11:27:06,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 730 transitions, 15330 flow [2024-05-12 11:27:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:27:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:27:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 11:27:06,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195804195804196 [2024-05-12 11:27:06,734 INFO L175 Difference]: Start difference. First operand has 323 places, 699 transitions, 13584 flow. Second operand 11 states and 180 transitions. [2024-05-12 11:27:06,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 730 transitions, 15330 flow [2024-05-12 11:27:07,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 730 transitions, 15124 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 11:27:07,228 INFO L231 Difference]: Finished difference. Result has 325 places, 703 transitions, 13937 flow [2024-05-12 11:27:07,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13378, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13937, PETRI_PLACES=325, PETRI_TRANSITIONS=703} [2024-05-12 11:27:07,228 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-05-12 11:27:07,229 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 703 transitions, 13937 flow [2024-05-12 11:27:07,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:07,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:07,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:07,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 11:27:07,229 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:27:07,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1950441695, now seen corresponding path program 6 times [2024-05-12 11:27:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358004970] [2024-05-12 11:27:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358004970] [2024-05-12 11:27:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358004970] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:27:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211007197] [2024-05-12 11:27:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:17,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:27:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:27:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:27:17,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:27:17,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 703 transitions, 13937 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:17,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:17,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:27:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:19,058 INFO L124 PetriNetUnfolderBase]: 1876/3322 cut-off events. [2024-05-12 11:27:19,058 INFO L125 PetriNetUnfolderBase]: For 123565/123565 co-relation queries the response was YES. [2024-05-12 11:27:19,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28307 conditions, 3322 events. 1876/3322 cut-off events. For 123565/123565 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 20729 event pairs, 243 based on Foata normal form. 3/3136 useless extension candidates. Maximal degree in co-relation 28166. Up to 1915 conditions per place. [2024-05-12 11:27:19,100 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 514 selfloop transitions, 288 changer transitions 0/810 dead transitions. [2024-05-12 11:27:19,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 810 transitions, 17229 flow [2024-05-12 11:27:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:27:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:27:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-05-12 11:27:19,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662004662004662 [2024-05-12 11:27:19,101 INFO L175 Difference]: Start difference. First operand has 325 places, 703 transitions, 13937 flow. Second operand 11 states and 200 transitions. [2024-05-12 11:27:19,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 810 transitions, 17229 flow [2024-05-12 11:27:19,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 810 transitions, 16722 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-05-12 11:27:19,625 INFO L231 Difference]: Finished difference. Result has 330 places, 746 transitions, 14917 flow [2024-05-12 11:27:19,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13430, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14917, PETRI_PLACES=330, PETRI_TRANSITIONS=746} [2024-05-12 11:27:19,626 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-05-12 11:27:19,626 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 746 transitions, 14917 flow [2024-05-12 11:27:19,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:19,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:19,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:19,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 11:27:19,627 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:27:19,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1950447275, now seen corresponding path program 7 times [2024-05-12 11:27:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416350662] [2024-05-12 11:27:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416350662] [2024-05-12 11:27:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416350662] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:27:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992415850] [2024-05-12 11:27:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:29,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:27:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:27:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:27:29,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:27:29,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 746 transitions, 14917 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:29,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:29,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:27:29,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:31,523 INFO L124 PetriNetUnfolderBase]: 1870/3314 cut-off events. [2024-05-12 11:27:31,524 INFO L125 PetriNetUnfolderBase]: For 124738/124738 co-relation queries the response was YES. [2024-05-12 11:27:31,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29180 conditions, 3314 events. 1870/3314 cut-off events. For 124738/124738 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 20659 event pairs, 249 based on Foata normal form. 3/3128 useless extension candidates. Maximal degree in co-relation 29035. Up to 1911 conditions per place. [2024-05-12 11:27:31,564 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 500 selfloop transitions, 295 changer transitions 0/803 dead transitions. [2024-05-12 11:27:31,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 803 transitions, 17391 flow [2024-05-12 11:27:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:27:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:27:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 11:27:31,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568764568764569 [2024-05-12 11:27:31,566 INFO L175 Difference]: Start difference. First operand has 330 places, 746 transitions, 14917 flow. Second operand 11 states and 196 transitions. [2024-05-12 11:27:31,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 803 transitions, 17391 flow [2024-05-12 11:27:32,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 803 transitions, 17247 flow, removed 56 selfloop flow, removed 3 redundant places. [2024-05-12 11:27:32,171 INFO L231 Difference]: Finished difference. Result has 338 places, 746 transitions, 15376 flow [2024-05-12 11:27:32,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=14773, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15376, PETRI_PLACES=338, PETRI_TRANSITIONS=746} [2024-05-12 11:27:32,185 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 295 predicate places. [2024-05-12 11:27:32,191 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 746 transitions, 15376 flow [2024-05-12 11:27:32,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:32,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:32,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:32,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 11:27:32,192 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:27:32,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1207187523, now seen corresponding path program 8 times [2024-05-12 11:27:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377053435] [2024-05-12 11:27:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377053435] [2024-05-12 11:27:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377053435] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:27:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920552188] [2024-05-12 11:27:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:27:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:27:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:27:41,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:27:41,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 746 transitions, 15376 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:41,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:41,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:27:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:43,874 INFO L124 PetriNetUnfolderBase]: 1894/3350 cut-off events. [2024-05-12 11:27:43,874 INFO L125 PetriNetUnfolderBase]: For 131066/131066 co-relation queries the response was YES. [2024-05-12 11:27:43,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30072 conditions, 3350 events. 1894/3350 cut-off events. For 131066/131066 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 20858 event pairs, 225 based on Foata normal form. 3/3161 useless extension candidates. Maximal degree in co-relation 29925. Up to 1934 conditions per place. [2024-05-12 11:27:43,916 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 473 selfloop transitions, 311 changer transitions 0/792 dead transitions. [2024-05-12 11:27:43,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 792 transitions, 17684 flow [2024-05-12 11:27:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:27:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:27:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-05-12 11:27:43,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522144522144522 [2024-05-12 11:27:43,917 INFO L175 Difference]: Start difference. First operand has 338 places, 746 transitions, 15376 flow. Second operand 11 states and 194 transitions. [2024-05-12 11:27:43,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 792 transitions, 17684 flow [2024-05-12 11:27:44,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 792 transitions, 17100 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-05-12 11:27:44,582 INFO L231 Difference]: Finished difference. Result has 340 places, 754 transitions, 15582 flow [2024-05-12 11:27:44,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=14808, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15582, PETRI_PLACES=340, PETRI_TRANSITIONS=754} [2024-05-12 11:27:44,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-05-12 11:27:44,583 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 754 transitions, 15582 flow [2024-05-12 11:27:44,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:44,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:44,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:44,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 11:27:44,584 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:27:44,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2090169548, now seen corresponding path program 7 times [2024-05-12 11:27:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585364575] [2024-05-12 11:27:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585364575] [2024-05-12 11:27:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585364575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:27:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400265235] [2024-05-12 11:27:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:54,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:27:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:27:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:27:54,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:27:54,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 754 transitions, 15582 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:54,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:54,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:27:54,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:56,478 INFO L124 PetriNetUnfolderBase]: 1900/3360 cut-off events. [2024-05-12 11:27:56,479 INFO L125 PetriNetUnfolderBase]: For 130390/130390 co-relation queries the response was YES. [2024-05-12 11:27:56,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30234 conditions, 3360 events. 1900/3360 cut-off events. For 130390/130390 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 20956 event pairs, 237 based on Foata normal form. 1/3168 useless extension candidates. Maximal degree in co-relation 30086. Up to 2812 conditions per place. [2024-05-12 11:27:56,519 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 522 selfloop transitions, 248 changer transitions 0/778 dead transitions. [2024-05-12 11:27:56,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 778 transitions, 17336 flow [2024-05-12 11:27:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:27:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:27:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-05-12 11:27:56,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149184149184149 [2024-05-12 11:27:56,520 INFO L175 Difference]: Start difference. First operand has 340 places, 754 transitions, 15582 flow. Second operand 11 states and 178 transitions. [2024-05-12 11:27:56,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 778 transitions, 17336 flow [2024-05-12 11:27:57,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 778 transitions, 16851 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-05-12 11:27:57,214 INFO L231 Difference]: Finished difference. Result has 343 places, 756 transitions, 15645 flow [2024-05-12 11:27:57,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15097, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15645, PETRI_PLACES=343, PETRI_TRANSITIONS=756} [2024-05-12 11:27:57,214 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 300 predicate places. [2024-05-12 11:27:57,214 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 756 transitions, 15645 flow [2024-05-12 11:27:57,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:57,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:57,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 11:27:57,215 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:27:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2090175283, now seen corresponding path program 9 times [2024-05-12 11:27:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467309417] [2024-05-12 11:27:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467309417] [2024-05-12 11:28:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467309417] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:28:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426987641] [2024-05-12 11:28:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:06,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:28:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:28:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:28:07,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:28:07,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 756 transitions, 15645 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:07,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:07,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:28:07,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:09,065 INFO L124 PetriNetUnfolderBase]: 1920/3392 cut-off events. [2024-05-12 11:28:09,065 INFO L125 PetriNetUnfolderBase]: For 137184/137184 co-relation queries the response was YES. [2024-05-12 11:28:09,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30186 conditions, 3392 events. 1920/3392 cut-off events. For 137184/137184 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 21158 event pairs, 221 based on Foata normal form. 3/3200 useless extension candidates. Maximal degree in co-relation 30037. Up to 1961 conditions per place. [2024-05-12 11:28:09,104 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 510 selfloop transitions, 286 changer transitions 0/804 dead transitions. [2024-05-12 11:28:09,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 804 transitions, 17983 flow [2024-05-12 11:28:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:28:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:28:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 11:28:09,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 11:28:09,105 INFO L175 Difference]: Start difference. First operand has 343 places, 756 transitions, 15645 flow. Second operand 11 states and 198 transitions. [2024-05-12 11:28:09,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 804 transitions, 17983 flow [2024-05-12 11:28:09,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 804 transitions, 17551 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-05-12 11:28:09,785 INFO L231 Difference]: Finished difference. Result has 347 places, 761 transitions, 15881 flow [2024-05-12 11:28:09,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15213, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15881, PETRI_PLACES=347, PETRI_TRANSITIONS=761} [2024-05-12 11:28:09,785 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 304 predicate places. [2024-05-12 11:28:09,785 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 761 transitions, 15881 flow [2024-05-12 11:28:09,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:09,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:09,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:28:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 11:28:09,786 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:28:09,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2090169703, now seen corresponding path program 10 times [2024-05-12 11:28:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465806691] [2024-05-12 11:28:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465806691] [2024-05-12 11:28:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465806691] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:28:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604414776] [2024-05-12 11:28:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:19,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:28:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:28:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:28:19,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:28:19,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 761 transitions, 15881 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:19,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:19,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:28:19,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:21,634 INFO L124 PetriNetUnfolderBase]: 1914/3381 cut-off events. [2024-05-12 11:28:21,634 INFO L125 PetriNetUnfolderBase]: For 136346/136346 co-relation queries the response was YES. [2024-05-12 11:28:21,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30340 conditions, 3381 events. 1914/3381 cut-off events. For 136346/136346 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 21106 event pairs, 218 based on Foata normal form. 3/3189 useless extension candidates. Maximal degree in co-relation 30190. Up to 1957 conditions per place. [2024-05-12 11:28:21,674 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 508 selfloop transitions, 288 changer transitions 0/804 dead transitions. [2024-05-12 11:28:21,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 804 transitions, 18025 flow [2024-05-12 11:28:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:28:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:28:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 11:28:21,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568764568764569 [2024-05-12 11:28:21,676 INFO L175 Difference]: Start difference. First operand has 347 places, 761 transitions, 15881 flow. Second operand 11 states and 196 transitions. [2024-05-12 11:28:21,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 804 transitions, 18025 flow [2024-05-12 11:28:22,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 804 transitions, 17218 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-05-12 11:28:22,335 INFO L231 Difference]: Finished difference. Result has 348 places, 761 transitions, 15661 flow [2024-05-12 11:28:22,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15074, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15661, PETRI_PLACES=348, PETRI_TRANSITIONS=761} [2024-05-12 11:28:22,336 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 305 predicate places. [2024-05-12 11:28:22,336 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 761 transitions, 15661 flow [2024-05-12 11:28:22,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:22,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:22,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:28:22,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 11:28:22,337 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:28:22,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 986080180, now seen corresponding path program 8 times [2024-05-12 11:28:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40117244] [2024-05-12 11:28:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40117244] [2024-05-12 11:28:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40117244] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:28:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814096153] [2024-05-12 11:28:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:31,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:28:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:28:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:28:31,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:28:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 761 transitions, 15661 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:31,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:31,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:28:31,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:33,711 INFO L124 PetriNetUnfolderBase]: 1957/3451 cut-off events. [2024-05-12 11:28:33,711 INFO L125 PetriNetUnfolderBase]: For 134713/134713 co-relation queries the response was YES. [2024-05-12 11:28:33,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30831 conditions, 3451 events. 1957/3451 cut-off events. For 134713/134713 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 21614 event pairs, 238 based on Foata normal form. 1/3246 useless extension candidates. Maximal degree in co-relation 30680. Up to 3104 conditions per place. [2024-05-12 11:28:33,836 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 694 selfloop transitions, 112 changer transitions 0/814 dead transitions. [2024-05-12 11:28:33,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 814 transitions, 17956 flow [2024-05-12 11:28:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:28:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:28:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-05-12 11:28:33,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-05-12 11:28:33,838 INFO L175 Difference]: Start difference. First operand has 348 places, 761 transitions, 15661 flow. Second operand 12 states and 190 transitions. [2024-05-12 11:28:33,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 814 transitions, 17956 flow [2024-05-12 11:28:34,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 814 transitions, 17365 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-05-12 11:28:34,438 INFO L231 Difference]: Finished difference. Result has 352 places, 790 transitions, 15819 flow [2024-05-12 11:28:34,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15070, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15819, PETRI_PLACES=352, PETRI_TRANSITIONS=790} [2024-05-12 11:28:34,439 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 309 predicate places. [2024-05-12 11:28:34,439 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 790 transitions, 15819 flow [2024-05-12 11:28:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:34,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:34,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:28:34,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 11:28:34,440 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:28:34,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 986170545, now seen corresponding path program 11 times [2024-05-12 11:28:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891505471] [2024-05-12 11:28:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891505471] [2024-05-12 11:28:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891505471] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:43,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:28:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348573955] [2024-05-12 11:28:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:43,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:28:43,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:28:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:28:43,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:28:43,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 790 transitions, 15819 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:43,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:43,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:28:43,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:45,677 INFO L124 PetriNetUnfolderBase]: 1989/3505 cut-off events. [2024-05-12 11:28:45,677 INFO L125 PetriNetUnfolderBase]: For 138700/138700 co-relation queries the response was YES. [2024-05-12 11:28:45,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30858 conditions, 3505 events. 1989/3505 cut-off events. For 138700/138700 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 22021 event pairs, 228 based on Foata normal form. 3/3297 useless extension candidates. Maximal degree in co-relation 30704. Up to 3159 conditions per place. [2024-05-12 11:28:45,722 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 723 selfloop transitions, 97 changer transitions 0/828 dead transitions. [2024-05-12 11:28:45,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 828 transitions, 17841 flow [2024-05-12 11:28:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:28:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:28:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-05-12 11:28:45,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-05-12 11:28:45,723 INFO L175 Difference]: Start difference. First operand has 352 places, 790 transitions, 15819 flow. Second operand 11 states and 176 transitions. [2024-05-12 11:28:45,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 828 transitions, 17841 flow [2024-05-12 11:28:46,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 828 transitions, 17563 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-05-12 11:28:46,440 INFO L231 Difference]: Finished difference. Result has 358 places, 803 transitions, 15993 flow [2024-05-12 11:28:46,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15541, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15993, PETRI_PLACES=358, PETRI_TRANSITIONS=803} [2024-05-12 11:28:46,444 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 315 predicate places. [2024-05-12 11:28:46,444 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 803 transitions, 15993 flow [2024-05-12 11:28:46,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:46,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:46,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:28:46,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 11:28:46,445 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:28:46,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 986170390, now seen corresponding path program 9 times [2024-05-12 11:28:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445096733] [2024-05-12 11:28:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445096733] [2024-05-12 11:28:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445096733] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:28:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538982229] [2024-05-12 11:28:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:28:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:28:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:28:56,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:28:56,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 803 transitions, 15993 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:56,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:56,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:28:56,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:57,900 INFO L124 PetriNetUnfolderBase]: 1987/3502 cut-off events. [2024-05-12 11:28:57,901 INFO L125 PetriNetUnfolderBase]: For 134071/134071 co-relation queries the response was YES. [2024-05-12 11:28:57,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30862 conditions, 3502 events. 1987/3502 cut-off events. For 134071/134071 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 22022 event pairs, 228 based on Foata normal form. 1/3292 useless extension candidates. Maximal degree in co-relation 30708. Up to 3174 conditions per place. [2024-05-12 11:28:57,947 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 720 selfloop transitions, 94 changer transitions 0/822 dead transitions. [2024-05-12 11:28:57,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 822 transitions, 17718 flow [2024-05-12 11:28:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:28:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:28:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-05-12 11:28:57,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40559440559440557 [2024-05-12 11:28:57,949 INFO L175 Difference]: Start difference. First operand has 358 places, 803 transitions, 15993 flow. Second operand 11 states and 174 transitions. [2024-05-12 11:28:57,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 822 transitions, 17718 flow [2024-05-12 11:28:58,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 822 transitions, 17444 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-05-12 11:28:58,689 INFO L231 Difference]: Finished difference. Result has 362 places, 803 transitions, 15925 flow [2024-05-12 11:28:58,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15719, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15925, PETRI_PLACES=362, PETRI_TRANSITIONS=803} [2024-05-12 11:28:58,690 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 319 predicate places. [2024-05-12 11:28:58,690 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 803 transitions, 15925 flow [2024-05-12 11:28:58,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:58,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:58,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:28:58,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 11:28:58,691 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:28:58,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 989889615, now seen corresponding path program 12 times [2024-05-12 11:28:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290371820] [2024-05-12 11:28:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:29:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:08,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290371820] [2024-05-12 11:29:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290371820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:08,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:29:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777554434] [2024-05-12 11:29:08,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:08,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:29:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:29:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:29:09,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:29:09,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 803 transitions, 15925 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:09,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:09,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:29:09,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:11,064 INFO L124 PetriNetUnfolderBase]: 2091/3684 cut-off events. [2024-05-12 11:29:11,065 INFO L125 PetriNetUnfolderBase]: For 158518/158518 co-relation queries the response was YES. [2024-05-12 11:29:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32338 conditions, 3684 events. 2091/3684 cut-off events. For 158518/158518 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 23424 event pairs, 319 based on Foata normal form. 3/3462 useless extension candidates. Maximal degree in co-relation 32184. Up to 1894 conditions per place. [2024-05-12 11:29:11,116 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 512 selfloop transitions, 385 changer transitions 0/905 dead transitions. [2024-05-12 11:29:11,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 905 transitions, 19354 flow [2024-05-12 11:29:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:29:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:29:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 11:29:11,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2024-05-12 11:29:11,118 INFO L175 Difference]: Start difference. First operand has 362 places, 803 transitions, 15925 flow. Second operand 11 states and 202 transitions. [2024-05-12 11:29:11,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 905 transitions, 19354 flow [2024-05-12 11:29:11,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 905 transitions, 19155 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-05-12 11:29:11,952 INFO L231 Difference]: Finished difference. Result has 364 places, 854 transitions, 17364 flow [2024-05-12 11:29:11,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15726, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17364, PETRI_PLACES=364, PETRI_TRANSITIONS=854} [2024-05-12 11:29:11,953 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 321 predicate places. [2024-05-12 11:29:11,953 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 854 transitions, 17364 flow [2024-05-12 11:29:11,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:11,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:11,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:29:11,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 11:29:11,954 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:29:11,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash 989889460, now seen corresponding path program 10 times [2024-05-12 11:29:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956797092] [2024-05-12 11:29:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:29:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956797092] [2024-05-12 11:29:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956797092] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:21,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:29:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221713871] [2024-05-12 11:29:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:29:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:29:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:29:21,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:29:21,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 854 transitions, 17364 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:21,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:21,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:29:21,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:24,051 INFO L124 PetriNetUnfolderBase]: 2101/3695 cut-off events. [2024-05-12 11:29:24,051 INFO L125 PetriNetUnfolderBase]: For 162526/162526 co-relation queries the response was YES. [2024-05-12 11:29:24,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33678 conditions, 3695 events. 2101/3695 cut-off events. For 162526/162526 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 23483 event pairs, 268 based on Foata normal form. 1/3468 useless extension candidates. Maximal degree in co-relation 33521. Up to 3134 conditions per place. [2024-05-12 11:29:24,095 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 630 selfloop transitions, 242 changer transitions 0/880 dead transitions. [2024-05-12 11:29:24,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 880 transitions, 19341 flow [2024-05-12 11:29:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:29:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:29:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 11:29:24,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195804195804196 [2024-05-12 11:29:24,096 INFO L175 Difference]: Start difference. First operand has 364 places, 854 transitions, 17364 flow. Second operand 11 states and 180 transitions. [2024-05-12 11:29:24,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 880 transitions, 19341 flow [2024-05-12 11:29:24,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 880 transitions, 19239 flow, removed 47 selfloop flow, removed 2 redundant places. [2024-05-12 11:29:24,873 INFO L231 Difference]: Finished difference. Result has 373 places, 860 transitions, 17847 flow [2024-05-12 11:29:24,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=17262, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17847, PETRI_PLACES=373, PETRI_TRANSITIONS=860} [2024-05-12 11:29:24,874 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 330 predicate places. [2024-05-12 11:29:24,874 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 860 transitions, 17847 flow [2024-05-12 11:29:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:24,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:24,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:29:24,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 11:29:24,874 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:29:24,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 989895195, now seen corresponding path program 13 times [2024-05-12 11:29:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605908589] [2024-05-12 11:29:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:29:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605908589] [2024-05-12 11:29:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605908589] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:35,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:29:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114364466] [2024-05-12 11:29:35,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:35,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:29:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:29:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:29:35,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:29:35,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 860 transitions, 17847 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:35,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:35,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:29:35,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:37,852 INFO L124 PetriNetUnfolderBase]: 2095/3690 cut-off events. [2024-05-12 11:29:37,853 INFO L125 PetriNetUnfolderBase]: For 164015/164015 co-relation queries the response was YES. [2024-05-12 11:29:37,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33698 conditions, 3690 events. 2095/3690 cut-off events. For 164015/164015 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 23459 event pairs, 318 based on Foata normal form. 3/3465 useless extension candidates. Maximal degree in co-relation 33539. Up to 1905 conditions per place. [2024-05-12 11:29:37,901 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 507 selfloop transitions, 391 changer transitions 0/906 dead transitions. [2024-05-12 11:29:37,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 906 transitions, 20395 flow [2024-05-12 11:29:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:29:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:29:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 11:29:37,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-05-12 11:29:37,902 INFO L175 Difference]: Start difference. First operand has 373 places, 860 transitions, 17847 flow. Second operand 11 states and 198 transitions. [2024-05-12 11:29:37,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 906 transitions, 20395 flow [2024-05-12 11:29:38,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 906 transitions, 19862 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-05-12 11:29:38,766 INFO L231 Difference]: Finished difference. Result has 375 places, 860 transitions, 18115 flow [2024-05-12 11:29:38,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=17314, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=391, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18115, PETRI_PLACES=375, PETRI_TRANSITIONS=860} [2024-05-12 11:29:38,767 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 332 predicate places. [2024-05-12 11:29:38,767 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 860 transitions, 18115 flow [2024-05-12 11:29:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:38,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:38,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:29:38,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 11:29:38,768 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:29:38,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1963632619, now seen corresponding path program 14 times [2024-05-12 11:29:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763228556] [2024-05-12 11:29:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:29:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763228556] [2024-05-12 11:29:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763228556] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:29:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729809427] [2024-05-12 11:29:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:49,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:29:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:29:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:29:49,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:29:49,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 860 transitions, 18115 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:49,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:49,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:29:49,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:51,848 INFO L124 PetriNetUnfolderBase]: 2149/3779 cut-off events. [2024-05-12 11:29:51,848 INFO L125 PetriNetUnfolderBase]: For 180766/180766 co-relation queries the response was YES. [2024-05-12 11:29:51,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35236 conditions, 3779 events. 2149/3779 cut-off events. For 180766/180766 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 24121 event pairs, 336 based on Foata normal form. 3/3548 useless extension candidates. Maximal degree in co-relation 35076. Up to 1955 conditions per place. [2024-05-12 11:29:51,903 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 531 selfloop transitions, 391 changer transitions 0/930 dead transitions. [2024-05-12 11:29:51,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 930 transitions, 21309 flow [2024-05-12 11:29:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:29:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:29:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-05-12 11:29:51,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46386946386946387 [2024-05-12 11:29:51,904 INFO L175 Difference]: Start difference. First operand has 375 places, 860 transitions, 18115 flow. Second operand 11 states and 199 transitions. [2024-05-12 11:29:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 930 transitions, 21309 flow [2024-05-12 11:29:52,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 930 transitions, 20719 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 11:29:52,813 INFO L231 Difference]: Finished difference. Result has 379 places, 876 transitions, 18650 flow [2024-05-12 11:29:52,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=17541, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18650, PETRI_PLACES=379, PETRI_TRANSITIONS=876} [2024-05-12 11:29:52,814 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 336 predicate places. [2024-05-12 11:29:52,814 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 876 transitions, 18650 flow [2024-05-12 11:29:52,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:52,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:52,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:29:52,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 11:29:52,815 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:29:52,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1133779990, now seen corresponding path program 11 times [2024-05-12 11:29:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761601557] [2024-05-12 11:29:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:02,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761601557] [2024-05-12 11:30:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761601557] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:02,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:30:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721600284] [2024-05-12 11:30:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:02,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:30:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:30:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:30:02,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:30:02,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 876 transitions, 18650 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:02,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:02,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:30:02,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:04,707 INFO L124 PetriNetUnfolderBase]: 2157/3787 cut-off events. [2024-05-12 11:30:04,708 INFO L125 PetriNetUnfolderBase]: For 181637/181637 co-relation queries the response was YES. [2024-05-12 11:30:04,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35489 conditions, 3787 events. 2157/3787 cut-off events. For 181637/181637 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 24176 event pairs, 267 based on Foata normal form. 1/3552 useless extension candidates. Maximal degree in co-relation 35328. Up to 3224 conditions per place. [2024-05-12 11:30:04,762 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 660 selfloop transitions, 234 changer transitions 0/902 dead transitions. [2024-05-12 11:30:04,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 902 transitions, 20731 flow [2024-05-12 11:30:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:30:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:30:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 11:30:04,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195804195804196 [2024-05-12 11:30:04,764 INFO L175 Difference]: Start difference. First operand has 379 places, 876 transitions, 18650 flow. Second operand 11 states and 180 transitions. [2024-05-12 11:30:04,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 902 transitions, 20731 flow [2024-05-12 11:30:05,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 902 transitions, 20070 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 11:30:05,824 INFO L231 Difference]: Finished difference. Result has 383 places, 880 transitions, 18536 flow [2024-05-12 11:30:05,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=17989, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18536, PETRI_PLACES=383, PETRI_TRANSITIONS=880} [2024-05-12 11:30:05,825 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 340 predicate places. [2024-05-12 11:30:05,825 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 880 transitions, 18536 flow [2024-05-12 11:30:05,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:05,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:05,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:30:05,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 11:30:05,826 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:30:05,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1133780145, now seen corresponding path program 15 times [2024-05-12 11:30:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881147201] [2024-05-12 11:30:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881147201] [2024-05-12 11:30:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881147201] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:30:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359190324] [2024-05-12 11:30:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:15,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:30:15,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:30:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:30:16,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:30:16,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 880 transitions, 18536 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:16,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:16,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:30:16,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:18,412 INFO L124 PetriNetUnfolderBase]: 2181/3831 cut-off events. [2024-05-12 11:30:18,413 INFO L125 PetriNetUnfolderBase]: For 188575/188575 co-relation queries the response was YES. [2024-05-12 11:30:18,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35297 conditions, 3831 events. 2181/3831 cut-off events. For 188575/188575 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 24533 event pairs, 334 based on Foata normal form. 3/3595 useless extension candidates. Maximal degree in co-relation 35135. Up to 1990 conditions per place. [2024-05-12 11:30:18,458 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 554 selfloop transitions, 388 changer transitions 0/950 dead transitions. [2024-05-12 11:30:18,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 950 transitions, 21758 flow [2024-05-12 11:30:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:30:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:30:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 11:30:18,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2024-05-12 11:30:18,459 INFO L175 Difference]: Start difference. First operand has 383 places, 880 transitions, 18536 flow. Second operand 11 states and 202 transitions. [2024-05-12 11:30:18,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 950 transitions, 21758 flow [2024-05-12 11:30:19,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 950 transitions, 21263 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-05-12 11:30:19,311 INFO L231 Difference]: Finished difference. Result has 385 places, 888 transitions, 18987 flow [2024-05-12 11:30:19,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=18041, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=380, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18987, PETRI_PLACES=385, PETRI_TRANSITIONS=888} [2024-05-12 11:30:19,312 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 342 predicate places. [2024-05-12 11:30:19,312 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 888 transitions, 18987 flow [2024-05-12 11:30:19,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:19,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:19,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:30:19,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 11:30:19,313 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:30:19,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1133785725, now seen corresponding path program 16 times [2024-05-12 11:30:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276994042] [2024-05-12 11:30:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276994042] [2024-05-12 11:30:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276994042] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:30:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726194811] [2024-05-12 11:30:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:30:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:30:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:30:29,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:30:29,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 888 transitions, 18987 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:29,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:29,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:30:29,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:31,770 INFO L124 PetriNetUnfolderBase]: 2175/3822 cut-off events. [2024-05-12 11:30:31,770 INFO L125 PetriNetUnfolderBase]: For 187353/187353 co-relation queries the response was YES. [2024-05-12 11:30:31,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35645 conditions, 3822 events. 2175/3822 cut-off events. For 187353/187353 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 24478 event pairs, 326 based on Foata normal form. 3/3586 useless extension candidates. Maximal degree in co-relation 35482. Up to 1986 conditions per place. [2024-05-12 11:30:31,819 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 562 selfloop transitions, 383 changer transitions 0/953 dead transitions. [2024-05-12 11:30:31,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 953 transitions, 22001 flow [2024-05-12 11:30:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:30:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:30:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 11:30:31,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2024-05-12 11:30:31,821 INFO L175 Difference]: Start difference. First operand has 385 places, 888 transitions, 18987 flow. Second operand 11 states and 202 transitions. [2024-05-12 11:30:31,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 953 transitions, 22001 flow [2024-05-12 11:30:32,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 953 transitions, 21225 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-05-12 11:30:32,703 INFO L231 Difference]: Finished difference. Result has 389 places, 888 transitions, 18996 flow [2024-05-12 11:30:32,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=18211, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18996, PETRI_PLACES=389, PETRI_TRANSITIONS=888} [2024-05-12 11:30:32,704 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 346 predicate places. [2024-05-12 11:30:32,704 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 888 transitions, 18996 flow [2024-05-12 11:30:32,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:32,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:32,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:30:32,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 11:30:32,705 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:30:32,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1375659754, now seen corresponding path program 1 times [2024-05-12 11:30:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:32,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078660477] [2024-05-12 11:30:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078660477] [2024-05-12 11:30:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078660477] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:30:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116216238] [2024-05-12 11:30:42,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:42,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:30:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:30:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:30:42,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-05-12 11:30:42,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 888 transitions, 18996 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:42,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:42,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-05-12 11:30:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:44,583 INFO L124 PetriNetUnfolderBase]: 2084/3731 cut-off events. [2024-05-12 11:30:44,583 INFO L125 PetriNetUnfolderBase]: For 191567/191633 co-relation queries the response was YES. [2024-05-12 11:30:44,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34748 conditions, 3731 events. 2084/3731 cut-off events. For 191567/191633 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 24478 event pairs, 359 based on Foata normal form. 5/3455 useless extension candidates. Maximal degree in co-relation 34584. Up to 3204 conditions per place. [2024-05-12 11:30:44,634 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 778 selfloop transitions, 58 changer transitions 0/922 dead transitions. [2024-05-12 11:30:44,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 922 transitions, 20964 flow [2024-05-12 11:30:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:30:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:30:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 11:30:44,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-05-12 11:30:44,636 INFO L175 Difference]: Start difference. First operand has 389 places, 888 transitions, 18996 flow. Second operand 10 states and 175 transitions. [2024-05-12 11:30:44,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 922 transitions, 20964 flow [2024-05-12 11:30:45,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 922 transitions, 20062 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 11:30:45,526 INFO L231 Difference]: Finished difference. Result has 390 places, 897 transitions, 18370 flow [2024-05-12 11:30:45,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=18094, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18370, PETRI_PLACES=390, PETRI_TRANSITIONS=897} [2024-05-12 11:30:45,527 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 347 predicate places. [2024-05-12 11:30:45,527 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 897 transitions, 18370 flow [2024-05-12 11:30:45,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:45,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:45,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:30:45,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 11:30:45,528 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:30:45,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2101610627, now seen corresponding path program 17 times [2024-05-12 11:30:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821934944] [2024-05-12 11:30:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821934944] [2024-05-12 11:30:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821934944] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:30:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948780955] [2024-05-12 11:30:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:30:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:30:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:30:56,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-05-12 11:30:56,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 897 transitions, 18370 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:30:56,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:56,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-05-12 11:30:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:58,402 INFO L124 PetriNetUnfolderBase]: 2229/3923 cut-off events. [2024-05-12 11:30:58,402 INFO L125 PetriNetUnfolderBase]: For 188995/188995 co-relation queries the response was YES. [2024-05-12 11:30:58,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35688 conditions, 3923 events. 2229/3923 cut-off events. For 188995/188995 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 25286 event pairs, 258 based on Foata normal form. 3/3680 useless extension candidates. Maximal degree in co-relation 35521. Up to 2060 conditions per place. [2024-05-12 11:30:58,456 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 486 selfloop transitions, 459 changer transitions 0/953 dead transitions. [2024-05-12 11:30:58,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 953 transitions, 21258 flow [2024-05-12 11:30:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:30:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:30:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 11:30:58,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-05-12 11:30:58,457 INFO L175 Difference]: Start difference. First operand has 390 places, 897 transitions, 18370 flow. Second operand 11 states and 195 transitions. [2024-05-12 11:30:58,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 953 transitions, 21258 flow Killed by 15