./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix016_power.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix016_power.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:10:47,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:10:47,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:10:47,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:10:47,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:10:47,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:10:47,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:10:47,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:10:47,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:10:47,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:10:47,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:10:47,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:10:47,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:10:47,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:10:47,096 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:10:47,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:10:47,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:10:47,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:10:47,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:10:47,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:10:47,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:10:47,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:10:47,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:10:47,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:10:47,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:10:47,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:10:47,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:10:47,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:10:47,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:10:47,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:10:47,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:10:47,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:10:47,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:10:47,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:10:47,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:10:47,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:10:47,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:10:47,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:10:47,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:10:47,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:10:47,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:10:47,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:10:47,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:10:47,106 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:10:47,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:10:47,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:10:47,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:10:47,399 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:10:47,400 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:10:47,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix016_power.opt_rmo.opt.yml/witness.yml [2024-06-27 22:10:47,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:10:47,479 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:10:47,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2024-06-27 22:10:48,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:10:48,774 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:10:48,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2024-06-27 22:10:48,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ce23a20/30867f8dd66b4c5ea535093e33a830ad/FLAGa9defac7a [2024-06-27 22:10:48,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ce23a20/30867f8dd66b4c5ea535093e33a830ad [2024-06-27 22:10:48,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:10:48,806 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:10:48,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:10:48,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:10:48,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:10:48,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:10:47" (1/2) ... [2024-06-27 22:10:48,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b610780 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:10:48, skipping insertion in model container [2024-06-27 22:10:48,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:10:47" (1/2) ... [2024-06-27 22:10:48,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51b4ca06 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:10:48, skipping insertion in model container [2024-06-27 22:10:48,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:10:48" (2/2) ... [2024-06-27 22:10:48,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b610780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:48, skipping insertion in model container [2024-06-27 22:10:48,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:10:48" (2/2) ... [2024-06-27 22:10:48,817 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:10:48,843 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:10:48,844 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:10:48,844 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:10:48,845 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:10:48,845 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:10:48,845 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-27 22:10:48,887 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:10:49,077 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] [2024-06-27 22:10:49,218 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:10:49,230 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:10:49,260 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:10:49,362 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:10:49,393 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:10:49,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49 WrapperNode [2024-06-27 22:10:49,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:10:49,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:10:49,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:10:49,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:10:49,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,449 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2024-06-27 22:10:49,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:10:49,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:10:49,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:10:49,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:10:49,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:10:49,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:10:49,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:10:49,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:10:49,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:10:49,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (1/1) ... [2024-06-27 22:10:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:10:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:10:49,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:10:49,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:10:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:10:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:10:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:10:49,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:10:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:10:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:10:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:10:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:10:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:10:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:10:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:10:49,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:10:49,586 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:10:49,684 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:10:49,686 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:10:50,111 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:10:50,112 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:10:50,252 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:10:50,253 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:10:50,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:10:50 BoogieIcfgContainer [2024-06-27 22:10:50,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:10:50,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:10:50,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:10:50,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:10:50,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:10:47" (1/4) ... [2024-06-27 22:10:50,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e056507 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:10:50, skipping insertion in model container [2024-06-27 22:10:50,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:10:48" (2/4) ... [2024-06-27 22:10:50,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e056507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:10:50, skipping insertion in model container [2024-06-27 22:10:50,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:10:49" (3/4) ... [2024-06-27 22:10:50,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e056507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:10:50, skipping insertion in model container [2024-06-27 22:10:50,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:10:50" (4/4) ... [2024-06-27 22:10:50,264 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2024-06-27 22:10:50,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:10:50,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:10:50,279 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:10:50,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:10:50,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:10:50,414 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:10:50,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:10:50,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:10:50,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:10:50,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:10:50,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:10:50,442 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;@6f112034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:10:50,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:10:50,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:10:50,446 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:10:50,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:10:50,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:50,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:10:50,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:50,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash 348228607, now seen corresponding path program 1 times [2024-06-27 22:10:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777022025] [2024-06-27 22:10:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777022025] [2024-06-27 22:10:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777022025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:10:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621687474] [2024-06-27 22:10:51,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:51,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:10:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:10:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:10:51,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:10:51,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:51,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:51,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:10:51,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:52,284 INFO L124 PetriNetUnfolderBase]: 2584/4413 cut-off events. [2024-06-27 22:10:52,285 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-27 22:10:52,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8249 conditions, 4413 events. 2584/4413 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 28902 event pairs, 2088 based on Foata normal form. 120/4096 useless extension candidates. Maximal degree in co-relation 8237. Up to 3749 conditions per place. [2024-06-27 22:10:52,308 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 39 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-06-27 22:10:52,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 215 flow [2024-06-27 22:10:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:10:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:10:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-06-27 22:10:52,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7092198581560284 [2024-06-27 22:10:52,319 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 100 transitions. [2024-06-27 22:10:52,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 215 flow [2024-06-27 22:10:52,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:10:52,323 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 124 flow [2024-06-27 22:10:52,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-27 22:10:52,327 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-06-27 22:10:52,327 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 124 flow [2024-06-27 22:10:52,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:52,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:52,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:10:52,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:52,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -359107726, now seen corresponding path program 1 times [2024-06-27 22:10:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830862904] [2024-06-27 22:10:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830862904] [2024-06-27 22:10:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830862904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:10:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037333021] [2024-06-27 22:10:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:52,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:10:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:10:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:10:53,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:10:53,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:53,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:53,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:10:53,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:53,555 INFO L124 PetriNetUnfolderBase]: 3073/4651 cut-off events. [2024-06-27 22:10:53,555 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2024-06-27 22:10:53,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10296 conditions, 4651 events. 3073/4651 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 26966 event pairs, 1517 based on Foata normal form. 3/4442 useless extension candidates. Maximal degree in co-relation 10284. Up to 4411 conditions per place. [2024-06-27 22:10:53,579 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2024-06-27 22:10:53,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 302 flow [2024-06-27 22:10:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:10:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:10:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 22:10:53,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2024-06-27 22:10:53,584 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 124 flow. Second operand 4 states and 126 transitions. [2024-06-27 22:10:53,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 302 flow [2024-06-27 22:10:53,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:10:53,587 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 162 flow [2024-06-27 22:10:53,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-27 22:10:53,588 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-06-27 22:10:53,588 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 162 flow [2024-06-27 22:10:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:53,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:53,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:53,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:10:53,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:53,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1752562936, now seen corresponding path program 1 times [2024-06-27 22:10:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762912857] [2024-06-27 22:10:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762912857] [2024-06-27 22:10:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762912857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:55,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:10:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119780214] [2024-06-27 22:10:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:10:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:10:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:10:55,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:10:55,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:55,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:55,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:10:55,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:55,693 INFO L124 PetriNetUnfolderBase]: 3039/4599 cut-off events. [2024-06-27 22:10:55,693 INFO L125 PetriNetUnfolderBase]: For 1771/1771 co-relation queries the response was YES. [2024-06-27 22:10:55,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11255 conditions, 4599 events. 3039/4599 cut-off events. For 1771/1771 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 26673 event pairs, 1202 based on Foata normal form. 3/4401 useless extension candidates. Maximal degree in co-relation 11241. Up to 4340 conditions per place. [2024-06-27 22:10:55,719 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 62 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2024-06-27 22:10:55,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 398 flow [2024-06-27 22:10:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:10:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:10:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-06-27 22:10:55,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6638297872340425 [2024-06-27 22:10:55,721 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 162 flow. Second operand 5 states and 156 transitions. [2024-06-27 22:10:55,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 398 flow [2024-06-27 22:10:55,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 384 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:10:55,724 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 200 flow [2024-06-27 22:10:55,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-27 22:10:55,725 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-06-27 22:10:55,725 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 200 flow [2024-06-27 22:10:55,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:55,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:55,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:55,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:10:55,726 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:55,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1129550261, now seen corresponding path program 1 times [2024-06-27 22:10:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841939772] [2024-06-27 22:10:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841939772] [2024-06-27 22:10:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841939772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:10:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517449999] [2024-06-27 22:10:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:57,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:10:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:10:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:10:57,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:10:57,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:57,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:57,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:10:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:57,940 INFO L124 PetriNetUnfolderBase]: 2985/4968 cut-off events. [2024-06-27 22:10:57,940 INFO L125 PetriNetUnfolderBase]: For 3541/3541 co-relation queries the response was YES. [2024-06-27 22:10:57,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12450 conditions, 4968 events. 2985/4968 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 31809 event pairs, 1480 based on Foata normal form. 6/4624 useless extension candidates. Maximal degree in co-relation 12435. Up to 4212 conditions per place. [2024-06-27 22:10:57,968 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 70 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2024-06-27 22:10:57,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 470 flow [2024-06-27 22:10:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:10:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:10:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-06-27 22:10:57,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6453900709219859 [2024-06-27 22:10:57,971 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 200 flow. Second operand 6 states and 182 transitions. [2024-06-27 22:10:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 470 flow [2024-06-27 22:10:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 446 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:10:57,976 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 221 flow [2024-06-27 22:10:57,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-06-27 22:10:57,977 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-06-27 22:10:57,977 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 221 flow [2024-06-27 22:10:57,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:57,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:57,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:57,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:10:57,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:57,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1222137708, now seen corresponding path program 1 times [2024-06-27 22:10:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262263513] [2024-06-27 22:10:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262263513] [2024-06-27 22:10:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262263513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:10:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51602705] [2024-06-27 22:10:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:58,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:10:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:10:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:10:58,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:10:58,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:58,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:58,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:10:58,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:59,623 INFO L124 PetriNetUnfolderBase]: 3410/5633 cut-off events. [2024-06-27 22:10:59,624 INFO L125 PetriNetUnfolderBase]: For 6270/6270 co-relation queries the response was YES. [2024-06-27 22:10:59,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14845 conditions, 5633 events. 3410/5633 cut-off events. For 6270/6270 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 36612 event pairs, 2183 based on Foata normal form. 2/5243 useless extension candidates. Maximal degree in co-relation 14828. Up to 4891 conditions per place. [2024-06-27 22:10:59,650 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 54 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-06-27 22:10:59,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 437 flow [2024-06-27 22:10:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:10:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:10:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 22:10:59,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:10:59,653 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 221 flow. Second operand 6 states and 141 transitions. [2024-06-27 22:10:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 437 flow [2024-06-27 22:10:59,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 396 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:59,660 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 287 flow [2024-06-27 22:10:59,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-06-27 22:10:59,663 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-06-27 22:10:59,663 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 287 flow [2024-06-27 22:10:59,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:59,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:59,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:10:59,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:10:59,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 977550425, now seen corresponding path program 1 times [2024-06-27 22:10:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632158692] [2024-06-27 22:10:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632158692] [2024-06-27 22:11:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632158692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:00,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:00,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:11:00,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659634382] [2024-06-27 22:11:00,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:11:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:11:00,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:11:00,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:00,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:00,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:00,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:00,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:01,368 INFO L124 PetriNetUnfolderBase]: 3484/5764 cut-off events. [2024-06-27 22:11:01,369 INFO L125 PetriNetUnfolderBase]: For 7981/7981 co-relation queries the response was YES. [2024-06-27 22:11:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16152 conditions, 5764 events. 3484/5764 cut-off events. For 7981/7981 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 36815 event pairs, 1700 based on Foata normal form. 4/5391 useless extension candidates. Maximal degree in co-relation 16131. Up to 4922 conditions per place. [2024-06-27 22:11:01,395 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 74 selfloop transitions, 27 changer transitions 0/112 dead transitions. [2024-06-27 22:11:01,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 657 flow [2024-06-27 22:11:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 22:11:01,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501519756838906 [2024-06-27 22:11:01,396 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 287 flow. Second operand 7 states and 181 transitions. [2024-06-27 22:11:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 657 flow [2024-06-27 22:11:01,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 645 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:11:01,405 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 465 flow [2024-06-27 22:11:01,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2024-06-27 22:11:01,407 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 22:11:01,407 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 465 flow [2024-06-27 22:11:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:01,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:01,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:01,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:11:01,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:01,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 840050873, now seen corresponding path program 2 times [2024-06-27 22:11:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815673013] [2024-06-27 22:11:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815673013] [2024-06-27 22:11:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815673013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:02,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:02,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:11:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109909463] [2024-06-27 22:11:02,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:02,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:11:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:02,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:11:02,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:11:02,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:02,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:02,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:02,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:02,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:03,340 INFO L124 PetriNetUnfolderBase]: 4132/6720 cut-off events. [2024-06-27 22:11:03,340 INFO L125 PetriNetUnfolderBase]: For 14183/14183 co-relation queries the response was YES. [2024-06-27 22:11:03,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20879 conditions, 6720 events. 4132/6720 cut-off events. For 14183/14183 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 43314 event pairs, 2366 based on Foata normal form. 2/6278 useless extension candidates. Maximal degree in co-relation 20854. Up to 5861 conditions per place. [2024-06-27 22:11:03,374 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 84 selfloop transitions, 28 changer transitions 0/122 dead transitions. [2024-06-27 22:11:03,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 122 transitions, 884 flow [2024-06-27 22:11:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-06-27 22:11:03,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-06-27 22:11:03,376 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 465 flow. Second operand 7 states and 162 transitions. [2024-06-27 22:11:03,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 122 transitions, 884 flow [2024-06-27 22:11:03,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 828 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-27 22:11:03,389 INFO L231 Difference]: Finished difference. Result has 79 places, 100 transitions, 640 flow [2024-06-27 22:11:03,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=640, PETRI_PLACES=79, PETRI_TRANSITIONS=100} [2024-06-27 22:11:03,390 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-06-27 22:11:03,390 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 100 transitions, 640 flow [2024-06-27 22:11:03,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:03,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:03,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:11:03,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:03,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1948224845, now seen corresponding path program 3 times [2024-06-27 22:11:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007758574] [2024-06-27 22:11:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007758574] [2024-06-27 22:11:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007758574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:11:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825021729] [2024-06-27 22:11:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:11:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:11:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:11:04,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:04,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 100 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:04,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:04,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:04,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:05,426 INFO L124 PetriNetUnfolderBase]: 4127/6650 cut-off events. [2024-06-27 22:11:05,427 INFO L125 PetriNetUnfolderBase]: For 18432/18438 co-relation queries the response was YES. [2024-06-27 22:11:05,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22089 conditions, 6650 events. 4127/6650 cut-off events. For 18432/18438 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 42395 event pairs, 2335 based on Foata normal form. 6/6230 useless extension candidates. Maximal degree in co-relation 22060. Up to 5815 conditions per place. [2024-06-27 22:11:05,460 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 80 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-06-27 22:11:05,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 1009 flow [2024-06-27 22:11:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-06-27 22:11:05,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-06-27 22:11:05,462 INFO L175 Difference]: Start difference. First operand has 79 places, 100 transitions, 640 flow. Second operand 7 states and 162 transitions. [2024-06-27 22:11:05,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 1009 flow [2024-06-27 22:11:05,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 129 transitions, 991 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:11:05,476 INFO L231 Difference]: Finished difference. Result has 86 places, 107 transitions, 804 flow [2024-06-27 22:11:05,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=86, PETRI_TRANSITIONS=107} [2024-06-27 22:11:05,477 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2024-06-27 22:11:05,477 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 107 transitions, 804 flow [2024-06-27 22:11:05,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:05,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:05,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:05,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:11:05,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:05,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1948215917, now seen corresponding path program 1 times [2024-06-27 22:11:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736341403] [2024-06-27 22:11:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:05,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736341403] [2024-06-27 22:11:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736341403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259943221] [2024-06-27 22:11:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:06,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:06,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:06,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 107 transitions, 804 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:06,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:06,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:06,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:08,126 INFO L124 PetriNetUnfolderBase]: 4240/6928 cut-off events. [2024-06-27 22:11:08,126 INFO L125 PetriNetUnfolderBase]: For 23891/23891 co-relation queries the response was YES. [2024-06-27 22:11:08,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24118 conditions, 6928 events. 4240/6928 cut-off events. For 23891/23891 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 44493 event pairs, 2415 based on Foata normal form. 2/6525 useless extension candidates. Maximal degree in co-relation 24085. Up to 6011 conditions per place. [2024-06-27 22:11:08,173 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 114 selfloop transitions, 27 changer transitions 3/154 dead transitions. [2024-06-27 22:11:08,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1307 flow [2024-06-27 22:11:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-27 22:11:08,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379939209726444 [2024-06-27 22:11:08,175 INFO L175 Difference]: Start difference. First operand has 86 places, 107 transitions, 804 flow. Second operand 7 states and 177 transitions. [2024-06-27 22:11:08,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1307 flow [2024-06-27 22:11:08,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 154 transitions, 1220 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:08,193 INFO L231 Difference]: Finished difference. Result has 91 places, 120 transitions, 930 flow [2024-06-27 22:11:08,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=930, PETRI_PLACES=91, PETRI_TRANSITIONS=120} [2024-06-27 22:11:08,194 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-27 22:11:08,194 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 120 transitions, 930 flow [2024-06-27 22:11:08,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:08,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:08,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:08,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:11:08,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:08,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1320256145, now seen corresponding path program 1 times [2024-06-27 22:11:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299982859] [2024-06-27 22:11:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:09,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-06-27 22:11:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299982859] [2024-06-27 22:11:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299982859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571021543] [2024-06-27 22:11:09,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:09,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:09,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:09,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 120 transitions, 930 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:09,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:09,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:09,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:10,910 INFO L124 PetriNetUnfolderBase]: 4066/6724 cut-off events. [2024-06-27 22:11:10,910 INFO L125 PetriNetUnfolderBase]: For 30453/30502 co-relation queries the response was YES. [2024-06-27 22:11:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25524 conditions, 6724 events. 4066/6724 cut-off events. For 30453/30502 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 44079 event pairs, 1887 based on Foata normal form. 30/6351 useless extension candidates. Maximal degree in co-relation 25488. Up to 5704 conditions per place. [2024-06-27 22:11:11,013 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 102 selfloop transitions, 44 changer transitions 0/158 dead transitions. [2024-06-27 22:11:11,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 158 transitions, 1379 flow [2024-06-27 22:11:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:11:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:11:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:11:11,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5452127659574468 [2024-06-27 22:11:11,015 INFO L175 Difference]: Start difference. First operand has 91 places, 120 transitions, 930 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:11:11,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 158 transitions, 1379 flow [2024-06-27 22:11:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 158 transitions, 1302 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-27 22:11:11,046 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1009 flow [2024-06-27 22:11:11,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1009, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2024-06-27 22:11:11,048 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-06-27 22:11:11,048 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1009 flow [2024-06-27 22:11:11,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:11,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:11,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:11,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:11:11,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:11,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 506848317, now seen corresponding path program 2 times [2024-06-27 22:11:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44003820] [2024-06-27 22:11:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44003820] [2024-06-27 22:11:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44003820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867679107] [2024-06-27 22:11:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:12,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:12,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1009 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:12,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:12,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:13,464 INFO L124 PetriNetUnfolderBase]: 4112/6783 cut-off events. [2024-06-27 22:11:13,465 INFO L125 PetriNetUnfolderBase]: For 37333/37337 co-relation queries the response was YES. [2024-06-27 22:11:13,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27255 conditions, 6783 events. 4112/6783 cut-off events. For 37333/37337 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 44341 event pairs, 1776 based on Foata normal form. 6/6385 useless extension candidates. Maximal degree in co-relation 27217. Up to 5794 conditions per place. [2024-06-27 22:11:13,511 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 113 selfloop transitions, 40 changer transitions 0/165 dead transitions. [2024-06-27 22:11:13,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 165 transitions, 1551 flow [2024-06-27 22:11:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 22:11:13,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501519756838906 [2024-06-27 22:11:13,522 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1009 flow. Second operand 7 states and 181 transitions. [2024-06-27 22:11:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 165 transitions, 1551 flow [2024-06-27 22:11:13,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 165 transitions, 1405 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 22:11:13,554 INFO L231 Difference]: Finished difference. Result has 98 places, 137 transitions, 1121 flow [2024-06-27 22:11:13,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1121, PETRI_PLACES=98, PETRI_TRANSITIONS=137} [2024-06-27 22:11:13,555 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2024-06-27 22:11:13,555 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 137 transitions, 1121 flow [2024-06-27 22:11:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:13,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:13,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:11:13,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:13,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -272778367, now seen corresponding path program 3 times [2024-06-27 22:11:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652354247] [2024-06-27 22:11:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652354247] [2024-06-27 22:11:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652354247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729137927] [2024-06-27 22:11:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:14,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:14,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 137 transitions, 1121 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:14,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:14,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:14,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:16,027 INFO L124 PetriNetUnfolderBase]: 4144/6836 cut-off events. [2024-06-27 22:11:16,027 INFO L125 PetriNetUnfolderBase]: For 45193/45193 co-relation queries the response was YES. [2024-06-27 22:11:16,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28741 conditions, 6836 events. 4144/6836 cut-off events. For 45193/45193 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 44729 event pairs, 1781 based on Foata normal form. 2/6434 useless extension candidates. Maximal degree in co-relation 28702. Up to 5794 conditions per place. [2024-06-27 22:11:16,070 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 104 selfloop transitions, 55 changer transitions 0/171 dead transitions. [2024-06-27 22:11:16,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1599 flow [2024-06-27 22:11:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:11:16,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-06-27 22:11:16,072 INFO L175 Difference]: Start difference. First operand has 98 places, 137 transitions, 1121 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:11:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1599 flow [2024-06-27 22:11:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 171 transitions, 1495 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 22:11:16,108 INFO L231 Difference]: Finished difference. Result has 102 places, 145 transitions, 1239 flow [2024-06-27 22:11:16,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1239, PETRI_PLACES=102, PETRI_TRANSITIONS=145} [2024-06-27 22:11:16,109 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-27 22:11:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 145 transitions, 1239 flow [2024-06-27 22:11:16,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:16,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:16,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:16,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:11:16,109 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:16,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -265426717, now seen corresponding path program 4 times [2024-06-27 22:11:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694420789] [2024-06-27 22:11:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694420789] [2024-06-27 22:11:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694420789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:17,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592577321] [2024-06-27 22:11:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:17,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:17,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 145 transitions, 1239 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:17,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:17,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:17,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:18,492 INFO L124 PetriNetUnfolderBase]: 4139/6857 cut-off events. [2024-06-27 22:11:18,492 INFO L125 PetriNetUnfolderBase]: For 54078/54078 co-relation queries the response was YES. [2024-06-27 22:11:18,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29993 conditions, 6857 events. 4139/6857 cut-off events. For 54078/54078 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 45086 event pairs, 1775 based on Foata normal form. 2/6447 useless extension candidates. Maximal degree in co-relation 29952. Up to 5702 conditions per place. [2024-06-27 22:11:18,538 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 85 selfloop transitions, 78 changer transitions 0/175 dead transitions. [2024-06-27 22:11:18,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 175 transitions, 1717 flow [2024-06-27 22:11:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:11:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:11:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 22:11:18,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501519756838906 [2024-06-27 22:11:18,541 INFO L175 Difference]: Start difference. First operand has 102 places, 145 transitions, 1239 flow. Second operand 7 states and 181 transitions. [2024-06-27 22:11:18,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 175 transitions, 1717 flow [2024-06-27 22:11:18,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 175 transitions, 1567 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 22:11:18,580 INFO L231 Difference]: Finished difference. Result has 104 places, 149 transitions, 1336 flow [2024-06-27 22:11:18,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1336, PETRI_PLACES=104, PETRI_TRANSITIONS=149} [2024-06-27 22:11:18,580 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-06-27 22:11:18,580 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 149 transitions, 1336 flow [2024-06-27 22:11:18,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:18,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:18,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:18,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:11:18,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:18,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1281823400, now seen corresponding path program 1 times [2024-06-27 22:11:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063749693] [2024-06-27 22:11:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:18,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:18,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063749693] [2024-06-27 22:11:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063749693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:18,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:18,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:11:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428788452] [2024-06-27 22:11:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:18,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:11:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:11:18,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:11:18,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 47 [2024-06-27 22:11:18,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 149 transitions, 1336 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:18,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:18,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 47 [2024-06-27 22:11:18,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:18,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_31 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_85 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_86 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~x$w_buff1_used~0_78 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_30 256) 0)))) 0 v_~x$r_buff1_thd2~0_26) v_~x$r_buff1_thd2~0_25) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_31) v_~x$r_buff0_thd2~0_30) (= (ite .cse4 0 v_~x$w_buff0_used~0_86) v_~x$w_buff0_used~0_85) (= v_~x~0_62 (ite .cse4 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_63)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_31, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_85} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][84], [Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~weak$$choice2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~weak$$choice0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 127#(and (= ~__unbuffered_p0_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 33#L806true, Black: 126#(and (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$r_buff1_thd1~0 0)))), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (or (and (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x$flush_delayed~0 0) (<= ~weak$$choice2~0 1) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$r_buff1_thd1~0 0)), 107#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (<= (div ~x$w_buff0_used~0 256) (div ~x$w_buff1_used~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice2~0 1) (<= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (<= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 134#true, 95#true, Black: 139#(and (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 140#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~x$mem_tmp~0 0)), Black: 138#(and (= 0 ~x$w_buff1~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0))) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice2~0 1) (<= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 15#L846true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (or (and (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 87#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), 188#true, Black: 158#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (or (and (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x$flush_delayed~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX~0 0))) (= ~__unbuffered_p2_EBX~0 0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 83#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 100#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), 43#L749true, Black: 166#(and (= ~x$r_buff1_thd1~0 ~x$r_buff0_thd1~0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x$w_buff0~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (or (and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0)) (and (= ~x~0 0) (<= 0 (div ~weak$$choice2~0 256)) (= 0 ~x$r_buff0_thd1~0) (<= ~weak$$choice2~0 1))) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)))), 200#true, P0Thread1of1ForFork0InUse, Black: 112#(and (= ~__unbuffered_p0_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (<= ~x$flush_delayed~0 (+ (* (div ~x$flush_delayed~0 256) 256) 1)) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (= ~x$w_buff0~0 1) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (<= ~weak$$choice2~0 (+ (* (div ~weak$$choice2~0 256) 256) 2)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~weak$$choice0~0 (+ (* (div ~weak$$choice0~0 256) 256) 2)) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd1~0 (+ (* (div ~x$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork1InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p2_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork2InUse, 11#L796true, Black: 186#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (or (and (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x$flush_delayed~0 0)) (= |#ghost~multithreaded| 0)) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (<= ~x$read_delayed~0 (+ (* (div ~x$read_delayed~0 256) 256) 1)) (<= ~x$r_buff0_thd3~0 (+ (* 256 (div ~x$r_buff0_thd3~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd0~0 (+ (* 256 (div ~x$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~weak$$choice2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= ~weak$$choice0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 22:11:18,850 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:11:18,851 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:11:18,851 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:11:18,851 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:11:19,029 INFO L124 PetriNetUnfolderBase]: 1723/3458 cut-off events. [2024-06-27 22:11:19,029 INFO L125 PetriNetUnfolderBase]: For 26339/27022 co-relation queries the response was YES. [2024-06-27 22:11:19,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14580 conditions, 3458 events. 1723/3458 cut-off events. For 26339/27022 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25163 event pairs, 567 based on Foata normal form. 42/3205 useless extension candidates. Maximal degree in co-relation 14539. Up to 1993 conditions per place. [2024-06-27 22:11:19,056 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 76 selfloop transitions, 13 changer transitions 0/160 dead transitions. [2024-06-27 22:11:19,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 160 transitions, 1558 flow [2024-06-27 22:11:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:11:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:11:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-06-27 22:11:19,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-06-27 22:11:19,058 INFO L175 Difference]: Start difference. First operand has 104 places, 149 transitions, 1336 flow. Second operand 3 states and 108 transitions. [2024-06-27 22:11:19,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 160 transitions, 1558 flow [2024-06-27 22:11:19,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 160 transitions, 1341 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-27 22:11:19,081 INFO L231 Difference]: Finished difference. Result has 100 places, 148 transitions, 1135 flow [2024-06-27 22:11:19,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=100, PETRI_TRANSITIONS=148} [2024-06-27 22:11:19,081 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 47 predicate places. [2024-06-27 22:11:19,081 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 148 transitions, 1135 flow [2024-06-27 22:11:19,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:19,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:19,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:19,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:11:19,082 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:19,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -265149670, now seen corresponding path program 1 times [2024-06-27 22:11:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061097697] [2024-06-27 22:11:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:20,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:20,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061097697] [2024-06-27 22:11:20,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061097697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:20,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:20,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193949931] [2024-06-27 22:11:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:21,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:21,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 148 transitions, 1135 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:21,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:21,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:21,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:21,919 INFO L124 PetriNetUnfolderBase]: 3324/5603 cut-off events. [2024-06-27 22:11:21,919 INFO L125 PetriNetUnfolderBase]: For 48755/48755 co-relation queries the response was YES. [2024-06-27 22:11:21,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24237 conditions, 5603 events. 3324/5603 cut-off events. For 48755/48755 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 35738 event pairs, 1703 based on Foata normal form. 4/5401 useless extension candidates. Maximal degree in co-relation 24196. Up to 4700 conditions per place. [2024-06-27 22:11:21,953 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 157 selfloop transitions, 24 changer transitions 3/195 dead transitions. [2024-06-27 22:11:21,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 195 transitions, 1726 flow [2024-06-27 22:11:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 22:11:21,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 22:11:21,955 INFO L175 Difference]: Start difference. First operand has 100 places, 148 transitions, 1135 flow. Second operand 9 states and 216 transitions. [2024-06-27 22:11:21,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 195 transitions, 1726 flow [2024-06-27 22:11:21,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 195 transitions, 1700 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:11:21,986 INFO L231 Difference]: Finished difference. Result has 109 places, 156 transitions, 1286 flow [2024-06-27 22:11:21,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1286, PETRI_PLACES=109, PETRI_TRANSITIONS=156} [2024-06-27 22:11:21,986 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2024-06-27 22:11:21,987 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 156 transitions, 1286 flow [2024-06-27 22:11:21,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:21,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:21,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:21,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:11:21,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:21,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1283283899, now seen corresponding path program 1 times [2024-06-27 22:11:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:21,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059075920] [2024-06-27 22:11:21,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:21,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059075920] [2024-06-27 22:11:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059075920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:11:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396662386] [2024-06-27 22:11:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:22,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:11:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:22,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:11:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:11:22,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:22,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 156 transitions, 1286 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:22,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:22,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:22,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:23,806 INFO L124 PetriNetUnfolderBase]: 3462/5937 cut-off events. [2024-06-27 22:11:23,806 INFO L125 PetriNetUnfolderBase]: For 54189/54189 co-relation queries the response was YES. [2024-06-27 22:11:23,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26063 conditions, 5937 events. 3462/5937 cut-off events. For 54189/54189 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 38562 event pairs, 1818 based on Foata normal form. 1/5755 useless extension candidates. Maximal degree in co-relation 26018. Up to 4958 conditions per place. [2024-06-27 22:11:23,854 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 150 selfloop transitions, 13 changer transitions 0/173 dead transitions. [2024-06-27 22:11:23,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1690 flow [2024-06-27 22:11:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:11:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:11:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-27 22:11:23,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2024-06-27 22:11:23,856 INFO L175 Difference]: Start difference. First operand has 109 places, 156 transitions, 1286 flow. Second operand 5 states and 119 transitions. [2024-06-27 22:11:23,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1690 flow [2024-06-27 22:11:23,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1624 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:23,904 INFO L231 Difference]: Finished difference. Result has 109 places, 159 transitions, 1283 flow [2024-06-27 22:11:23,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1283, PETRI_PLACES=109, PETRI_TRANSITIONS=159} [2024-06-27 22:11:23,905 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2024-06-27 22:11:23,905 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 159 transitions, 1283 flow [2024-06-27 22:11:23,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:23,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:23,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:23,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:11:23,906 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:23,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2021724156, now seen corresponding path program 1 times [2024-06-27 22:11:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611117071] [2024-06-27 22:11:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611117071] [2024-06-27 22:11:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611117071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419559468] [2024-06-27 22:11:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:25,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:25,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:25,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 159 transitions, 1283 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:25,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:25,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:25,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:26,533 INFO L124 PetriNetUnfolderBase]: 3867/6382 cut-off events. [2024-06-27 22:11:26,533 INFO L125 PetriNetUnfolderBase]: For 66566/66575 co-relation queries the response was YES. [2024-06-27 22:11:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29576 conditions, 6382 events. 3867/6382 cut-off events. For 66566/66575 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 40744 event pairs, 1739 based on Foata normal form. 2/6165 useless extension candidates. Maximal degree in co-relation 29528. Up to 5388 conditions per place. [2024-06-27 22:11:26,577 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 164 selfloop transitions, 51 changer transitions 0/226 dead transitions. [2024-06-27 22:11:26,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 226 transitions, 2113 flow [2024-06-27 22:11:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:11:26,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 22:11:26,579 INFO L175 Difference]: Start difference. First operand has 109 places, 159 transitions, 1283 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:11:26,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 226 transitions, 2113 flow [2024-06-27 22:11:26,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 2084 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:11:26,631 INFO L231 Difference]: Finished difference. Result has 118 places, 180 transitions, 1669 flow [2024-06-27 22:11:26,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1669, PETRI_PLACES=118, PETRI_TRANSITIONS=180} [2024-06-27 22:11:26,632 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2024-06-27 22:11:26,632 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 180 transitions, 1669 flow [2024-06-27 22:11:26,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:26,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:26,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:26,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:11:26,633 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:26,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash 133813524, now seen corresponding path program 2 times [2024-06-27 22:11:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238125099] [2024-06-27 22:11:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:28,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-06-27 22:11:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238125099] [2024-06-27 22:11:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238125099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:28,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326154421] [2024-06-27 22:11:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:28,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:28,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:28,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:28,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 180 transitions, 1669 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:28,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:28,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:28,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:29,264 INFO L124 PetriNetUnfolderBase]: 3812/6269 cut-off events. [2024-06-27 22:11:29,265 INFO L125 PetriNetUnfolderBase]: For 74185/74185 co-relation queries the response was YES. [2024-06-27 22:11:29,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31057 conditions, 6269 events. 3812/6269 cut-off events. For 74185/74185 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 39419 event pairs, 1273 based on Foata normal form. 4/6093 useless extension candidates. Maximal degree in co-relation 31005. Up to 5213 conditions per place. [2024-06-27 22:11:29,310 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 153 selfloop transitions, 68 changer transitions 0/232 dead transitions. [2024-06-27 22:11:29,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 232 transitions, 2432 flow [2024-06-27 22:11:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:11:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:11:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:11:29,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-06-27 22:11:29,311 INFO L175 Difference]: Start difference. First operand has 118 places, 180 transitions, 1669 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:11:29,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 232 transitions, 2432 flow [2024-06-27 22:11:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 232 transitions, 2285 flow, removed 59 selfloop flow, removed 3 redundant places. [2024-06-27 22:11:29,387 INFO L231 Difference]: Finished difference. Result has 124 places, 198 transitions, 1912 flow [2024-06-27 22:11:29,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1912, PETRI_PLACES=124, PETRI_TRANSITIONS=198} [2024-06-27 22:11:29,387 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 71 predicate places. [2024-06-27 22:11:29,387 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 198 transitions, 1912 flow [2024-06-27 22:11:29,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:29,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:29,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:29,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:11:29,388 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:29,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash 370285554, now seen corresponding path program 3 times [2024-06-27 22:11:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:29,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140754250] [2024-06-27 22:11:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:30,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140754250] [2024-06-27 22:11:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140754250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:30,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818302026] [2024-06-27 22:11:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:30,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:30,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:30,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 198 transitions, 1912 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:30,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:30,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:30,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:32,011 INFO L124 PetriNetUnfolderBase]: 3929/6396 cut-off events. [2024-06-27 22:11:32,011 INFO L125 PetriNetUnfolderBase]: For 86951/86966 co-relation queries the response was YES. [2024-06-27 22:11:32,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33678 conditions, 6396 events. 3929/6396 cut-off events. For 86951/86966 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 40051 event pairs, 1699 based on Foata normal form. 6/6204 useless extension candidates. Maximal degree in co-relation 33623. Up to 5295 conditions per place. [2024-06-27 22:11:32,059 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 146 selfloop transitions, 100 changer transitions 0/257 dead transitions. [2024-06-27 22:11:32,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 257 transitions, 2931 flow [2024-06-27 22:11:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:11:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:11:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 22:11:32,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2024-06-27 22:11:32,061 INFO L175 Difference]: Start difference. First operand has 124 places, 198 transitions, 1912 flow. Second operand 8 states and 202 transitions. [2024-06-27 22:11:32,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 257 transitions, 2931 flow [2024-06-27 22:11:32,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 257 transitions, 2792 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:32,140 INFO L231 Difference]: Finished difference. Result has 131 places, 216 transitions, 2404 flow [2024-06-27 22:11:32,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2404, PETRI_PLACES=131, PETRI_TRANSITIONS=216} [2024-06-27 22:11:32,141 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 78 predicate places. [2024-06-27 22:11:32,141 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 216 transitions, 2404 flow [2024-06-27 22:11:32,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:32,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:32,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:11:32,141 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:32,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash 369988884, now seen corresponding path program 4 times [2024-06-27 22:11:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825801489] [2024-06-27 22:11:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825801489] [2024-06-27 22:11:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825801489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83969796] [2024-06-27 22:11:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:33,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:33,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:33,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 216 transitions, 2404 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:33,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:33,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:33,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:35,037 INFO L124 PetriNetUnfolderBase]: 3975/6464 cut-off events. [2024-06-27 22:11:35,038 INFO L125 PetriNetUnfolderBase]: For 98163/98178 co-relation queries the response was YES. [2024-06-27 22:11:35,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35911 conditions, 6464 events. 3975/6464 cut-off events. For 98163/98178 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 40437 event pairs, 1703 based on Foata normal form. 6/6271 useless extension candidates. Maximal degree in co-relation 35852. Up to 5434 conditions per place. [2024-06-27 22:11:35,087 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 165 selfloop transitions, 88 changer transitions 0/264 dead transitions. [2024-06-27 22:11:35,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 264 transitions, 3214 flow [2024-06-27 22:11:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:11:35,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011820330969267 [2024-06-27 22:11:35,089 INFO L175 Difference]: Start difference. First operand has 131 places, 216 transitions, 2404 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:11:35,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 264 transitions, 3214 flow [2024-06-27 22:11:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 264 transitions, 3082 flow, removed 64 selfloop flow, removed 1 redundant places. [2024-06-27 22:11:35,240 INFO L231 Difference]: Finished difference. Result has 139 places, 226 transitions, 2641 flow [2024-06-27 22:11:35,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2641, PETRI_PLACES=139, PETRI_TRANSITIONS=226} [2024-06-27 22:11:35,241 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2024-06-27 22:11:35,241 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 226 transitions, 2641 flow [2024-06-27 22:11:35,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:35,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:35,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:35,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:11:35,242 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash 361714674, now seen corresponding path program 5 times [2024-06-27 22:11:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:35,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817040052] [2024-06-27 22:11:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817040052] [2024-06-27 22:11:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817040052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910878257] [2024-06-27 22:11:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:36,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:36,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:36,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 226 transitions, 2641 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:36,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:36,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:36,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:37,771 INFO L124 PetriNetUnfolderBase]: 3985/6475 cut-off events. [2024-06-27 22:11:37,771 INFO L125 PetriNetUnfolderBase]: For 95209/95224 co-relation queries the response was YES. [2024-06-27 22:11:37,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35227 conditions, 6475 events. 3985/6475 cut-off events. For 95209/95224 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 40480 event pairs, 1703 based on Foata normal form. 6/6281 useless extension candidates. Maximal degree in co-relation 35165. Up to 5444 conditions per place. [2024-06-27 22:11:37,829 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 172 selfloop transitions, 90 changer transitions 0/273 dead transitions. [2024-06-27 22:11:37,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 273 transitions, 3470 flow [2024-06-27 22:11:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:11:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:11:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:11:37,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-06-27 22:11:37,831 INFO L175 Difference]: Start difference. First operand has 139 places, 226 transitions, 2641 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:11:37,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 273 transitions, 3470 flow [2024-06-27 22:11:37,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 273 transitions, 3195 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-27 22:11:37,959 INFO L231 Difference]: Finished difference. Result has 142 places, 235 transitions, 2759 flow [2024-06-27 22:11:37,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2394, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2759, PETRI_PLACES=142, PETRI_TRANSITIONS=235} [2024-06-27 22:11:37,959 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 89 predicate places. [2024-06-27 22:11:37,959 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 235 transitions, 2759 flow [2024-06-27 22:11:37,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:37,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:37,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:37,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:11:37,960 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:37,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1127093798, now seen corresponding path program 1 times [2024-06-27 22:11:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548062933] [2024-06-27 22:11:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548062933] [2024-06-27 22:11:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548062933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:11:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365467] [2024-06-27 22:11:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:39,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:11:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:11:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:11:39,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:39,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 235 transitions, 2759 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:39,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:39,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:40,302 INFO L124 PetriNetUnfolderBase]: 3653/6222 cut-off events. [2024-06-27 22:11:40,302 INFO L125 PetriNetUnfolderBase]: For 84882/84882 co-relation queries the response was YES. [2024-06-27 22:11:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32768 conditions, 6222 events. 3653/6222 cut-off events. For 84882/84882 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 40222 event pairs, 1718 based on Foata normal form. 2/6033 useless extension candidates. Maximal degree in co-relation 32705. Up to 5202 conditions per place. [2024-06-27 22:11:40,371 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 232 selfloop transitions, 16 changer transitions 0/258 dead transitions. [2024-06-27 22:11:40,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 258 transitions, 3369 flow [2024-06-27 22:11:40,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:11:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:11:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 22:11:40,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:11:40,373 INFO L175 Difference]: Start difference. First operand has 142 places, 235 transitions, 2759 flow. Second operand 6 states and 141 transitions. [2024-06-27 22:11:40,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 258 transitions, 3369 flow [2024-06-27 22:11:40,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 3183 flow, removed 43 selfloop flow, removed 3 redundant places. [2024-06-27 22:11:40,512 INFO L231 Difference]: Finished difference. Result has 145 places, 238 transitions, 2645 flow [2024-06-27 22:11:40,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2645, PETRI_PLACES=145, PETRI_TRANSITIONS=238} [2024-06-27 22:11:40,513 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2024-06-27 22:11:40,513 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 238 transitions, 2645 flow [2024-06-27 22:11:40,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:40,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:40,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:40,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:11:40,514 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:40,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash 704890830, now seen corresponding path program 1 times [2024-06-27 22:11:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508743327] [2024-06-27 22:11:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508743327] [2024-06-27 22:11:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508743327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501631514] [2024-06-27 22:11:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:41,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:41,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:41,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 238 transitions, 2645 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:41,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:41,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:41,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:43,099 INFO L124 PetriNetUnfolderBase]: 3913/6377 cut-off events. [2024-06-27 22:11:43,099 INFO L125 PetriNetUnfolderBase]: For 110527/110562 co-relation queries the response was YES. [2024-06-27 22:11:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36633 conditions, 6377 events. 3913/6377 cut-off events. For 110527/110562 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 40455 event pairs, 1356 based on Foata normal form. 12/6206 useless extension candidates. Maximal degree in co-relation 36568. Up to 5359 conditions per place. [2024-06-27 22:11:43,153 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 227 selfloop transitions, 55 changer transitions 0/302 dead transitions. [2024-06-27 22:11:43,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 302 transitions, 3539 flow [2024-06-27 22:11:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-06-27 22:11:43,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2024-06-27 22:11:43,155 INFO L175 Difference]: Start difference. First operand has 145 places, 238 transitions, 2645 flow. Second operand 10 states and 246 transitions. [2024-06-27 22:11:43,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 302 transitions, 3539 flow [2024-06-27 22:11:43,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 302 transitions, 3495 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:43,278 INFO L231 Difference]: Finished difference. Result has 154 places, 257 transitions, 2972 flow [2024-06-27 22:11:43,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2601, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2972, PETRI_PLACES=154, PETRI_TRANSITIONS=257} [2024-06-27 22:11:43,278 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 101 predicate places. [2024-06-27 22:11:43,278 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 257 transitions, 2972 flow [2024-06-27 22:11:43,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:43,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:43,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:11:43,279 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:43,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 132295806, now seen corresponding path program 2 times [2024-06-27 22:11:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:43,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377965860] [2024-06-27 22:11:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377965860] [2024-06-27 22:11:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377965860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:44,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:44,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831975377] [2024-06-27 22:11:44,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:44,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:44,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:44,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 257 transitions, 2972 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:44,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:44,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:44,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:45,871 INFO L124 PetriNetUnfolderBase]: 3943/6397 cut-off events. [2024-06-27 22:11:45,871 INFO L125 PetriNetUnfolderBase]: For 124409/124431 co-relation queries the response was YES. [2024-06-27 22:11:45,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38753 conditions, 6397 events. 3943/6397 cut-off events. For 124409/124431 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 40493 event pairs, 1350 based on Foata normal form. 17/6263 useless extension candidates. Maximal degree in co-relation 38684. Up to 5370 conditions per place. [2024-06-27 22:11:45,928 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 233 selfloop transitions, 72 changer transitions 0/325 dead transitions. [2024-06-27 22:11:45,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 325 transitions, 4026 flow [2024-06-27 22:11:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-06-27 22:11:45,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508274231678487 [2024-06-27 22:11:45,930 INFO L175 Difference]: Start difference. First operand has 154 places, 257 transitions, 2972 flow. Second operand 9 states and 233 transitions. [2024-06-27 22:11:45,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 325 transitions, 4026 flow [2024-06-27 22:11:46,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 325 transitions, 3887 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:46,070 INFO L231 Difference]: Finished difference. Result has 160 places, 277 transitions, 3323 flow [2024-06-27 22:11:46,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3323, PETRI_PLACES=160, PETRI_TRANSITIONS=277} [2024-06-27 22:11:46,070 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 107 predicate places. [2024-06-27 22:11:46,070 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 277 transitions, 3323 flow [2024-06-27 22:11:46,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:46,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:46,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:46,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:11:46,071 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:46,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2014095776, now seen corresponding path program 3 times [2024-06-27 22:11:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587709592] [2024-06-27 22:11:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587709592] [2024-06-27 22:11:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587709592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:11:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626286936] [2024-06-27 22:11:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:47,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:11:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:11:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:11:47,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:11:47,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 277 transitions, 3323 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:47,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:47,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:11:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:48,446 INFO L124 PetriNetUnfolderBase]: 3411/6023 cut-off events. [2024-06-27 22:11:48,446 INFO L125 PetriNetUnfolderBase]: For 137844/138214 co-relation queries the response was YES. [2024-06-27 22:11:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36393 conditions, 6023 events. 3411/6023 cut-off events. For 137844/138214 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41845 event pairs, 871 based on Foata normal form. 48/5761 useless extension candidates. Maximal degree in co-relation 36323. Up to 4205 conditions per place. [2024-06-27 22:11:48,492 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 195 selfloop transitions, 74 changer transitions 0/327 dead transitions. [2024-06-27 22:11:48,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 327 transitions, 4151 flow [2024-06-27 22:11:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:11:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:11:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 22:11:48,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-06-27 22:11:48,494 INFO L175 Difference]: Start difference. First operand has 160 places, 277 transitions, 3323 flow. Second operand 8 states and 226 transitions. [2024-06-27 22:11:48,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 327 transitions, 4151 flow [2024-06-27 22:11:48,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 327 transitions, 3945 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:48,657 INFO L231 Difference]: Finished difference. Result has 165 places, 284 transitions, 3441 flow [2024-06-27 22:11:48,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3441, PETRI_PLACES=165, PETRI_TRANSITIONS=284} [2024-06-27 22:11:48,658 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 112 predicate places. [2024-06-27 22:11:48,658 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 284 transitions, 3441 flow [2024-06-27 22:11:48,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:48,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:48,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:11:48,659 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:48,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 132749088, now seen corresponding path program 1 times [2024-06-27 22:11:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769488038] [2024-06-27 22:11:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769488038] [2024-06-27 22:11:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769488038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414041712] [2024-06-27 22:11:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:50,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:50,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:11:50,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 284 transitions, 3441 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:50,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:50,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:11:50,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:51,894 INFO L124 PetriNetUnfolderBase]: 4349/6937 cut-off events. [2024-06-27 22:11:51,895 INFO L125 PetriNetUnfolderBase]: For 146192/146206 co-relation queries the response was YES. [2024-06-27 22:11:51,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42700 conditions, 6937 events. 4349/6937 cut-off events. For 146192/146206 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 43040 event pairs, 1516 based on Foata normal form. 8/6787 useless extension candidates. Maximal degree in co-relation 42627. Up to 6018 conditions per place. [2024-06-27 22:11:51,966 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 260 selfloop transitions, 79 changer transitions 0/350 dead transitions. [2024-06-27 22:11:51,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 350 transitions, 4527 flow [2024-06-27 22:11:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:11:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:11:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 279 transitions. [2024-06-27 22:11:51,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946808510638298 [2024-06-27 22:11:51,967 INFO L175 Difference]: Start difference. First operand has 165 places, 284 transitions, 3441 flow. Second operand 12 states and 279 transitions. [2024-06-27 22:11:51,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 350 transitions, 4527 flow [2024-06-27 22:11:52,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 350 transitions, 4331 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-27 22:11:52,236 INFO L231 Difference]: Finished difference. Result has 173 places, 297 transitions, 3655 flow [2024-06-27 22:11:52,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3276, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3655, PETRI_PLACES=173, PETRI_TRANSITIONS=297} [2024-06-27 22:11:52,237 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 120 predicate places. [2024-06-27 22:11:52,237 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 297 transitions, 3655 flow [2024-06-27 22:11:52,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:52,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:52,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:52,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:11:52,238 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:52,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -472663472, now seen corresponding path program 4 times [2024-06-27 22:11:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032555331] [2024-06-27 22:11:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032555331] [2024-06-27 22:11:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032555331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120808316] [2024-06-27 22:11:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:53,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:53,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:53,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 297 transitions, 3655 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:53,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:53,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:53,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:55,079 INFO L124 PetriNetUnfolderBase]: 4220/6837 cut-off events. [2024-06-27 22:11:55,079 INFO L125 PetriNetUnfolderBase]: For 139718/139724 co-relation queries the response was YES. [2024-06-27 22:11:55,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42607 conditions, 6837 events. 4220/6837 cut-off events. For 139718/139724 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 43035 event pairs, 1224 based on Foata normal form. 10/6700 useless extension candidates. Maximal degree in co-relation 42533. Up to 5733 conditions per place. [2024-06-27 22:11:55,142 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 273 selfloop transitions, 70 changer transitions 0/365 dead transitions. [2024-06-27 22:11:55,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 365 transitions, 4834 flow [2024-06-27 22:11:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-27 22:11:55,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-06-27 22:11:55,144 INFO L175 Difference]: Start difference. First operand has 173 places, 297 transitions, 3655 flow. Second operand 9 states and 228 transitions. [2024-06-27 22:11:55,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 365 transitions, 4834 flow [2024-06-27 22:11:55,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 365 transitions, 4609 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-27 22:11:55,352 INFO L231 Difference]: Finished difference. Result has 174 places, 322 transitions, 3969 flow [2024-06-27 22:11:55,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3452, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3969, PETRI_PLACES=174, PETRI_TRANSITIONS=322} [2024-06-27 22:11:55,353 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2024-06-27 22:11:55,353 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 322 transitions, 3969 flow [2024-06-27 22:11:55,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:55,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:55,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:11:55,354 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:55,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash -469776752, now seen corresponding path program 5 times [2024-06-27 22:11:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594713509] [2024-06-27 22:11:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594713509] [2024-06-27 22:11:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594713509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:56,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:56,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:11:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436521658] [2024-06-27 22:11:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:56,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:11:56,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:11:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:11:56,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:11:56,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 322 transitions, 3969 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:56,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:56,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:11:56,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:58,445 INFO L124 PetriNetUnfolderBase]: 4310/6965 cut-off events. [2024-06-27 22:11:58,446 INFO L125 PetriNetUnfolderBase]: For 157242/157248 co-relation queries the response was YES. [2024-06-27 22:11:58,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44685 conditions, 6965 events. 4310/6965 cut-off events. For 157242/157248 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 44026 event pairs, 1219 based on Foata normal form. 12/6848 useless extension candidates. Maximal degree in co-relation 44609. Up to 5881 conditions per place. [2024-06-27 22:11:58,511 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 276 selfloop transitions, 84 changer transitions 0/382 dead transitions. [2024-06-27 22:11:58,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 382 transitions, 5128 flow [2024-06-27 22:11:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-27 22:11:58,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366430260047281 [2024-06-27 22:11:58,513 INFO L175 Difference]: Start difference. First operand has 174 places, 322 transitions, 3969 flow. Second operand 9 states and 227 transitions. [2024-06-27 22:11:58,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 382 transitions, 5128 flow [2024-06-27 22:11:58,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 382 transitions, 4954 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:58,755 INFO L231 Difference]: Finished difference. Result has 180 places, 342 transitions, 4352 flow [2024-06-27 22:11:58,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3795, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4352, PETRI_PLACES=180, PETRI_TRANSITIONS=342} [2024-06-27 22:11:58,756 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 127 predicate places. [2024-06-27 22:11:58,756 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 342 transitions, 4352 flow [2024-06-27 22:11:58,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:58,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:58,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:11:58,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:11:58,757 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:11:58,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -353591852, now seen corresponding path program 6 times [2024-06-27 22:11:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931484263] [2024-06-27 22:11:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931484263] [2024-06-27 22:12:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931484263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:12:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838136365] [2024-06-27 22:12:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:12:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:12:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:12:00,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:12:00,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 342 transitions, 4352 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:00,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:00,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:12:00,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:01,904 INFO L124 PetriNetUnfolderBase]: 4339/7021 cut-off events. [2024-06-27 22:12:01,904 INFO L125 PetriNetUnfolderBase]: For 169966/169970 co-relation queries the response was YES. [2024-06-27 22:12:01,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46134 conditions, 7021 events. 4339/7021 cut-off events. For 169966/169970 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 44584 event pairs, 1208 based on Foata normal form. 12/6894 useless extension candidates. Maximal degree in co-relation 46055. Up to 5871 conditions per place. [2024-06-27 22:12:01,973 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 248 selfloop transitions, 115 changer transitions 0/385 dead transitions. [2024-06-27 22:12:01,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 385 transitions, 5318 flow [2024-06-27 22:12:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:12:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:12:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-27 22:12:01,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366430260047281 [2024-06-27 22:12:01,974 INFO L175 Difference]: Start difference. First operand has 180 places, 342 transitions, 4352 flow. Second operand 9 states and 227 transitions. [2024-06-27 22:12:01,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 385 transitions, 5318 flow [2024-06-27 22:12:02,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 385 transitions, 5068 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:02,244 INFO L231 Difference]: Finished difference. Result has 182 places, 345 transitions, 4449 flow [2024-06-27 22:12:02,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4102, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=182, PETRI_TRANSITIONS=345} [2024-06-27 22:12:02,245 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 129 predicate places. [2024-06-27 22:12:02,245 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 345 transitions, 4449 flow [2024-06-27 22:12:02,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:02,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:02,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:02,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:12:02,246 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:02,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 190997530, now seen corresponding path program 2 times [2024-06-27 22:12:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:02,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196474500] [2024-06-27 22:12:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:03,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196474500] [2024-06-27 22:12:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196474500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483756808] [2024-06-27 22:12:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:04,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:04,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 345 transitions, 4449 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:04,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:04,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:05,772 INFO L124 PetriNetUnfolderBase]: 4856/7632 cut-off events. [2024-06-27 22:12:05,773 INFO L125 PetriNetUnfolderBase]: For 178197/178203 co-relation queries the response was YES. [2024-06-27 22:12:05,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49134 conditions, 7632 events. 4856/7632 cut-off events. For 178197/178203 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 46798 event pairs, 1402 based on Foata normal form. 8/7506 useless extension candidates. Maximal degree in co-relation 49055. Up to 6695 conditions per place. [2024-06-27 22:12:05,868 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 306 selfloop transitions, 113 changer transitions 0/430 dead transitions. [2024-06-27 22:12:05,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 430 transitions, 6046 flow [2024-06-27 22:12:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:12:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:12:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2024-06-27 22:12:05,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067698259187621 [2024-06-27 22:12:05,870 INFO L175 Difference]: Start difference. First operand has 182 places, 345 transitions, 4449 flow. Second operand 11 states and 262 transitions. [2024-06-27 22:12:05,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 430 transitions, 6046 flow [2024-06-27 22:12:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 430 transitions, 5719 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:06,301 INFO L231 Difference]: Finished difference. Result has 189 places, 380 transitions, 5053 flow [2024-06-27 22:12:06,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4128, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5053, PETRI_PLACES=189, PETRI_TRANSITIONS=380} [2024-06-27 22:12:06,302 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 136 predicate places. [2024-06-27 22:12:06,303 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 380 transitions, 5053 flow [2024-06-27 22:12:06,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:06,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:06,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:06,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:12:06,303 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:06,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 223539154, now seen corresponding path program 3 times [2024-06-27 22:12:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:06,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761679422] [2024-06-27 22:12:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761679422] [2024-06-27 22:12:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761679422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488214757] [2024-06-27 22:12:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:08,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:08,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:08,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:08,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 380 transitions, 5053 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:08,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:08,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:08,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:10,262 INFO L124 PetriNetUnfolderBase]: 4920/7736 cut-off events. [2024-06-27 22:12:10,262 INFO L125 PetriNetUnfolderBase]: For 190199/190203 co-relation queries the response was YES. [2024-06-27 22:12:10,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50936 conditions, 7736 events. 4920/7736 cut-off events. For 190199/190203 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 47569 event pairs, 1390 based on Foata normal form. 6/7602 useless extension candidates. Maximal degree in co-relation 50853. Up to 6673 conditions per place. [2024-06-27 22:12:10,356 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 299 selfloop transitions, 139 changer transitions 0/449 dead transitions. [2024-06-27 22:12:10,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 449 transitions, 6351 flow [2024-06-27 22:12:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-06-27 22:12:10,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191489361702127 [2024-06-27 22:12:10,358 INFO L175 Difference]: Start difference. First operand has 189 places, 380 transitions, 5053 flow. Second operand 10 states and 244 transitions. [2024-06-27 22:12:10,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 449 transitions, 6351 flow [2024-06-27 22:12:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 449 transitions, 6119 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-06-27 22:12:10,824 INFO L231 Difference]: Finished difference. Result has 195 places, 402 transitions, 5401 flow [2024-06-27 22:12:10,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4823, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5401, PETRI_PLACES=195, PETRI_TRANSITIONS=402} [2024-06-27 22:12:10,825 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 142 predicate places. [2024-06-27 22:12:10,825 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 402 transitions, 5401 flow [2024-06-27 22:12:10,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:10,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:10,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:12:10,826 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:10,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -353585900, now seen corresponding path program 4 times [2024-06-27 22:12:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369741565] [2024-06-27 22:12:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369741565] [2024-06-27 22:12:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369741565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:12,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:12,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641107120] [2024-06-27 22:12:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:12,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:12,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:12,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 402 transitions, 5401 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:12,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:12,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:12,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:14,727 INFO L124 PetriNetUnfolderBase]: 4943/7778 cut-off events. [2024-06-27 22:12:14,728 INFO L125 PetriNetUnfolderBase]: For 202831/202835 co-relation queries the response was YES. [2024-06-27 22:12:14,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52921 conditions, 7778 events. 4943/7778 cut-off events. For 202831/202835 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 47883 event pairs, 1391 based on Foata normal form. 6/7643 useless extension candidates. Maximal degree in co-relation 52835. Up to 6705 conditions per place. [2024-06-27 22:12:14,804 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 308 selfloop transitions, 133 changer transitions 0/452 dead transitions. [2024-06-27 22:12:14,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 452 transitions, 6565 flow [2024-06-27 22:12:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 22:12:14,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-06-27 22:12:14,806 INFO L175 Difference]: Start difference. First operand has 195 places, 402 transitions, 5401 flow. Second operand 10 states and 245 transitions. [2024-06-27 22:12:14,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 452 transitions, 6565 flow [2024-06-27 22:12:15,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 452 transitions, 6344 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 22:12:15,187 INFO L231 Difference]: Finished difference. Result has 200 places, 405 transitions, 5553 flow [2024-06-27 22:12:15,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5180, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5553, PETRI_PLACES=200, PETRI_TRANSITIONS=405} [2024-06-27 22:12:15,188 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 147 predicate places. [2024-06-27 22:12:15,188 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 405 transitions, 5553 flow [2024-06-27 22:12:15,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:15,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:15,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:12:15,189 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:15,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -353376371, now seen corresponding path program 1 times [2024-06-27 22:12:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167859238] [2024-06-27 22:12:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:16,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:16,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167859238] [2024-06-27 22:12:16,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167859238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:16,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543181159] [2024-06-27 22:12:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:16,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:16,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:16,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 405 transitions, 5553 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:16,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:16,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:16,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:18,506 INFO L124 PetriNetUnfolderBase]: 5038/7974 cut-off events. [2024-06-27 22:12:18,507 INFO L125 PetriNetUnfolderBase]: For 225407/225421 co-relation queries the response was YES. [2024-06-27 22:12:18,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54890 conditions, 7974 events. 5038/7974 cut-off events. For 225407/225421 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 49871 event pairs, 1730 based on Foata normal form. 10/7807 useless extension candidates. Maximal degree in co-relation 54803. Up to 7016 conditions per place. [2024-06-27 22:12:18,592 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 393 selfloop transitions, 58 changer transitions 0/462 dead transitions. [2024-06-27 22:12:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 462 transitions, 6759 flow [2024-06-27 22:12:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-06-27 22:12:18,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2024-06-27 22:12:18,594 INFO L175 Difference]: Start difference. First operand has 200 places, 405 transitions, 5553 flow. Second operand 10 states and 246 transitions. [2024-06-27 22:12:18,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 462 transitions, 6759 flow [2024-06-27 22:12:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 462 transitions, 6498 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 22:12:19,058 INFO L231 Difference]: Finished difference. Result has 204 places, 407 transitions, 5490 flow [2024-06-27 22:12:19,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5292, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5490, PETRI_PLACES=204, PETRI_TRANSITIONS=407} [2024-06-27 22:12:19,058 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 151 predicate places. [2024-06-27 22:12:19,059 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 407 transitions, 5490 flow [2024-06-27 22:12:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:19,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:19,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:12:19,059 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:19,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -353376650, now seen corresponding path program 5 times [2024-06-27 22:12:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100882699] [2024-06-27 22:12:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100882699] [2024-06-27 22:12:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100882699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957079033] [2024-06-27 22:12:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:20,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:20,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 407 transitions, 5490 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:22,905 INFO L124 PetriNetUnfolderBase]: 5037/7960 cut-off events. [2024-06-27 22:12:22,905 INFO L125 PetriNetUnfolderBase]: For 229942/229946 co-relation queries the response was YES. [2024-06-27 22:12:22,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55413 conditions, 7960 events. 5037/7960 cut-off events. For 229942/229946 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 49559 event pairs, 1367 based on Foata normal form. 6/7815 useless extension candidates. Maximal degree in co-relation 55325. Up to 6629 conditions per place. [2024-06-27 22:12:22,986 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 253 selfloop transitions, 212 changer transitions 0/476 dead transitions. [2024-06-27 22:12:22,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 476 transitions, 7093 flow [2024-06-27 22:12:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2024-06-27 22:12:22,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340425531914894 [2024-06-27 22:12:22,988 INFO L175 Difference]: Start difference. First operand has 204 places, 407 transitions, 5490 flow. Second operand 10 states and 251 transitions. [2024-06-27 22:12:22,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 476 transitions, 7093 flow [2024-06-27 22:12:23,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 476 transitions, 6951 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:23,439 INFO L231 Difference]: Finished difference. Result has 209 places, 422 transitions, 6370 flow [2024-06-27 22:12:23,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5348, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6370, PETRI_PLACES=209, PETRI_TRANSITIONS=422} [2024-06-27 22:12:23,440 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 156 predicate places. [2024-06-27 22:12:23,440 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 422 transitions, 6370 flow [2024-06-27 22:12:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:23,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:23,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:12:23,441 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:23,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1371510600, now seen corresponding path program 1 times [2024-06-27 22:12:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:23,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533945530] [2024-06-27 22:12:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533945530] [2024-06-27 22:12:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533945530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:12:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247145111] [2024-06-27 22:12:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:24,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:12:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:12:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:12:24,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:12:24,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 422 transitions, 6370 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:24,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:24,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:12:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:26,401 INFO L124 PetriNetUnfolderBase]: 5370/8751 cut-off events. [2024-06-27 22:12:26,401 INFO L125 PetriNetUnfolderBase]: For 257815/257815 co-relation queries the response was YES. [2024-06-27 22:12:26,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60697 conditions, 8751 events. 5370/8751 cut-off events. For 257815/257815 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 56196 event pairs, 1566 based on Foata normal form. 2/8511 useless extension candidates. Maximal degree in co-relation 60606. Up to 7454 conditions per place. [2024-06-27 22:12:26,501 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 388 selfloop transitions, 71 changer transitions 0/468 dead transitions. [2024-06-27 22:12:26,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 468 transitions, 7758 flow [2024-06-27 22:12:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:12:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:12:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 22:12:26,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197568389057751 [2024-06-27 22:12:26,504 INFO L175 Difference]: Start difference. First operand has 209 places, 422 transitions, 6370 flow. Second operand 7 states and 171 transitions. [2024-06-27 22:12:26,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 468 transitions, 7758 flow [2024-06-27 22:12:27,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 468 transitions, 7522 flow, removed 113 selfloop flow, removed 2 redundant places. [2024-06-27 22:12:27,226 INFO L231 Difference]: Finished difference. Result has 215 places, 432 transitions, 6469 flow [2024-06-27 22:12:27,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6146, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6469, PETRI_PLACES=215, PETRI_TRANSITIONS=432} [2024-06-27 22:12:27,226 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 162 predicate places. [2024-06-27 22:12:27,227 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 432 transitions, 6469 flow [2024-06-27 22:12:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:27,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:27,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:27,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:12:27,227 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:27,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1099424802, now seen corresponding path program 7 times [2024-06-27 22:12:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:27,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416631078] [2024-06-27 22:12:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:28,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416631078] [2024-06-27 22:12:28,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416631078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:12:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120561411] [2024-06-27 22:12:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:28,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:12:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:12:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:12:28,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:12:28,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 432 transitions, 6469 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:28,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:28,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:12:28,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:30,608 INFO L124 PetriNetUnfolderBase]: 4806/7785 cut-off events. [2024-06-27 22:12:30,609 INFO L125 PetriNetUnfolderBase]: For 254223/254244 co-relation queries the response was YES. [2024-06-27 22:12:30,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58356 conditions, 7785 events. 4806/7785 cut-off events. For 254223/254244 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 50692 event pairs, 1087 based on Foata normal form. 9/7625 useless extension candidates. Maximal degree in co-relation 58262. Up to 6451 conditions per place. [2024-06-27 22:12:30,698 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 333 selfloop transitions, 153 changer transitions 0/521 dead transitions. [2024-06-27 22:12:30,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 521 transitions, 8497 flow [2024-06-27 22:12:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:12:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:12:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2024-06-27 22:12:30,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504835589941973 [2024-06-27 22:12:30,705 INFO L175 Difference]: Start difference. First operand has 215 places, 432 transitions, 6469 flow. Second operand 11 states and 261 transitions. [2024-06-27 22:12:30,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 521 transitions, 8497 flow [2024-06-27 22:12:31,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 521 transitions, 8448 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-27 22:12:31,243 INFO L231 Difference]: Finished difference. Result has 226 places, 482 transitions, 7808 flow [2024-06-27 22:12:31,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6420, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7808, PETRI_PLACES=226, PETRI_TRANSITIONS=482} [2024-06-27 22:12:31,244 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 173 predicate places. [2024-06-27 22:12:31,244 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 482 transitions, 7808 flow [2024-06-27 22:12:31,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:31,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:31,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:31,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:12:31,245 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:31,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1030895842, now seen corresponding path program 8 times [2024-06-27 22:12:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014260193] [2024-06-27 22:12:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014260193] [2024-06-27 22:12:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014260193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:12:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881731832] [2024-06-27 22:12:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:32,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:12:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:12:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:12:32,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:12:32,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 482 transitions, 7808 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:32,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:32,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:12:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:34,752 INFO L124 PetriNetUnfolderBase]: 5060/8195 cut-off events. [2024-06-27 22:12:34,752 INFO L125 PetriNetUnfolderBase]: For 292025/292037 co-relation queries the response was YES. [2024-06-27 22:12:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63143 conditions, 8195 events. 5060/8195 cut-off events. For 292025/292037 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 53813 event pairs, 1128 based on Foata normal form. 8/8021 useless extension candidates. Maximal degree in co-relation 63045. Up to 6816 conditions per place. [2024-06-27 22:12:34,883 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 435 selfloop transitions, 83 changer transitions 0/553 dead transitions. [2024-06-27 22:12:34,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 553 transitions, 9451 flow [2024-06-27 22:12:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:12:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:12:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 22:12:34,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153664302600472 [2024-06-27 22:12:34,904 INFO L175 Difference]: Start difference. First operand has 226 places, 482 transitions, 7808 flow. Second operand 9 states and 218 transitions. [2024-06-27 22:12:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 553 transitions, 9451 flow [2024-06-27 22:12:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 553 transitions, 9143 flow, removed 127 selfloop flow, removed 4 redundant places. [2024-06-27 22:12:35,778 INFO L231 Difference]: Finished difference. Result has 232 places, 516 transitions, 8234 flow [2024-06-27 22:12:35,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7500, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8234, PETRI_PLACES=232, PETRI_TRANSITIONS=516} [2024-06-27 22:12:35,779 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 179 predicate places. [2024-06-27 22:12:35,779 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 516 transitions, 8234 flow [2024-06-27 22:12:35,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:35,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:35,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:35,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:12:35,780 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:35,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1866156800, now seen corresponding path program 9 times [2024-06-27 22:12:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126911549] [2024-06-27 22:12:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126911549] [2024-06-27 22:12:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126911549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:37,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:12:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538157342] [2024-06-27 22:12:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:37,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:12:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:12:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:12:37,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:12:37,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 516 transitions, 8234 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:37,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:37,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:12:37,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:39,525 INFO L124 PetriNetUnfolderBase]: 5140/8323 cut-off events. [2024-06-27 22:12:39,525 INFO L125 PetriNetUnfolderBase]: For 308614/308626 co-relation queries the response was YES. [2024-06-27 22:12:39,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64860 conditions, 8323 events. 5140/8323 cut-off events. For 308614/308626 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 54764 event pairs, 1153 based on Foata normal form. 12/8153 useless extension candidates. Maximal degree in co-relation 64760. Up to 6951 conditions per place. [2024-06-27 22:12:39,651 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 411 selfloop transitions, 110 changer transitions 0/556 dead transitions. [2024-06-27 22:12:39,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 556 transitions, 9555 flow [2024-06-27 22:12:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:12:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:12:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:12:39,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2024-06-27 22:12:39,653 INFO L175 Difference]: Start difference. First operand has 232 places, 516 transitions, 8234 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:12:39,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 556 transitions, 9555 flow [2024-06-27 22:12:40,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 556 transitions, 9340 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-06-27 22:12:40,775 INFO L231 Difference]: Finished difference. Result has 234 places, 522 transitions, 8407 flow [2024-06-27 22:12:40,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8019, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8407, PETRI_PLACES=234, PETRI_TRANSITIONS=522} [2024-06-27 22:12:40,776 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 181 predicate places. [2024-06-27 22:12:40,776 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 522 transitions, 8407 flow [2024-06-27 22:12:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:40,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:40,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:40,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:12:40,777 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:40,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1036621294, now seen corresponding path program 6 times [2024-06-27 22:12:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428933688] [2024-06-27 22:12:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428933688] [2024-06-27 22:12:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428933688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22687024] [2024-06-27 22:12:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:42,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:42,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 522 transitions, 8407 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:42,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:42,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:42,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:44,717 INFO L124 PetriNetUnfolderBase]: 5961/9318 cut-off events. [2024-06-27 22:12:44,717 INFO L125 PetriNetUnfolderBase]: For 324219/324231 co-relation queries the response was YES. [2024-06-27 22:12:44,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71070 conditions, 9318 events. 5961/9318 cut-off events. For 324219/324231 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 58900 event pairs, 1314 based on Foata normal form. 6/9167 useless extension candidates. Maximal degree in co-relation 70969. Up to 7949 conditions per place. [2024-06-27 22:12:44,841 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 377 selfloop transitions, 237 changer transitions 0/628 dead transitions. [2024-06-27 22:12:44,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 628 transitions, 11250 flow [2024-06-27 22:12:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 243 transitions. [2024-06-27 22:12:44,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170212765957447 [2024-06-27 22:12:44,842 INFO L175 Difference]: Start difference. First operand has 234 places, 522 transitions, 8407 flow. Second operand 10 states and 243 transitions. [2024-06-27 22:12:44,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 628 transitions, 11250 flow [2024-06-27 22:12:45,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 628 transitions, 10917 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-06-27 22:12:45,832 INFO L231 Difference]: Finished difference. Result has 241 places, 577 transitions, 10057 flow [2024-06-27 22:12:45,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8079, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10057, PETRI_PLACES=241, PETRI_TRANSITIONS=577} [2024-06-27 22:12:45,834 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 188 predicate places. [2024-06-27 22:12:45,834 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 577 transitions, 10057 flow [2024-06-27 22:12:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:45,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:45,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:12:45,835 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:45,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1866364562, now seen corresponding path program 7 times [2024-06-27 22:12:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949767390] [2024-06-27 22:12:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:47,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949767390] [2024-06-27 22:12:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949767390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:47,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:47,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023824174] [2024-06-27 22:12:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:47,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:47,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:47,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:47,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 577 transitions, 10057 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:47,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:47,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:47,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:50,187 INFO L124 PetriNetUnfolderBase]: 6002/9357 cut-off events. [2024-06-27 22:12:50,187 INFO L125 PetriNetUnfolderBase]: For 342801/342813 co-relation queries the response was YES. [2024-06-27 22:12:50,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73736 conditions, 9357 events. 6002/9357 cut-off events. For 342801/342813 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 59014 event pairs, 1369 based on Foata normal form. 6/9211 useless extension candidates. Maximal degree in co-relation 73631. Up to 8232 conditions per place. [2024-06-27 22:12:50,293 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 489 selfloop transitions, 123 changer transitions 0/626 dead transitions. [2024-06-27 22:12:50,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 626 transitions, 11652 flow [2024-06-27 22:12:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:12:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:12:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:12:50,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 22:12:50,295 INFO L175 Difference]: Start difference. First operand has 241 places, 577 transitions, 10057 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:12:50,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 626 transitions, 11652 flow [2024-06-27 22:12:51,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 626 transitions, 11298 flow, removed 119 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:51,421 INFO L231 Difference]: Finished difference. Result has 244 places, 585 transitions, 10179 flow [2024-06-27 22:12:51,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9715, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10179, PETRI_PLACES=244, PETRI_TRANSITIONS=585} [2024-06-27 22:12:51,431 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 191 predicate places. [2024-06-27 22:12:51,431 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 585 transitions, 10179 flow [2024-06-27 22:12:51,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:51,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:51,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:51,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:12:51,432 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:51,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1036412044, now seen corresponding path program 8 times [2024-06-27 22:12:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461645335] [2024-06-27 22:12:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:51,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461645335] [2024-06-27 22:12:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461645335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782839494] [2024-06-27 22:12:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:53,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:53,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:53,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:53,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:53,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 585 transitions, 10179 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:53,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:53,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:56,065 INFO L124 PetriNetUnfolderBase]: 6002/9361 cut-off events. [2024-06-27 22:12:56,066 INFO L125 PetriNetUnfolderBase]: For 343735/343747 co-relation queries the response was YES. [2024-06-27 22:12:56,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73980 conditions, 9361 events. 6002/9361 cut-off events. For 343735/343747 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 59136 event pairs, 1376 based on Foata normal form. 6/9214 useless extension candidates. Maximal degree in co-relation 73875. Up to 8232 conditions per place. [2024-06-27 22:12:56,195 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 496 selfloop transitions, 119 changer transitions 0/629 dead transitions. [2024-06-27 22:12:56,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 629 transitions, 11719 flow [2024-06-27 22:12:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:12:56,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-06-27 22:12:56,196 INFO L175 Difference]: Start difference. First operand has 244 places, 585 transitions, 10179 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:12:56,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 629 transitions, 11719 flow [2024-06-27 22:12:57,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 629 transitions, 11461 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-27 22:12:57,297 INFO L231 Difference]: Finished difference. Result has 250 places, 588 transitions, 10290 flow [2024-06-27 22:12:57,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9943, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10290, PETRI_PLACES=250, PETRI_TRANSITIONS=588} [2024-06-27 22:12:57,298 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 197 predicate places. [2024-06-27 22:12:57,298 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 588 transitions, 10290 flow [2024-06-27 22:12:57,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:57,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:57,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:12:57,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:12:57,298 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:12:57,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash -983024421, now seen corresponding path program 2 times [2024-06-27 22:12:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347920014] [2024-06-27 22:12:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:59,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347920014] [2024-06-27 22:12:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347920014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485454675] [2024-06-27 22:12:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:59,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:59,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:12:59,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 588 transitions, 10290 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:59,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:59,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:12:59,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:01,564 INFO L124 PetriNetUnfolderBase]: 6313/9842 cut-off events. [2024-06-27 22:13:01,564 INFO L125 PetriNetUnfolderBase]: For 394371/394383 co-relation queries the response was YES. [2024-06-27 22:13:01,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78937 conditions, 9842 events. 6313/9842 cut-off events. For 394371/394383 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 62569 event pairs, 1394 based on Foata normal form. 24/9709 useless extension candidates. Maximal degree in co-relation 78831. Up to 8309 conditions per place. [2024-06-27 22:13:01,707 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 518 selfloop transitions, 125 changer transitions 0/657 dead transitions. [2024-06-27 22:13:01,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 657 transitions, 12327 flow [2024-06-27 22:13:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-27 22:13:01,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541371158392435 [2024-06-27 22:13:01,711 INFO L175 Difference]: Start difference. First operand has 250 places, 588 transitions, 10290 flow. Second operand 9 states and 229 transitions. [2024-06-27 22:13:01,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 657 transitions, 12327 flow [2024-06-27 22:13:02,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 657 transitions, 12019 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 22:13:02,801 INFO L231 Difference]: Finished difference. Result has 252 places, 600 transitions, 10606 flow [2024-06-27 22:13:02,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9982, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10606, PETRI_PLACES=252, PETRI_TRANSITIONS=600} [2024-06-27 22:13:02,802 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 199 predicate places. [2024-06-27 22:13:02,802 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 600 transitions, 10606 flow [2024-06-27 22:13:02,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:02,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:02,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:02,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:13:02,802 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:02,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -592562972, now seen corresponding path program 2 times [2024-06-27 22:13:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457654896] [2024-06-27 22:13:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457654896] [2024-06-27 22:13:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457654896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:13:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895669268] [2024-06-27 22:13:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:04,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:13:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:13:04,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:13:04,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:13:04,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 600 transitions, 10606 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:04,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:04,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:13:04,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:06,513 INFO L124 PetriNetUnfolderBase]: 6681/10766 cut-off events. [2024-06-27 22:13:06,513 INFO L125 PetriNetUnfolderBase]: For 415389/415389 co-relation queries the response was YES. [2024-06-27 22:13:06,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84135 conditions, 10766 events. 6681/10766 cut-off events. For 415389/415389 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 70856 event pairs, 1519 based on Foata normal form. 2/10497 useless extension candidates. Maximal degree in co-relation 84027. Up to 9283 conditions per place. [2024-06-27 22:13:06,634 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 544 selfloop transitions, 85 changer transitions 0/638 dead transitions. [2024-06-27 22:13:06,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 638 transitions, 12314 flow [2024-06-27 22:13:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:13:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:13:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 22:13:06,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 22:13:06,636 INFO L175 Difference]: Start difference. First operand has 252 places, 600 transitions, 10606 flow. Second operand 6 states and 148 transitions. [2024-06-27 22:13:06,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 638 transitions, 12314 flow [2024-06-27 22:13:07,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 638 transitions, 12180 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 22:13:07,724 INFO L231 Difference]: Finished difference. Result has 254 places, 609 transitions, 10781 flow [2024-06-27 22:13:07,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=10472, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10781, PETRI_PLACES=254, PETRI_TRANSITIONS=609} [2024-06-27 22:13:07,725 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 201 predicate places. [2024-06-27 22:13:07,725 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 609 transitions, 10781 flow [2024-06-27 22:13:07,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:07,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:07,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:13:07,726 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:07,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1671960862, now seen corresponding path program 10 times [2024-06-27 22:13:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147735665] [2024-06-27 22:13:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147735665] [2024-06-27 22:13:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147735665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:09,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:13:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266347356] [2024-06-27 22:13:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:09,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:13:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:13:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:13:09,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:13:09,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 609 transitions, 10781 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:09,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:09,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:13:09,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:11,936 INFO L124 PetriNetUnfolderBase]: 5669/9231 cut-off events. [2024-06-27 22:13:11,937 INFO L125 PetriNetUnfolderBase]: For 407442/407454 co-relation queries the response was YES. [2024-06-27 22:13:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77604 conditions, 9231 events. 5669/9231 cut-off events. For 407442/407454 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 62269 event pairs, 1230 based on Foata normal form. 12/9012 useless extension candidates. Maximal degree in co-relation 77493. Up to 7589 conditions per place. [2024-06-27 22:13:12,076 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 431 selfloop transitions, 168 changer transitions 0/645 dead transitions. [2024-06-27 22:13:12,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 645 transitions, 12249 flow [2024-06-27 22:13:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:13:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:13:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-27 22:13:12,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5398936170212766 [2024-06-27 22:13:12,078 INFO L175 Difference]: Start difference. First operand has 254 places, 609 transitions, 10781 flow. Second operand 8 states and 203 transitions. [2024-06-27 22:13:12,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 645 transitions, 12249 flow [2024-06-27 22:13:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 645 transitions, 12164 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:13:13,370 INFO L231 Difference]: Finished difference. Result has 260 places, 612 transitions, 11188 flow [2024-06-27 22:13:13,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=10696, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11188, PETRI_PLACES=260, PETRI_TRANSITIONS=612} [2024-06-27 22:13:13,371 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 207 predicate places. [2024-06-27 22:13:13,371 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 612 transitions, 11188 flow [2024-06-27 22:13:13,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:13,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:13,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:13,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:13:13,375 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:13,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1059552996, now seen corresponding path program 9 times [2024-06-27 22:13:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:13,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092427004] [2024-06-27 22:13:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092427004] [2024-06-27 22:13:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092427004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:15,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078480919] [2024-06-27 22:13:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:15,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:15,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:15,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 612 transitions, 11188 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:15,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:15,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:15,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:17,899 INFO L124 PetriNetUnfolderBase]: 6392/10042 cut-off events. [2024-06-27 22:13:17,899 INFO L125 PetriNetUnfolderBase]: For 422709/422721 co-relation queries the response was YES. [2024-06-27 22:13:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82316 conditions, 10042 events. 6392/10042 cut-off events. For 422709/422721 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 64783 event pairs, 1404 based on Foata normal form. 6/9861 useless extension candidates. Maximal degree in co-relation 82203. Up to 8278 conditions per place. [2024-06-27 22:13:18,007 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 462 selfloop transitions, 253 changer transitions 0/732 dead transitions. [2024-06-27 22:13:18,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 732 transitions, 14637 flow [2024-06-27 22:13:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-06-27 22:13:18,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2024-06-27 22:13:18,009 INFO L175 Difference]: Start difference. First operand has 260 places, 612 transitions, 11188 flow. Second operand 10 states and 238 transitions. [2024-06-27 22:13:18,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 732 transitions, 14637 flow [2024-06-27 22:13:18,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 732 transitions, 14164 flow, removed 68 selfloop flow, removed 6 redundant places. [2024-06-27 22:13:19,005 INFO L231 Difference]: Finished difference. Result has 267 places, 687 transitions, 13149 flow [2024-06-27 22:13:19,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=10720, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13149, PETRI_PLACES=267, PETRI_TRANSITIONS=687} [2024-06-27 22:13:19,006 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 214 predicate places. [2024-06-27 22:13:19,006 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 687 transitions, 13149 flow [2024-06-27 22:13:19,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:19,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:19,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:19,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:13:19,007 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:19,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1415252590, now seen corresponding path program 10 times [2024-06-27 22:13:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063703021] [2024-06-27 22:13:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063703021] [2024-06-27 22:13:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063703021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236931988] [2024-06-27 22:13:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:20,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:20,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 687 transitions, 13149 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:20,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:20,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:20,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:23,644 INFO L124 PetriNetUnfolderBase]: 6433/10110 cut-off events. [2024-06-27 22:13:23,644 INFO L125 PetriNetUnfolderBase]: For 439270/439282 co-relation queries the response was YES. [2024-06-27 22:13:23,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84844 conditions, 10110 events. 6433/10110 cut-off events. For 439270/439282 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 65236 event pairs, 1429 based on Foata normal form. 6/9928 useless extension candidates. Maximal degree in co-relation 84727. Up to 8617 conditions per place. [2024-06-27 22:13:23,784 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 529 selfloop transitions, 191 changer transitions 0/737 dead transitions. [2024-06-27 22:13:23,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 737 transitions, 15072 flow [2024-06-27 22:13:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-06-27 22:13:23,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:13:23,786 INFO L175 Difference]: Start difference. First operand has 267 places, 687 transitions, 13149 flow. Second operand 10 states and 235 transitions. [2024-06-27 22:13:23,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 737 transitions, 15072 flow [2024-06-27 22:13:25,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 737 transitions, 14764 flow, removed 123 selfloop flow, removed 4 redundant places. [2024-06-27 22:13:25,252 INFO L231 Difference]: Finished difference. Result has 273 places, 697 transitions, 13546 flow [2024-06-27 22:13:25,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=12859, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13546, PETRI_PLACES=273, PETRI_TRANSITIONS=697} [2024-06-27 22:13:25,253 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 220 predicate places. [2024-06-27 22:13:25,253 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 697 transitions, 13546 flow [2024-06-27 22:13:25,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:25,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:25,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:25,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:13:25,254 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:25,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753100, now seen corresponding path program 11 times [2024-06-27 22:13:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150150905] [2024-06-27 22:13:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150150905] [2024-06-27 22:13:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150150905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064288402] [2024-06-27 22:13:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:27,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 697 transitions, 13546 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:27,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:27,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:29,553 INFO L124 PetriNetUnfolderBase]: 6474/10178 cut-off events. [2024-06-27 22:13:29,554 INFO L125 PetriNetUnfolderBase]: For 452039/452051 co-relation queries the response was YES. [2024-06-27 22:13:29,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86379 conditions, 10178 events. 6474/10178 cut-off events. For 452039/452051 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 65791 event pairs, 1403 based on Foata normal form. 6/9995 useless extension candidates. Maximal degree in co-relation 86261. Up to 8668 conditions per place. [2024-06-27 22:13:29,695 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 548 selfloop transitions, 182 changer transitions 0/747 dead transitions. [2024-06-27 22:13:29,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 747 transitions, 15491 flow [2024-06-27 22:13:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:13:29,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042553191489362 [2024-06-27 22:13:29,702 INFO L175 Difference]: Start difference. First operand has 273 places, 697 transitions, 13546 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:13:29,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 747 transitions, 15491 flow [2024-06-27 22:13:31,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 747 transitions, 14930 flow, removed 91 selfloop flow, removed 6 redundant places. [2024-06-27 22:13:31,033 INFO L231 Difference]: Finished difference. Result has 277 places, 707 transitions, 13674 flow [2024-06-27 22:13:31,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=12993, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13674, PETRI_PLACES=277, PETRI_TRANSITIONS=707} [2024-06-27 22:13:31,034 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 224 predicate places. [2024-06-27 22:13:31,034 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 707 transitions, 13674 flow [2024-06-27 22:13:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:31,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:31,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:31,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:13:31,035 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:31,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1671745660, now seen corresponding path program 12 times [2024-06-27 22:13:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:31,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047370577] [2024-06-27 22:13:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:33,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:33,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047370577] [2024-06-27 22:13:33,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047370577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:33,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:33,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:33,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259659061] [2024-06-27 22:13:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:33,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:33,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:33,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:33,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 707 transitions, 13674 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:33,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:33,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:35,830 INFO L124 PetriNetUnfolderBase]: 6540/10289 cut-off events. [2024-06-27 22:13:35,830 INFO L125 PetriNetUnfolderBase]: For 486071/486083 co-relation queries the response was YES. [2024-06-27 22:13:36,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88730 conditions, 10289 events. 6540/10289 cut-off events. For 486071/486083 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 66745 event pairs, 1368 based on Foata normal form. 6/10104 useless extension candidates. Maximal degree in co-relation 88611. Up to 8554 conditions per place. [2024-06-27 22:13:36,220 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 450 selfloop transitions, 307 changer transitions 0/774 dead transitions. [2024-06-27 22:13:36,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 774 transitions, 16466 flow [2024-06-27 22:13:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 22:13:36,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-06-27 22:13:36,224 INFO L175 Difference]: Start difference. First operand has 277 places, 707 transitions, 13674 flow. Second operand 10 states and 245 transitions. [2024-06-27 22:13:36,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 774 transitions, 16466 flow [2024-06-27 22:13:37,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 774 transitions, 15862 flow, removed 93 selfloop flow, removed 6 redundant places. [2024-06-27 22:13:37,446 INFO L231 Difference]: Finished difference. Result has 282 places, 726 transitions, 14619 flow [2024-06-27 22:13:37,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13070, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14619, PETRI_PLACES=282, PETRI_TRANSITIONS=726} [2024-06-27 22:13:37,447 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 229 predicate places. [2024-06-27 22:13:37,447 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 726 transitions, 14619 flow [2024-06-27 22:13:37,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:37,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:37,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:37,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:13:37,447 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:37,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1671745381, now seen corresponding path program 3 times [2024-06-27 22:13:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15990218] [2024-06-27 22:13:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:39,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15990218] [2024-06-27 22:13:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15990218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:39,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229754940] [2024-06-27 22:13:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:39,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:39,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:39,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 726 transitions, 14619 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:39,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:39,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:42,004 INFO L124 PetriNetUnfolderBase]: 6582/10359 cut-off events. [2024-06-27 22:13:42,005 INFO L125 PetriNetUnfolderBase]: For 518291/518303 co-relation queries the response was YES. [2024-06-27 22:13:42,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91080 conditions, 10359 events. 6582/10359 cut-off events. For 518291/518303 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 67328 event pairs, 1414 based on Foata normal form. 8/10174 useless extension candidates. Maximal degree in co-relation 90959. Up to 8945 conditions per place. [2024-06-27 22:13:42,163 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 615 selfloop transitions, 142 changer transitions 0/774 dead transitions. [2024-06-27 22:13:42,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 774 transitions, 16504 flow [2024-06-27 22:13:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:13:42,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-06-27 22:13:42,165 INFO L175 Difference]: Start difference. First operand has 282 places, 726 transitions, 14619 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:13:42,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 774 transitions, 16504 flow [2024-06-27 22:13:43,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 774 transitions, 15707 flow, removed 261 selfloop flow, removed 4 redundant places. [2024-06-27 22:13:43,912 INFO L231 Difference]: Finished difference. Result has 289 places, 731 transitions, 14276 flow [2024-06-27 22:13:43,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13822, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14276, PETRI_PLACES=289, PETRI_TRANSITIONS=731} [2024-06-27 22:13:43,913 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 236 predicate places. [2024-06-27 22:13:43,913 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 731 transitions, 14276 flow [2024-06-27 22:13:43,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:43,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:43,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:43,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:13:43,914 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:43,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1671954910, now seen corresponding path program 13 times [2024-06-27 22:13:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89558170] [2024-06-27 22:13:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89558170] [2024-06-27 22:13:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89558170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:46,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054812169] [2024-06-27 22:13:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:46,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:46,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:46,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 731 transitions, 14276 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:46,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:46,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:46,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:49,314 INFO L124 PetriNetUnfolderBase]: 6582/10359 cut-off events. [2024-06-27 22:13:49,314 INFO L125 PetriNetUnfolderBase]: For 500586/500598 co-relation queries the response was YES. [2024-06-27 22:13:49,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90382 conditions, 10359 events. 6582/10359 cut-off events. For 500586/500598 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 67337 event pairs, 1431 based on Foata normal form. 6/10172 useless extension candidates. Maximal degree in co-relation 90258. Up to 8822 conditions per place. [2024-06-27 22:13:49,470 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 574 selfloop transitions, 183 changer transitions 0/774 dead transitions. [2024-06-27 22:13:49,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 774 transitions, 16089 flow [2024-06-27 22:13:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:13:49,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-06-27 22:13:49,471 INFO L175 Difference]: Start difference. First operand has 289 places, 731 transitions, 14276 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:13:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 774 transitions, 16089 flow [2024-06-27 22:13:50,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 774 transitions, 15585 flow, removed 116 selfloop flow, removed 6 redundant places. [2024-06-27 22:13:50,941 INFO L231 Difference]: Finished difference. Result has 293 places, 734 transitions, 14271 flow [2024-06-27 22:13:50,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13828, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14271, PETRI_PLACES=293, PETRI_TRANSITIONS=734} [2024-06-27 22:13:50,942 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 240 predicate places. [2024-06-27 22:13:50,942 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 734 transitions, 14271 flow [2024-06-27 22:13:50,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:50,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:50,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:13:50,943 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:50,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1415244871, now seen corresponding path program 4 times [2024-06-27 22:13:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265089122] [2024-06-27 22:13:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:52,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265089122] [2024-06-27 22:13:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265089122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:52,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162452155] [2024-06-27 22:13:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:52,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:52,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:52,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:52,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 734 transitions, 14271 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:52,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:52,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:52,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:55,576 INFO L124 PetriNetUnfolderBase]: 6624/10429 cut-off events. [2024-06-27 22:13:55,576 INFO L125 PetriNetUnfolderBase]: For 511745/511757 co-relation queries the response was YES. [2024-06-27 22:13:55,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90941 conditions, 10429 events. 6624/10429 cut-off events. For 511745/511757 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 67796 event pairs, 1441 based on Foata normal form. 8/10242 useless extension candidates. Maximal degree in co-relation 90816. Up to 9007 conditions per place. [2024-06-27 22:13:55,747 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 613 selfloop transitions, 152 changer transitions 0/782 dead transitions. [2024-06-27 22:13:55,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 782 transitions, 16169 flow [2024-06-27 22:13:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-06-27 22:13:55,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-06-27 22:13:55,748 INFO L175 Difference]: Start difference. First operand has 293 places, 734 transitions, 14271 flow. Second operand 10 states and 236 transitions. [2024-06-27 22:13:55,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 782 transitions, 16169 flow [2024-06-27 22:13:57,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 782 transitions, 15780 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 22:13:57,315 INFO L231 Difference]: Finished difference. Result has 296 places, 739 transitions, 14353 flow [2024-06-27 22:13:57,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13882, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14353, PETRI_PLACES=296, PETRI_TRANSITIONS=739} [2024-06-27 22:13:57,315 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 243 predicate places. [2024-06-27 22:13:57,316 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 739 transitions, 14353 flow [2024-06-27 22:13:57,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:57,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:57,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:57,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:13:57,316 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:13:57,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1406048101, now seen corresponding path program 5 times [2024-06-27 22:13:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996891928] [2024-06-27 22:13:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996891928] [2024-06-27 22:13:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996891928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075908381] [2024-06-27 22:13:58,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:59,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:13:59,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 739 transitions, 14353 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:59,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:59,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:13:59,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:02,070 INFO L124 PetriNetUnfolderBase]: 6741/10638 cut-off events. [2024-06-27 22:14:02,071 INFO L125 PetriNetUnfolderBase]: For 556854/556893 co-relation queries the response was YES. [2024-06-27 22:14:02,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93548 conditions, 10638 events. 6741/10638 cut-off events. For 556854/556893 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 69714 event pairs, 1907 based on Foata normal form. 12/10427 useless extension candidates. Maximal degree in co-relation 93421. Up to 9219 conditions per place. [2024-06-27 22:14:02,258 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 619 selfloop transitions, 152 changer transitions 0/788 dead transitions. [2024-06-27 22:14:02,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 788 transitions, 16232 flow [2024-06-27 22:14:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-27 22:14:02,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042553191489362 [2024-06-27 22:14:02,260 INFO L175 Difference]: Start difference. First operand has 296 places, 739 transitions, 14353 flow. Second operand 10 states and 237 transitions. [2024-06-27 22:14:02,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 788 transitions, 16232 flow [2024-06-27 22:14:04,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 788 transitions, 15988 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:04,052 INFO L231 Difference]: Finished difference. Result has 301 places, 741 transitions, 14529 flow [2024-06-27 22:14:04,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14109, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14529, PETRI_PLACES=301, PETRI_TRANSITIONS=741} [2024-06-27 22:14:04,053 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 248 predicate places. [2024-06-27 22:14:04,053 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 741 transitions, 14529 flow [2024-06-27 22:14:04,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:04,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:04,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:14:04,054 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:04,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:04,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1059226287, now seen corresponding path program 6 times [2024-06-27 22:14:04,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:04,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241999876] [2024-06-27 22:14:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:05,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241999876] [2024-06-27 22:14:05,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241999876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:05,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:05,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:05,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712515840] [2024-06-27 22:14:05,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:05,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:06,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:06,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 741 transitions, 14529 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:06,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:06,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:06,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:09,129 INFO L124 PetriNetUnfolderBase]: 6773/10706 cut-off events. [2024-06-27 22:14:09,129 INFO L125 PetriNetUnfolderBase]: For 572231/572270 co-relation queries the response was YES. [2024-06-27 22:14:09,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94372 conditions, 10706 events. 6773/10706 cut-off events. For 572231/572270 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 70454 event pairs, 1827 based on Foata normal form. 12/10489 useless extension candidates. Maximal degree in co-relation 94244. Up to 9006 conditions per place. [2024-06-27 22:14:09,295 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 614 selfloop transitions, 166 changer transitions 0/797 dead transitions. [2024-06-27 22:14:09,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 797 transitions, 16664 flow [2024-06-27 22:14:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-06-27 22:14:09,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2024-06-27 22:14:09,297 INFO L175 Difference]: Start difference. First operand has 301 places, 741 transitions, 14529 flow. Second operand 10 states and 238 transitions. [2024-06-27 22:14:09,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 797 transitions, 16664 flow [2024-06-27 22:14:11,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 797 transitions, 16292 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:11,476 INFO L231 Difference]: Finished difference. Result has 304 places, 748 transitions, 14845 flow [2024-06-27 22:14:11,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14157, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14845, PETRI_PLACES=304, PETRI_TRANSITIONS=748} [2024-06-27 22:14:11,477 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 251 predicate places. [2024-06-27 22:14:11,477 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 748 transitions, 14845 flow [2024-06-27 22:14:11,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:11,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:11,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:11,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:14:11,478 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:11,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1068749766, now seen corresponding path program 14 times [2024-06-27 22:14:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276256159] [2024-06-27 22:14:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276256159] [2024-06-27 22:14:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276256159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972038992] [2024-06-27 22:14:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:13,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:13,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 748 transitions, 14845 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:13,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:13,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:16,497 INFO L124 PetriNetUnfolderBase]: 6690/10543 cut-off events. [2024-06-27 22:14:16,497 INFO L125 PetriNetUnfolderBase]: For 556815/556827 co-relation queries the response was YES. [2024-06-27 22:14:16,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93968 conditions, 10543 events. 6690/10543 cut-off events. For 556815/556827 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 68794 event pairs, 1384 based on Foata normal form. 6/10350 useless extension candidates. Maximal degree in co-relation 93838. Up to 8789 conditions per place. [2024-06-27 22:14:16,897 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 451 selfloop transitions, 334 changer transitions 0/802 dead transitions. [2024-06-27 22:14:16,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 802 transitions, 16969 flow [2024-06-27 22:14:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-06-27 22:14:16,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2024-06-27 22:14:16,898 INFO L175 Difference]: Start difference. First operand has 304 places, 748 transitions, 14845 flow. Second operand 10 states and 242 transitions. [2024-06-27 22:14:16,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 802 transitions, 16969 flow [2024-06-27 22:14:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 802 transitions, 16037 flow, removed 376 selfloop flow, removed 6 redundant places. [2024-06-27 22:14:18,553 INFO L231 Difference]: Finished difference. Result has 308 places, 756 transitions, 14969 flow [2024-06-27 22:14:18,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13953, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14969, PETRI_PLACES=308, PETRI_TRANSITIONS=756} [2024-06-27 22:14:18,554 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 255 predicate places. [2024-06-27 22:14:18,554 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 756 transitions, 14969 flow [2024-06-27 22:14:18,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:18,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:18,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:18,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:14:18,555 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:18,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2113962066, now seen corresponding path program 3 times [2024-06-27 22:14:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482618173] [2024-06-27 22:14:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482618173] [2024-06-27 22:14:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482618173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:19,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053590059] [2024-06-27 22:14:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:19,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:14:19,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 756 transitions, 14969 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:19,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:19,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:14:19,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:22,725 INFO L124 PetriNetUnfolderBase]: 6975/11287 cut-off events. [2024-06-27 22:14:22,725 INFO L125 PetriNetUnfolderBase]: For 563468/563468 co-relation queries the response was YES. [2024-06-27 22:14:22,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96214 conditions, 11287 events. 6975/11287 cut-off events. For 563468/563468 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 75296 event pairs, 1498 based on Foata normal form. 2/10992 useless extension candidates. Maximal degree in co-relation 96082. Up to 9707 conditions per place. [2024-06-27 22:14:22,881 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 674 selfloop transitions, 94 changer transitions 0/777 dead transitions. [2024-06-27 22:14:22,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 777 transitions, 16698 flow [2024-06-27 22:14:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 22:14:22,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-06-27 22:14:22,883 INFO L175 Difference]: Start difference. First operand has 308 places, 756 transitions, 14969 flow. Second operand 6 states and 142 transitions. [2024-06-27 22:14:22,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 777 transitions, 16698 flow [2024-06-27 22:14:25,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 777 transitions, 15455 flow, removed 506 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:25,014 INFO L231 Difference]: Finished difference. Result has 310 places, 756 transitions, 13925 flow [2024-06-27 22:14:25,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13726, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13925, PETRI_PLACES=310, PETRI_TRANSITIONS=756} [2024-06-27 22:14:25,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 257 predicate places. [2024-06-27 22:14:25,015 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 756 transitions, 13925 flow [2024-06-27 22:14:25,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:25,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:25,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:25,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:14:25,015 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:25,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -66378115, now seen corresponding path program 1 times [2024-06-27 22:14:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747547420] [2024-06-27 22:14:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747547420] [2024-06-27 22:14:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747547420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330174063] [2024-06-27 22:14:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:26,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:26,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:26,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 756 transitions, 13925 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:26,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:26,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:26,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:28,791 INFO L124 PetriNetUnfolderBase]: 6467/10644 cut-off events. [2024-06-27 22:14:28,791 INFO L125 PetriNetUnfolderBase]: For 498946/498946 co-relation queries the response was YES. [2024-06-27 22:14:28,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88756 conditions, 10644 events. 6467/10644 cut-off events. For 498946/498946 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 72457 event pairs, 2222 based on Foata normal form. 1/10387 useless extension candidates. Maximal degree in co-relation 88621. Up to 9246 conditions per place. [2024-06-27 22:14:28,953 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 753 selfloop transitions, 23 changer transitions 0/786 dead transitions. [2024-06-27 22:14:28,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 786 transitions, 15872 flow [2024-06-27 22:14:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 22:14:28,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47416413373860183 [2024-06-27 22:14:28,955 INFO L175 Difference]: Start difference. First operand has 310 places, 756 transitions, 13925 flow. Second operand 7 states and 156 transitions. [2024-06-27 22:14:28,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 786 transitions, 15872 flow [2024-06-27 22:14:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 786 transitions, 15719 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:31,014 INFO L231 Difference]: Finished difference. Result has 315 places, 768 transitions, 14070 flow [2024-06-27 22:14:31,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13774, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14070, PETRI_PLACES=315, PETRI_TRANSITIONS=768} [2024-06-27 22:14:31,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 262 predicate places. [2024-06-27 22:14:31,015 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 768 transitions, 14070 flow [2024-06-27 22:14:31,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:31,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:31,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:14:31,016 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:31,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 822085541, now seen corresponding path program 2 times [2024-06-27 22:14:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097051479] [2024-06-27 22:14:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:31,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:31,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097051479] [2024-06-27 22:14:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097051479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130644552] [2024-06-27 22:14:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:32,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:32,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 768 transitions, 14070 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:32,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:32,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:32,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:34,583 INFO L124 PetriNetUnfolderBase]: 6464/10639 cut-off events. [2024-06-27 22:14:34,584 INFO L125 PetriNetUnfolderBase]: For 510355/510355 co-relation queries the response was YES. [2024-06-27 22:14:34,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89596 conditions, 10639 events. 6464/10639 cut-off events. For 510355/510355 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 72392 event pairs, 2219 based on Foata normal form. 1/10382 useless extension candidates. Maximal degree in co-relation 89458. Up to 9263 conditions per place. [2024-06-27 22:14:34,759 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 756 selfloop transitions, 16 changer transitions 0/782 dead transitions. [2024-06-27 22:14:34,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 782 transitions, 15668 flow [2024-06-27 22:14:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-27 22:14:34,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858156028368794 [2024-06-27 22:14:34,761 INFO L175 Difference]: Start difference. First operand has 315 places, 768 transitions, 14070 flow. Second operand 6 states and 137 transitions. [2024-06-27 22:14:34,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 782 transitions, 15668 flow [2024-06-27 22:14:36,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 782 transitions, 15509 flow, removed 77 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:36,901 INFO L231 Difference]: Finished difference. Result has 319 places, 768 transitions, 13950 flow [2024-06-27 22:14:36,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13911, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13950, PETRI_PLACES=319, PETRI_TRANSITIONS=768} [2024-06-27 22:14:36,902 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 266 predicate places. [2024-06-27 22:14:36,902 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 768 transitions, 13950 flow [2024-06-27 22:14:36,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:36,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:36,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:36,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:14:36,903 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:36,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash -193611185, now seen corresponding path program 1 times [2024-06-27 22:14:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239704179] [2024-06-27 22:14:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:38,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:38,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239704179] [2024-06-27 22:14:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239704179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249262673] [2024-06-27 22:14:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:38,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:38,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:38,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:38,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:14:38,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 768 transitions, 13950 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:38,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:38,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:14:38,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:41,865 INFO L124 PetriNetUnfolderBase]: 7224/11805 cut-off events. [2024-06-27 22:14:41,865 INFO L125 PetriNetUnfolderBase]: For 665807/665809 co-relation queries the response was YES. [2024-06-27 22:14:42,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102390 conditions, 11805 events. 7224/11805 cut-off events. For 665807/665809 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 80694 event pairs, 2042 based on Foata normal form. 18/11512 useless extension candidates. Maximal degree in co-relation 102250. Up to 9793 conditions per place. [2024-06-27 22:14:42,073 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 663 selfloop transitions, 163 changer transitions 0/835 dead transitions. [2024-06-27 22:14:42,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 835 transitions, 16086 flow [2024-06-27 22:14:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:14:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:14:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 293 transitions. [2024-06-27 22:14:42,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4795417348608838 [2024-06-27 22:14:42,075 INFO L175 Difference]: Start difference. First operand has 319 places, 768 transitions, 13950 flow. Second operand 13 states and 293 transitions. [2024-06-27 22:14:42,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 835 transitions, 16086 flow [2024-06-27 22:14:44,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 835 transitions, 16049 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:44,587 INFO L231 Difference]: Finished difference. Result has 329 places, 770 transitions, 14412 flow [2024-06-27 22:14:44,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=13913, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14412, PETRI_PLACES=329, PETRI_TRANSITIONS=770} [2024-06-27 22:14:44,588 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 276 predicate places. [2024-06-27 22:14:44,588 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 770 transitions, 14412 flow [2024-06-27 22:14:44,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:44,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:44,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:14:44,589 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:44,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:44,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1677991299, now seen corresponding path program 2 times [2024-06-27 22:14:44,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:44,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057905750] [2024-06-27 22:14:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:46,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:46,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057905750] [2024-06-27 22:14:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057905750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:46,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:46,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500695894] [2024-06-27 22:14:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:46,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:46,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 770 transitions, 14412 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:46,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:46,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:50,210 INFO L124 PetriNetUnfolderBase]: 7413/12228 cut-off events. [2024-06-27 22:14:50,211 INFO L125 PetriNetUnfolderBase]: For 796705/796711 co-relation queries the response was YES. [2024-06-27 22:14:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112289 conditions, 12228 events. 7413/12228 cut-off events. For 796705/796711 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 85327 event pairs, 1851 based on Foata normal form. 22/11928 useless extension candidates. Maximal degree in co-relation 112147. Up to 9791 conditions per place. [2024-06-27 22:14:50,409 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 639 selfloop transitions, 191 changer transitions 0/850 dead transitions. [2024-06-27 22:14:50,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 850 transitions, 17007 flow [2024-06-27 22:14:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:14:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:14:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 306 transitions. [2024-06-27 22:14:50,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008183306055647 [2024-06-27 22:14:50,419 INFO L175 Difference]: Start difference. First operand has 329 places, 770 transitions, 14412 flow. Second operand 13 states and 306 transitions. [2024-06-27 22:14:50,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 850 transitions, 17007 flow [2024-06-27 22:14:52,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 850 transitions, 16624 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-27 22:14:52,784 INFO L231 Difference]: Finished difference. Result has 335 places, 787 transitions, 15213 flow [2024-06-27 22:14:52,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14077, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15213, PETRI_PLACES=335, PETRI_TRANSITIONS=787} [2024-06-27 22:14:52,785 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 282 predicate places. [2024-06-27 22:14:52,785 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 787 transitions, 15213 flow [2024-06-27 22:14:52,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:52,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:52,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:52,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:14:52,785 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:14:52,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 7269941, now seen corresponding path program 3 times [2024-06-27 22:14:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170704601] [2024-06-27 22:14:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170704601] [2024-06-27 22:14:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170704601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:54,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:54,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:14:54,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062228279] [2024-06-27 22:14:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:54,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:14:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:14:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:14:55,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:14:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 787 transitions, 15213 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:14:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:58,855 INFO L124 PetriNetUnfolderBase]: 7552/12414 cut-off events. [2024-06-27 22:14:58,856 INFO L125 PetriNetUnfolderBase]: For 806509/806513 co-relation queries the response was YES. [2024-06-27 22:14:58,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114722 conditions, 12414 events. 7552/12414 cut-off events. For 806509/806513 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 86579 event pairs, 1890 based on Foata normal form. 20/12106 useless extension candidates. Maximal degree in co-relation 114576. Up to 10279 conditions per place. [2024-06-27 22:14:59,071 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 683 selfloop transitions, 144 changer transitions 0/847 dead transitions. [2024-06-27 22:14:59,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 847 transitions, 17284 flow [2024-06-27 22:14:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:14:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:14:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2024-06-27 22:14:59,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241779497098646 [2024-06-27 22:14:59,073 INFO L175 Difference]: Start difference. First operand has 335 places, 787 transitions, 15213 flow. Second operand 11 states and 271 transitions. [2024-06-27 22:14:59,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 847 transitions, 17284 flow [2024-06-27 22:15:01,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 847 transitions, 16863 flow, removed 70 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:01,719 INFO L231 Difference]: Finished difference. Result has 337 places, 788 transitions, 15185 flow [2024-06-27 22:15:01,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14792, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15185, PETRI_PLACES=337, PETRI_TRANSITIONS=788} [2024-06-27 22:15:01,720 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 284 predicate places. [2024-06-27 22:15:01,720 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 788 transitions, 15185 flow [2024-06-27 22:15:01,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:01,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:01,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:01,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:15:01,721 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:01,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1930227351, now seen corresponding path program 4 times [2024-06-27 22:15:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562427063] [2024-06-27 22:15:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562427063] [2024-06-27 22:15:03,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562427063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:03,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:03,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:03,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353084223] [2024-06-27 22:15:03,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:03,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:03,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:03,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:03,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:15:03,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 788 transitions, 15185 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:03,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:03,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:15:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:08,144 INFO L124 PetriNetUnfolderBase]: 7686/12689 cut-off events. [2024-06-27 22:15:08,144 INFO L125 PetriNetUnfolderBase]: For 841005/841009 co-relation queries the response was YES. [2024-06-27 22:15:08,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117299 conditions, 12689 events. 7686/12689 cut-off events. For 841005/841009 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 89156 event pairs, 1873 based on Foata normal form. 20/12352 useless extension candidates. Maximal degree in co-relation 117154. Up to 10334 conditions per place. [2024-06-27 22:15:08,338 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 557 selfloop transitions, 278 changer transitions 0/855 dead transitions. [2024-06-27 22:15:08,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 855 transitions, 17297 flow [2024-06-27 22:15:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 277 transitions. [2024-06-27 22:15:08,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357833655705996 [2024-06-27 22:15:08,340 INFO L175 Difference]: Start difference. First operand has 337 places, 788 transitions, 15185 flow. Second operand 11 states and 277 transitions. [2024-06-27 22:15:08,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 855 transitions, 17297 flow [2024-06-27 22:15:10,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 855 transitions, 16980 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:10,797 INFO L231 Difference]: Finished difference. Result has 339 places, 789 transitions, 15531 flow [2024-06-27 22:15:10,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14868, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15531, PETRI_PLACES=339, PETRI_TRANSITIONS=789} [2024-06-27 22:15:10,798 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 286 predicate places. [2024-06-27 22:15:10,798 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 789 transitions, 15531 flow [2024-06-27 22:15:10,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:10,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:10,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:10,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:15:10,799 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:10,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash -691225329, now seen corresponding path program 5 times [2024-06-27 22:15:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025885581] [2024-06-27 22:15:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025885581] [2024-06-27 22:15:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025885581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:12,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436131924] [2024-06-27 22:15:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:12,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:13,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:15:13,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 789 transitions, 15531 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:13,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:13,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:15:13,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:17,476 INFO L124 PetriNetUnfolderBase]: 8048/13190 cut-off events. [2024-06-27 22:15:17,476 INFO L125 PetriNetUnfolderBase]: For 873493/873493 co-relation queries the response was YES. [2024-06-27 22:15:17,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122160 conditions, 13190 events. 8048/13190 cut-off events. For 873493/873493 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 92379 event pairs, 2100 based on Foata normal form. 16/12860 useless extension candidates. Maximal degree in co-relation 122014. Up to 11115 conditions per place. [2024-06-27 22:15:17,794 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 690 selfloop transitions, 150 changer transitions 0/849 dead transitions. [2024-06-27 22:15:17,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 849 transitions, 17632 flow [2024-06-27 22:15:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2024-06-27 22:15:17,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029013539651838 [2024-06-27 22:15:17,796 INFO L175 Difference]: Start difference. First operand has 339 places, 789 transitions, 15531 flow. Second operand 11 states and 260 transitions. [2024-06-27 22:15:17,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 849 transitions, 17632 flow [2024-06-27 22:15:20,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 849 transitions, 17045 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:20,693 INFO L231 Difference]: Finished difference. Result has 341 places, 790 transitions, 15353 flow [2024-06-27 22:15:20,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=14944, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15353, PETRI_PLACES=341, PETRI_TRANSITIONS=790} [2024-06-27 22:15:20,706 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 288 predicate places. [2024-06-27 22:15:20,706 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 790 transitions, 15353 flow [2024-06-27 22:15:20,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:20,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:20,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:20,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:15:20,707 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:20,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -690986319, now seen corresponding path program 6 times [2024-06-27 22:15:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123650720] [2024-06-27 22:15:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123650720] [2024-06-27 22:15:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123650720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:22,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:22,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:22,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883270604] [2024-06-27 22:15:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:22,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:22,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:22,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:15:22,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 790 transitions, 15353 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:22,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:22,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:15:22,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:27,372 INFO L124 PetriNetUnfolderBase]: 7960/13192 cut-off events. [2024-06-27 22:15:27,383 INFO L125 PetriNetUnfolderBase]: For 909730/909734 co-relation queries the response was YES. [2024-06-27 22:15:27,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123560 conditions, 13192 events. 7960/13192 cut-off events. For 909730/909734 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 93699 event pairs, 1829 based on Foata normal form. 16/12811 useless extension candidates. Maximal degree in co-relation 123413. Up to 9177 conditions per place. [2024-06-27 22:15:27,574 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 492 selfloop transitions, 349 changer transitions 0/861 dead transitions. [2024-06-27 22:15:27,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 861 transitions, 17650 flow [2024-06-27 22:15:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 279 transitions. [2024-06-27 22:15:27,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.539651837524178 [2024-06-27 22:15:27,575 INFO L175 Difference]: Start difference. First operand has 341 places, 790 transitions, 15353 flow. Second operand 11 states and 279 transitions. [2024-06-27 22:15:27,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 861 transitions, 17650 flow [2024-06-27 22:15:30,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 861 transitions, 17367 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 22:15:30,285 INFO L231 Difference]: Finished difference. Result has 344 places, 792 transitions, 15969 flow [2024-06-27 22:15:30,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=15070, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15969, PETRI_PLACES=344, PETRI_TRANSITIONS=792} [2024-06-27 22:15:30,286 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 291 predicate places. [2024-06-27 22:15:30,286 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 792 transitions, 15969 flow [2024-06-27 22:15:30,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:30,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:30,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:30,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:15:30,287 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:30,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash 476638537, now seen corresponding path program 1 times [2024-06-27 22:15:30,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070142206] [2024-06-27 22:15:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070142206] [2024-06-27 22:15:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070142206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:15:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393169514] [2024-06-27 22:15:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:31,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:15:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:15:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:15:31,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:15:31,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 792 transitions, 15969 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:31,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:31,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:15:31,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:35,587 INFO L124 PetriNetUnfolderBase]: 8225/13564 cut-off events. [2024-06-27 22:15:35,588 INFO L125 PetriNetUnfolderBase]: For 895239/895239 co-relation queries the response was YES. [2024-06-27 22:15:35,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125872 conditions, 13564 events. 8225/13564 cut-off events. For 895239/895239 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 95999 event pairs, 2143 based on Foata normal form. 2/13190 useless extension candidates. Maximal degree in co-relation 125724. Up to 11492 conditions per place. [2024-06-27 22:15:35,807 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 734 selfloop transitions, 104 changer transitions 0/847 dead transitions. [2024-06-27 22:15:35,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 847 transitions, 18391 flow [2024-06-27 22:15:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-06-27 22:15:35,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186170212765957 [2024-06-27 22:15:35,809 INFO L175 Difference]: Start difference. First operand has 344 places, 792 transitions, 15969 flow. Second operand 8 states and 195 transitions. [2024-06-27 22:15:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 847 transitions, 18391 flow [2024-06-27 22:15:38,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 847 transitions, 17909 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:38,299 INFO L231 Difference]: Finished difference. Result has 347 places, 805 transitions, 15961 flow [2024-06-27 22:15:38,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=15487, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15961, PETRI_PLACES=347, PETRI_TRANSITIONS=805} [2024-06-27 22:15:38,300 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 294 predicate places. [2024-06-27 22:15:38,300 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 805 transitions, 15961 flow [2024-06-27 22:15:38,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:38,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:38,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:38,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:15:38,301 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:38,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash -260666099, now seen corresponding path program 7 times [2024-06-27 22:15:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757375459] [2024-06-27 22:15:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757375459] [2024-06-27 22:15:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757375459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:40,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:40,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61493555] [2024-06-27 22:15:40,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:40,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:40,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:40,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:41,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:15:41,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 805 transitions, 15961 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:41,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:41,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:15:41,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:45,663 INFO L124 PetriNetUnfolderBase]: 8196/13650 cut-off events. [2024-06-27 22:15:45,663 INFO L125 PetriNetUnfolderBase]: For 956069/956073 co-relation queries the response was YES. [2024-06-27 22:15:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130444 conditions, 13650 events. 8196/13650 cut-off events. For 956069/956073 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 98682 event pairs, 1839 based on Foata normal form. 20/13296 useless extension candidates. Maximal degree in co-relation 130292. Up to 11199 conditions per place. [2024-06-27 22:15:45,859 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 713 selfloop transitions, 127 changer transitions 0/860 dead transitions. [2024-06-27 22:15:45,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 860 transitions, 18127 flow [2024-06-27 22:15:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-06-27 22:15:45,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297872340425532 [2024-06-27 22:15:45,860 INFO L175 Difference]: Start difference. First operand has 347 places, 805 transitions, 15961 flow. Second operand 10 states and 249 transitions. [2024-06-27 22:15:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 860 transitions, 18127 flow [2024-06-27 22:15:48,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 860 transitions, 18027 flow, removed 37 selfloop flow, removed 2 redundant places. [2024-06-27 22:15:48,914 INFO L231 Difference]: Finished difference. Result has 355 places, 807 transitions, 16301 flow [2024-06-27 22:15:48,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=15875, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16301, PETRI_PLACES=355, PETRI_TRANSITIONS=807} [2024-06-27 22:15:48,915 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 302 predicate places. [2024-06-27 22:15:48,915 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 807 transitions, 16301 flow [2024-06-27 22:15:48,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:48,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:48,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:48,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:15:48,915 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:15:48,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -409223655, now seen corresponding path program 8 times [2024-06-27 22:15:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582108614] [2024-06-27 22:15:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat