./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:07:53,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:07:54,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:07:54,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:07:54,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:07:54,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:07:54,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:07:54,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:07:54,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:07:54,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:07:54,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:07:54,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:07:54,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:07:54,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:07:54,142 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:07:54,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:07:54,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:07:54,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:07:54,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:07:54,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:07:54,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:07:54,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:07:54,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:07:54,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:07:54,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:07:54,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:07:54,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:07:54,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:07:54,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:07:54,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:07:54,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:07:54,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:07:54,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:07:54,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:07:54,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:07:54,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:07:54,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:07:54,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:07:54,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:07:54,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:07:54,155 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:07:54,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:07:54,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:07:54,156 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 12:07:54,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:07:54,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:07:54,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:07:54,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:07:54,436 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:07:54,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:07:55,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:07:55,835 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:07:55,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:07:55,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb185803/94aff005b3c743feb0a275fe3d4f3bc7/FLAGfb66a6668 [2024-05-12 12:07:55,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb185803/94aff005b3c743feb0a275fe3d4f3bc7 [2024-05-12 12:07:55,864 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:07:55,865 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:07:55,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-05-12 12:07:56,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:07:56,046 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:07:56,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:07:56,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:07:56,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:07:56,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:07:55" (1/2) ... [2024-05-12 12:07:56,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f56a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:07:56, skipping insertion in model container [2024-05-12 12:07:56,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:07:55" (1/2) ... [2024-05-12 12:07:56,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5849dfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:07:56, skipping insertion in model container [2024-05-12 12:07:56,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:07:56" (2/2) ... [2024-05-12 12:07:56,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f56a07 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56, skipping insertion in model container [2024-05-12 12:07:56,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:07:56" (2/2) ... [2024-05-12 12:07:56,086 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:07:56,151 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:07:56,153 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 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) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:07:56,154 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 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) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:07:56,154 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:07:56,154 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-05-12 12:07:56,199 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:07:56,423 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2024-05-12 12:07:56,564 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:07:56,572 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:07:56,604 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:07:56,858 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:07:56,896 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:07:56,897 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56 WrapperNode [2024-05-12 12:07:56,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:07:56,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:07:56,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:07:56,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:07:56,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:56,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,032 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-05-12 12:07:57,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:07:57,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:07:57,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:07:57,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:07:57,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,098 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:07:57,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:07:57,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:07:57,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:07:57,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:07:57,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (1/1) ... [2024-05-12 12:07:57,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:07:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:07:57,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 12:07:57,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 12:07:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:07:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:07:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:07:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:07:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:07:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:07:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:07:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:07:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:07:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:07:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:07:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:07:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:07:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:07:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:07:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:07:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:07:57,285 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:07:57,426 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:07:57,427 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:07:58,218 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:07:58,219 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:07:58,412 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:07:58,417 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:07:58,418 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:07:58 BoogieIcfgContainer [2024-05-12 12:07:58,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:07:58,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:07:58,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:07:58,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:07:58,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:07:55" (1/4) ... [2024-05-12 12:07:58,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232f4f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:07:58, skipping insertion in model container [2024-05-12 12:07:58,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:07:56" (2/4) ... [2024-05-12 12:07:58,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232f4f67 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:07:58, skipping insertion in model container [2024-05-12 12:07:58,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:07:56" (3/4) ... [2024-05-12 12:07:58,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232f4f67 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:07:58, skipping insertion in model container [2024-05-12 12:07:58,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:07:58" (4/4) ... [2024-05-12 12:07:58,432 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:07:58,449 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:07:58,449 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:07:58,449 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:07:58,529 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:07:58,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-05-12 12:07:58,623 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-05-12 12:07:58,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:07:58,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-05-12 12:07:58,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-05-12 12:07:58,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-05-12 12:07:58,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:07:58,661 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;@279b5839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:07:58,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:07:58,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:07:58,672 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:07:58,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:07:58,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:58,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:07:58,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:58,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1097637477, now seen corresponding path program 1 times [2024-05-12 12:07:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:58,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742454583] [2024-05-12 12:07:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:58,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742454583] [2024-05-12 12:08:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742454583] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:08:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514746284] [2024-05-12 12:08:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:08:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:08:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:08:03,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 12:08:03,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:03,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:03,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 12:08:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:03,996 INFO L124 PetriNetUnfolderBase]: 475/959 cut-off events. [2024-05-12 12:08:03,996 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 12:08:04,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 959 events. 475/959 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5383 event pairs, 334 based on Foata normal form. 36/897 useless extension candidates. Maximal degree in co-relation 1763. Up to 787 conditions per place. [2024-05-12 12:08:04,006 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-05-12 12:08:04,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 171 flow [2024-05-12 12:08:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:08:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:08:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-05-12 12:08:04,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2024-05-12 12:08:04,020 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 73 transitions. [2024-05-12 12:08:04,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 171 flow [2024-05-12 12:08:04,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:08:04,025 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-05-12 12:08:04,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-05-12 12:08:04,030 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-05-12 12:08:04,030 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-05-12 12:08:04,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:04,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:04,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:08:04,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:08:04,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:04,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1097638344, now seen corresponding path program 1 times [2024-05-12 12:08:04,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:04,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510328235] [2024-05-12 12:08:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510328235] [2024-05-12 12:08:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510328235] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:08:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099000913] [2024-05-12 12:08:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:04,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:08:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:08:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:08:04,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 37 [2024-05-12 12:08:04,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:04,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:04,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 37 [2024-05-12 12:08:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:04,231 INFO L124 PetriNetUnfolderBase]: 169/400 cut-off events. [2024-05-12 12:08:04,231 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 12:08:04,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 400 events. 169/400 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2112 event pairs, 96 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 756. Up to 256 conditions per place. [2024-05-12 12:08:04,234 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-05-12 12:08:04,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 175 flow [2024-05-12 12:08:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:08:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:08:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-05-12 12:08:04,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2024-05-12 12:08:04,236 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 81 transitions. [2024-05-12 12:08:04,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 175 flow [2024-05-12 12:08:04,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:08:04,238 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-05-12 12:08:04,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-05-12 12:08:04,239 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-05-12 12:08:04,240 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-05-12 12:08:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:04,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:04,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:08:04,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:04,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1732301853, now seen corresponding path program 1 times [2024-05-12 12:08:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123905232] [2024-05-12 12:08:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123905232] [2024-05-12 12:08:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123905232] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:07,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:08:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542513250] [2024-05-12 12:08:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:07,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:08:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:07,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:08:07,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:08:07,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 12:08:07,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:07,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:07,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 12:08:07,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:08,034 INFO L124 PetriNetUnfolderBase]: 342/705 cut-off events. [2024-05-12 12:08:08,034 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-05-12 12:08:08,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 705 events. 342/705 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3684 event pairs, 164 based on Foata normal form. 2/676 useless extension candidates. Maximal degree in co-relation 1442. Up to 562 conditions per place. [2024-05-12 12:08:08,041 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 36 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-05-12 12:08:08,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 222 flow [2024-05-12 12:08:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:08:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:08:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-05-12 12:08:08,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-05-12 12:08:08,045 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 86 transitions. [2024-05-12 12:08:08,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 222 flow [2024-05-12 12:08:08,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:08:08,049 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-05-12 12:08:08,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-05-12 12:08:08,050 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-05-12 12:08:08,051 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-05-12 12:08:08,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:08,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:08,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:08:08,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:08,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2133218670, now seen corresponding path program 1 times [2024-05-12 12:08:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102973811] [2024-05-12 12:08:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102973811] [2024-05-12 12:08:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102973811] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:11,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:08:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154236923] [2024-05-12 12:08:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:11,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:08:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:11,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:08:11,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:08:11,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 12:08:11,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:11,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:11,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 12:08:11,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:12,131 INFO L124 PetriNetUnfolderBase]: 418/832 cut-off events. [2024-05-12 12:08:12,131 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-05-12 12:08:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 832 events. 418/832 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4425 event pairs, 147 based on Foata normal form. 3/797 useless extension candidates. Maximal degree in co-relation 1865. Up to 629 conditions per place. [2024-05-12 12:08:12,137 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-05-12 12:08:12,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 345 flow [2024-05-12 12:08:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:08:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:08:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-05-12 12:08:12,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2024-05-12 12:08:12,142 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 108 transitions. [2024-05-12 12:08:12,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 345 flow [2024-05-12 12:08:12,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 338 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:08:12,147 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-05-12 12:08:12,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-05-12 12:08:12,149 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-05-12 12:08:12,149 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-05-12 12:08:12,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:12,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:12,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:12,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:08:12,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:12,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1705270626, now seen corresponding path program 1 times [2024-05-12 12:08:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:12,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268808062] [2024-05-12 12:08:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268808062] [2024-05-12 12:08:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268808062] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:08:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009892861] [2024-05-12 12:08:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:16,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:08:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:08:16,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:08:16,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 12:08:16,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-05-12 12:08:16,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:16,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 12:08:16,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:16,926 INFO L124 PetriNetUnfolderBase]: 428/767 cut-off events. [2024-05-12 12:08:16,926 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2024-05-12 12:08:16,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 767 events. 428/767 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3813 event pairs, 77 based on Foata normal form. 3/759 useless extension candidates. Maximal degree in co-relation 2172. Up to 593 conditions per place. [2024-05-12 12:08:16,932 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 58 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2024-05-12 12:08:16,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 530 flow [2024-05-12 12:08:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:08:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:08:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-05-12 12:08:16,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-05-12 12:08:16,937 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 129 transitions. [2024-05-12 12:08:16,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 530 flow [2024-05-12 12:08:16,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 526 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 12:08:16,950 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 364 flow [2024-05-12 12:08:16,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-05-12 12:08:16,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-05-12 12:08:16,953 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 364 flow [2024-05-12 12:08:16,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-05-12 12:08:16,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:16,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:16,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:08:16,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:16,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1256408285, now seen corresponding path program 1 times [2024-05-12 12:08:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225210390] [2024-05-12 12:08:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225210390] [2024-05-12 12:08:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225210390] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:08:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823194731] [2024-05-12 12:08:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:20,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:08:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:20,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:08:20,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:08:20,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 12:08:20,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:20,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:20,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 12:08:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:20,617 INFO L124 PetriNetUnfolderBase]: 438/785 cut-off events. [2024-05-12 12:08:20,617 INFO L125 PetriNetUnfolderBase]: For 1536/1536 co-relation queries the response was YES. [2024-05-12 12:08:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 785 events. 438/785 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3931 event pairs, 37 based on Foata normal form. 6/780 useless extension candidates. Maximal degree in co-relation 2652. Up to 561 conditions per place. [2024-05-12 12:08:20,623 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 61 selfloop transitions, 25 changer transitions 0/94 dead transitions. [2024-05-12 12:08:20,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 652 flow [2024-05-12 12:08:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:08:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:08:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-05-12 12:08:20,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555984555984556 [2024-05-12 12:08:20,625 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 364 flow. Second operand 7 states and 144 transitions. [2024-05-12 12:08:20,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 652 flow [2024-05-12 12:08:20,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 632 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-05-12 12:08:20,632 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 411 flow [2024-05-12 12:08:20,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-05-12 12:08:20,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-05-12 12:08:20,635 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 411 flow [2024-05-12 12:08:20,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:20,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:20,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:20,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:08:20,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:20,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 536142295, now seen corresponding path program 1 times [2024-05-12 12:08:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947472449] [2024-05-12 12:08:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947472449] [2024-05-12 12:08:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947472449] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:26,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:08:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26040932] [2024-05-12 12:08:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:26,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:08:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:08:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:08:26,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:26,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:26,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:26,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:27,300 INFO L124 PetriNetUnfolderBase]: 514/1026 cut-off events. [2024-05-12 12:08:27,301 INFO L125 PetriNetUnfolderBase]: For 2010/2010 co-relation queries the response was YES. [2024-05-12 12:08:27,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 1026 events. 514/1026 cut-off events. For 2010/2010 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5580 event pairs, 156 based on Foata normal form. 1/985 useless extension candidates. Maximal degree in co-relation 3246. Up to 838 conditions per place. [2024-05-12 12:08:27,309 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-05-12 12:08:27,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 563 flow [2024-05-12 12:08:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:08:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:08:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-05-12 12:08:27,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-05-12 12:08:27,311 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 411 flow. Second operand 5 states and 87 transitions. [2024-05-12 12:08:27,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 563 flow [2024-05-12 12:08:27,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 504 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:08:27,316 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 380 flow [2024-05-12 12:08:27,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-05-12 12:08:27,318 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-05-12 12:08:27,318 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 380 flow [2024-05-12 12:08:27,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:27,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:27,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:27,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:08:27,319 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:27,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash -576091948, now seen corresponding path program 1 times [2024-05-12 12:08:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393912294] [2024-05-12 12:08:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:34,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393912294] [2024-05-12 12:08:34,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393912294] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:34,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:34,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:08:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205988460] [2024-05-12 12:08:34,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:08:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:08:34,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:08:34,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:34,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:34,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:34,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:35,003 INFO L124 PetriNetUnfolderBase]: 508/977 cut-off events. [2024-05-12 12:08:35,003 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2024-05-12 12:08:35,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 977 events. 508/977 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5200 event pairs, 151 based on Foata normal form. 3/948 useless extension candidates. Maximal degree in co-relation 3017. Up to 796 conditions per place. [2024-05-12 12:08:35,011 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 61 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-05-12 12:08:35,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 578 flow [2024-05-12 12:08:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:08:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:08:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-05-12 12:08:35,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-05-12 12:08:35,012 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 380 flow. Second operand 6 states and 105 transitions. [2024-05-12 12:08:35,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 578 flow [2024-05-12 12:08:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 553 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:08:35,018 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 399 flow [2024-05-12 12:08:35,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 12:08:35,019 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-05-12 12:08:35,020 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 399 flow [2024-05-12 12:08:35,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:35,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:35,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:35,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:08:35,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:35,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -990947943, now seen corresponding path program 1 times [2024-05-12 12:08:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298645758] [2024-05-12 12:08:35,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:35,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298645758] [2024-05-12 12:08:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298645758] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:40,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:40,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:08:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239314553] [2024-05-12 12:08:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:08:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:08:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:08:40,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:40,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:40,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:41,254 INFO L124 PetriNetUnfolderBase]: 529/932 cut-off events. [2024-05-12 12:08:41,255 INFO L125 PetriNetUnfolderBase]: For 1978/1978 co-relation queries the response was YES. [2024-05-12 12:08:41,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 932 events. 529/932 cut-off events. For 1978/1978 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4609 event pairs, 80 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 3236. Up to 762 conditions per place. [2024-05-12 12:08:41,265 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 63 selfloop transitions, 27 changer transitions 0/97 dead transitions. [2024-05-12 12:08:41,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 746 flow [2024-05-12 12:08:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:08:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:08:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 12:08:41,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 12:08:41,267 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 399 flow. Second operand 7 states and 126 transitions. [2024-05-12 12:08:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 746 flow [2024-05-12 12:08:41,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 97 transitions, 719 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:08:41,275 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 556 flow [2024-05-12 12:08:41,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=556, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-05-12 12:08:41,276 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-05-12 12:08:41,276 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 556 flow [2024-05-12 12:08:41,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:41,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:41,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:41,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:08:41,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:41,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -678989069, now seen corresponding path program 2 times [2024-05-12 12:08:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972113340] [2024-05-12 12:08:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:45,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972113340] [2024-05-12 12:08:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972113340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:08:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089015643] [2024-05-12 12:08:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:45,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:08:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:45,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:08:45,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:08:46,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:46,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:46,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:46,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:46,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:46,540 INFO L124 PetriNetUnfolderBase]: 524/1022 cut-off events. [2024-05-12 12:08:46,540 INFO L125 PetriNetUnfolderBase]: For 2446/2446 co-relation queries the response was YES. [2024-05-12 12:08:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1022 events. 524/1022 cut-off events. For 2446/2446 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5505 event pairs, 152 based on Foata normal form. 1/986 useless extension candidates. Maximal degree in co-relation 3461. Up to 842 conditions per place. [2024-05-12 12:08:46,548 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 66 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2024-05-12 12:08:46,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 768 flow [2024-05-12 12:08:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:08:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:08:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-05-12 12:08:46,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2024-05-12 12:08:46,550 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 556 flow. Second operand 6 states and 103 transitions. [2024-05-12 12:08:46,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 768 flow [2024-05-12 12:08:46,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 749 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 12:08:46,557 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 589 flow [2024-05-12 12:08:46,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-05-12 12:08:46,559 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-05-12 12:08:46,559 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 589 flow [2024-05-12 12:08:46,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:46,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:46,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:46,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:08:46,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:46,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -654614160, now seen corresponding path program 1 times [2024-05-12 12:08:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473268927] [2024-05-12 12:08:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473268927] [2024-05-12 12:08:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473268927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:51,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:51,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:08:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378374710] [2024-05-12 12:08:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:08:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:08:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:08:51,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:51,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:51,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:51,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:51,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:52,081 INFO L124 PetriNetUnfolderBase]: 651/1155 cut-off events. [2024-05-12 12:08:52,082 INFO L125 PetriNetUnfolderBase]: For 3089/3089 co-relation queries the response was YES. [2024-05-12 12:08:52,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 1155 events. 651/1155 cut-off events. For 3089/3089 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5997 event pairs, 110 based on Foata normal form. 6/1140 useless extension candidates. Maximal degree in co-relation 4058. Up to 746 conditions per place. [2024-05-12 12:08:52,091 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 80 selfloop transitions, 29 changer transitions 0/116 dead transitions. [2024-05-12 12:08:52,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 965 flow [2024-05-12 12:08:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:08:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:08:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 12:08:52,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-05-12 12:08:52,093 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 589 flow. Second operand 8 states and 149 transitions. [2024-05-12 12:08:52,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 965 flow [2024-05-12 12:08:52,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 933 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:08:52,102 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 678 flow [2024-05-12 12:08:52,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2024-05-12 12:08:52,103 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2024-05-12 12:08:52,103 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 678 flow [2024-05-12 12:08:52,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:52,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:52,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:52,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:08:52,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:52,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 426442322, now seen corresponding path program 2 times [2024-05-12 12:08:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:52,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246796588] [2024-05-12 12:08:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246796588] [2024-05-12 12:08:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246796588] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:08:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055562952] [2024-05-12 12:08:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:08:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:08:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:08:56,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:08:56,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:56,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:56,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:08:56,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:57,304 INFO L124 PetriNetUnfolderBase]: 684/1322 cut-off events. [2024-05-12 12:08:57,304 INFO L125 PetriNetUnfolderBase]: For 4175/4175 co-relation queries the response was YES. [2024-05-12 12:08:57,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 1322 events. 684/1322 cut-off events. For 4175/4175 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7510 event pairs, 202 based on Foata normal form. 3/1275 useless extension candidates. Maximal degree in co-relation 4827. Up to 1059 conditions per place. [2024-05-12 12:08:57,317 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 81 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2024-05-12 12:08:57,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 940 flow [2024-05-12 12:08:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:08:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:08:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-05-12 12:08:57,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-05-12 12:08:57,319 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 678 flow. Second operand 7 states and 121 transitions. [2024-05-12 12:08:57,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 940 flow [2024-05-12 12:08:57,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 104 transitions, 913 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 12:08:57,332 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 706 flow [2024-05-12 12:08:57,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=706, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2024-05-12 12:08:57,333 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-05-12 12:08:57,334 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 706 flow [2024-05-12 12:08:57,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:57,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:57,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:57,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:08:57,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:08:57,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash 426176342, now seen corresponding path program 3 times [2024-05-12 12:08:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851845276] [2024-05-12 12:08:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851845276] [2024-05-12 12:09:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851845276] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:09:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344292937] [2024-05-12 12:09:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:09:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:09:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:09:02,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:02,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:02,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:02,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:02,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:02,626 INFO L124 PetriNetUnfolderBase]: 678/1293 cut-off events. [2024-05-12 12:09:02,626 INFO L125 PetriNetUnfolderBase]: For 4406/4406 co-relation queries the response was YES. [2024-05-12 12:09:02,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 1293 events. 678/1293 cut-off events. For 4406/4406 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7254 event pairs, 194 based on Foata normal form. 3/1251 useless extension candidates. Maximal degree in co-relation 4845. Up to 1003 conditions per place. [2024-05-12 12:09:02,634 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 82 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2024-05-12 12:09:02,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 996 flow [2024-05-12 12:09:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:09:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:09:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 12:09:02,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826254826254826 [2024-05-12 12:09:02,635 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 706 flow. Second operand 7 states and 125 transitions. [2024-05-12 12:09:02,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 996 flow [2024-05-12 12:09:02,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 952 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:09:02,647 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 730 flow [2024-05-12 12:09:02,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-05-12 12:09:02,647 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-05-12 12:09:02,648 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 730 flow [2024-05-12 12:09:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:02,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:02,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:02,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:09:02,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:02,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1759939470, now seen corresponding path program 1 times [2024-05-12 12:09:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:02,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874540752] [2024-05-12 12:09:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874540752] [2024-05-12 12:09:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874540752] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:08,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:08,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:09:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6154403] [2024-05-12 12:09:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:08,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:09:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:09:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:09:08,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:08,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 730 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:08,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:08,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:08,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:09,294 INFO L124 PetriNetUnfolderBase]: 692/1219 cut-off events. [2024-05-12 12:09:09,294 INFO L125 PetriNetUnfolderBase]: For 4684/4684 co-relation queries the response was YES. [2024-05-12 12:09:09,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1219 events. 692/1219 cut-off events. For 4684/4684 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6410 event pairs, 120 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 4889. Up to 958 conditions per place. [2024-05-12 12:09:09,304 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 89 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-05-12 12:09:09,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 124 transitions, 1124 flow [2024-05-12 12:09:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 12:09:09,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-05-12 12:09:09,306 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 730 flow. Second operand 8 states and 145 transitions. [2024-05-12 12:09:09,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 124 transitions, 1124 flow [2024-05-12 12:09:09,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 124 transitions, 1076 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:09:09,317 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 792 flow [2024-05-12 12:09:09,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=792, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-05-12 12:09:09,318 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2024-05-12 12:09:09,318 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 792 flow [2024-05-12 12:09:09,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:09,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:09,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:09,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:09:09,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:09,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1756274340, now seen corresponding path program 2 times [2024-05-12 12:09:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:09,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495642054] [2024-05-12 12:09:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:09,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:15,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:15,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495642054] [2024-05-12 12:09:15,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495642054] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:15,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:15,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:09:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391024787] [2024-05-12 12:09:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:15,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:09:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:09:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:09:15,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:15,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 792 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:15,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:15,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:15,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:16,049 INFO L124 PetriNetUnfolderBase]: 690/1208 cut-off events. [2024-05-12 12:09:16,050 INFO L125 PetriNetUnfolderBase]: For 4900/4900 co-relation queries the response was YES. [2024-05-12 12:09:16,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 1208 events. 690/1208 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6293 event pairs, 116 based on Foata normal form. 1/1190 useless extension candidates. Maximal degree in co-relation 4957. Up to 999 conditions per place. [2024-05-12 12:09:16,062 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 84 selfloop transitions, 29 changer transitions 0/120 dead transitions. [2024-05-12 12:09:16,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 120 transitions, 1112 flow [2024-05-12 12:09:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-05-12 12:09:16,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-05-12 12:09:16,063 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 792 flow. Second operand 8 states and 141 transitions. [2024-05-12 12:09:16,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 120 transitions, 1112 flow [2024-05-12 12:09:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 1076 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:09:16,081 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 820 flow [2024-05-12 12:09:16,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-05-12 12:09:16,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2024-05-12 12:09:16,083 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 820 flow [2024-05-12 12:09:16,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:16,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:16,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:16,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:09:16,084 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:16,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1756124455, now seen corresponding path program 1 times [2024-05-12 12:09:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582157285] [2024-05-12 12:09:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582157285] [2024-05-12 12:09:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582157285] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:09:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731984413] [2024-05-12 12:09:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:21,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:09:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:09:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:09:21,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:21,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 820 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:21,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:21,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:21,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:22,204 INFO L124 PetriNetUnfolderBase]: 723/1271 cut-off events. [2024-05-12 12:09:22,205 INFO L125 PetriNetUnfolderBase]: For 5650/5650 co-relation queries the response was YES. [2024-05-12 12:09:22,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 1271 events. 723/1271 cut-off events. For 5650/5650 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6709 event pairs, 116 based on Foata normal form. 3/1252 useless extension candidates. Maximal degree in co-relation 5266. Up to 794 conditions per place. [2024-05-12 12:09:22,213 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 94 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-05-12 12:09:22,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 1248 flow [2024-05-12 12:09:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:09:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:09:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 12:09:22,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-05-12 12:09:22,214 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 820 flow. Second operand 9 states and 167 transitions. [2024-05-12 12:09:22,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 1248 flow [2024-05-12 12:09:22,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 134 transitions, 1190 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 12:09:22,227 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 849 flow [2024-05-12 12:09:22,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=849, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2024-05-12 12:09:22,228 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2024-05-12 12:09:22,228 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 849 flow [2024-05-12 12:09:22,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:22,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:22,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:09:22,229 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1756130035, now seen corresponding path program 2 times [2024-05-12 12:09:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754708586] [2024-05-12 12:09:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754708586] [2024-05-12 12:09:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754708586] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:09:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90304717] [2024-05-12 12:09:26,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:26,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:09:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:09:26,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:09:27,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:27,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 849 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:27,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:27,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:27,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:27,584 INFO L124 PetriNetUnfolderBase]: 765/1332 cut-off events. [2024-05-12 12:09:27,584 INFO L125 PetriNetUnfolderBase]: For 6507/6507 co-relation queries the response was YES. [2024-05-12 12:09:27,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 1332 events. 765/1332 cut-off events. For 6507/6507 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7116 event pairs, 102 based on Foata normal form. 3/1315 useless extension candidates. Maximal degree in co-relation 5651. Up to 712 conditions per place. [2024-05-12 12:09:27,596 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 45 changer transitions 0/139 dead transitions. [2024-05-12 12:09:27,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1351 flow [2024-05-12 12:09:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:09:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:09:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-05-12 12:09:27,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482625482625483 [2024-05-12 12:09:27,601 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 849 flow. Second operand 7 states and 142 transitions. [2024-05-12 12:09:27,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1351 flow [2024-05-12 12:09:27,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 139 transitions, 1273 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 12:09:27,615 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 964 flow [2024-05-12 12:09:27,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=964, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-05-12 12:09:27,616 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-05-12 12:09:27,616 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 964 flow [2024-05-12 12:09:27,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:27,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:27,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:27,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:09:27,617 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:27,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1984183336, now seen corresponding path program 1 times [2024-05-12 12:09:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976024645] [2024-05-12 12:09:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976024645] [2024-05-12 12:09:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976024645] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:09:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373709104] [2024-05-12 12:09:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:32,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:09:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:09:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:09:32,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:32,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 964 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:32,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:32,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:32,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:33,024 INFO L124 PetriNetUnfolderBase]: 767/1425 cut-off events. [2024-05-12 12:09:33,024 INFO L125 PetriNetUnfolderBase]: For 7398/7398 co-relation queries the response was YES. [2024-05-12 12:09:33,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6122 conditions, 1425 events. 767/1425 cut-off events. For 7398/7398 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8107 event pairs, 211 based on Foata normal form. 2/1384 useless extension candidates. Maximal degree in co-relation 6072. Up to 1193 conditions per place. [2024-05-12 12:09:33,031 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 106 selfloop transitions, 16 changer transitions 0/129 dead transitions. [2024-05-12 12:09:33,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 1326 flow [2024-05-12 12:09:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-05-12 12:09:33,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-05-12 12:09:33,034 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 964 flow. Second operand 8 states and 133 transitions. [2024-05-12 12:09:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 1326 flow [2024-05-12 12:09:33,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 129 transitions, 1290 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-05-12 12:09:33,047 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 1053 flow [2024-05-12 12:09:33,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1053, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-05-12 12:09:33,047 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-05-12 12:09:33,047 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 1053 flow [2024-05-12 12:09:33,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:33,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:33,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:33,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:09:33,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:33,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1449538503, now seen corresponding path program 3 times [2024-05-12 12:09:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:33,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244904410] [2024-05-12 12:09:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244904410] [2024-05-12 12:09:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244904410] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:09:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787740892] [2024-05-12 12:09:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:09:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:09:38,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:09:38,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:38,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 1053 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:38,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:38,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:38,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:38,814 INFO L124 PetriNetUnfolderBase]: 800/1509 cut-off events. [2024-05-12 12:09:38,814 INFO L125 PetriNetUnfolderBase]: For 8095/8095 co-relation queries the response was YES. [2024-05-12 12:09:38,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6475 conditions, 1509 events. 800/1509 cut-off events. For 8095/8095 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8831 event pairs, 224 based on Foata normal form. 3/1460 useless extension candidates. Maximal degree in co-relation 6421. Up to 1196 conditions per place. [2024-05-12 12:09:38,824 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 111 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-05-12 12:09:38,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 1415 flow [2024-05-12 12:09:38,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-05-12 12:09:38,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46959459459459457 [2024-05-12 12:09:38,833 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 1053 flow. Second operand 8 states and 139 transitions. [2024-05-12 12:09:38,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 1415 flow [2024-05-12 12:09:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 138 transitions, 1370 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 12:09:38,855 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 1077 flow [2024-05-12 12:09:38,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1077, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-05-12 12:09:38,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-05-12 12:09:38,856 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 1077 flow [2024-05-12 12:09:38,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:38,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:38,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:09:38,858 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:38,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1457783883, now seen corresponding path program 4 times [2024-05-12 12:09:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014958439] [2024-05-12 12:09:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:43,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014958439] [2024-05-12 12:09:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014958439] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:43,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:09:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204634276] [2024-05-12 12:09:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:43,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:09:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:09:43,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:09:43,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:43,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 1077 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:43,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:43,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:43,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:44,548 INFO L124 PetriNetUnfolderBase]: 794/1479 cut-off events. [2024-05-12 12:09:44,549 INFO L125 PetriNetUnfolderBase]: For 8257/8257 co-relation queries the response was YES. [2024-05-12 12:09:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 1479 events. 794/1479 cut-off events. For 8257/8257 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8545 event pairs, 202 based on Foata normal form. 3/1436 useless extension candidates. Maximal degree in co-relation 6348. Up to 1140 conditions per place. [2024-05-12 12:09:44,559 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 110 selfloop transitions, 24 changer transitions 0/141 dead transitions. [2024-05-12 12:09:44,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 141 transitions, 1441 flow [2024-05-12 12:09:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 12:09:44,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-05-12 12:09:44,561 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 1077 flow. Second operand 8 states and 143 transitions. [2024-05-12 12:09:44,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 141 transitions, 1441 flow [2024-05-12 12:09:44,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 141 transitions, 1392 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 12:09:44,583 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 1081 flow [2024-05-12 12:09:44,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1081, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2024-05-12 12:09:44,584 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-05-12 12:09:44,584 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 1081 flow [2024-05-12 12:09:44,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:44,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:44,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:44,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:09:44,585 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:44,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 335117747, now seen corresponding path program 1 times [2024-05-12 12:09:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064715521] [2024-05-12 12:09:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064715521] [2024-05-12 12:09:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064715521] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:09:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447765009] [2024-05-12 12:09:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:51,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:09:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:09:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:09:51,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:51,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 1081 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:51,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:51,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:51,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:52,134 INFO L124 PetriNetUnfolderBase]: 791/1478 cut-off events. [2024-05-12 12:09:52,134 INFO L125 PetriNetUnfolderBase]: For 8420/8420 co-relation queries the response was YES. [2024-05-12 12:09:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 1478 events. 791/1478 cut-off events. For 8420/8420 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8553 event pairs, 220 based on Foata normal form. 2/1432 useless extension candidates. Maximal degree in co-relation 6349. Up to 1208 conditions per place. [2024-05-12 12:09:52,146 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 107 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2024-05-12 12:09:52,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1417 flow [2024-05-12 12:09:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 12:09:52,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2024-05-12 12:09:52,148 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 1081 flow. Second operand 8 states and 135 transitions. [2024-05-12 12:09:52,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1417 flow [2024-05-12 12:09:52,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 137 transitions, 1362 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:09:52,172 INFO L231 Difference]: Finished difference. Result has 116 places, 111 transitions, 1102 flow [2024-05-12 12:09:52,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1102, PETRI_PLACES=116, PETRI_TRANSITIONS=111} [2024-05-12 12:09:52,173 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-05-12 12:09:52,173 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 1102 flow [2024-05-12 12:09:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:52,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:52,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:52,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:09:52,174 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:52,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2137282317, now seen corresponding path program 1 times [2024-05-12 12:09:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562331871] [2024-05-12 12:09:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562331871] [2024-05-12 12:09:57,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562331871] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:57,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:57,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:09:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121952285] [2024-05-12 12:09:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:57,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:09:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:09:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:09:58,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:09:58,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 111 transitions, 1102 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:58,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:58,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:09:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:58,879 INFO L124 PetriNetUnfolderBase]: 807/1415 cut-off events. [2024-05-12 12:09:58,879 INFO L125 PetriNetUnfolderBase]: For 8717/8717 co-relation queries the response was YES. [2024-05-12 12:09:58,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6459 conditions, 1415 events. 807/1415 cut-off events. For 8717/8717 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7673 event pairs, 100 based on Foata normal form. 2/1393 useless extension candidates. Maximal degree in co-relation 6402. Up to 1014 conditions per place. [2024-05-12 12:09:58,889 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 106 selfloop transitions, 35 changer transitions 0/148 dead transitions. [2024-05-12 12:09:58,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 148 transitions, 1542 flow [2024-05-12 12:09:58,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:09:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:09:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 12:09:58,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-05-12 12:09:58,891 INFO L175 Difference]: Start difference. First operand has 116 places, 111 transitions, 1102 flow. Second operand 8 states and 145 transitions. [2024-05-12 12:09:58,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 148 transitions, 1542 flow [2024-05-12 12:09:58,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 148 transitions, 1486 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:09:58,915 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 1128 flow [2024-05-12 12:09:58,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1128, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2024-05-12 12:09:58,916 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-05-12 12:09:58,916 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 1128 flow [2024-05-12 12:09:58,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:58,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:58,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:09:58,917 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:09:58,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2137221867, now seen corresponding path program 2 times [2024-05-12 12:09:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863906139] [2024-05-12 12:09:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863906139] [2024-05-12 12:10:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863906139] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629824429] [2024-05-12 12:10:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:04,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:04,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 1128 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:04,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:04,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:04,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:05,235 INFO L124 PetriNetUnfolderBase]: 804/1402 cut-off events. [2024-05-12 12:10:05,235 INFO L125 PetriNetUnfolderBase]: For 8730/8730 co-relation queries the response was YES. [2024-05-12 12:10:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 1402 events. 804/1402 cut-off events. For 8730/8730 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7548 event pairs, 136 based on Foata normal form. 2/1382 useless extension candidates. Maximal degree in co-relation 6428. Up to 1098 conditions per place. [2024-05-12 12:10:05,244 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 105 selfloop transitions, 39 changer transitions 0/151 dead transitions. [2024-05-12 12:10:05,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 1540 flow [2024-05-12 12:10:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-05-12 12:10:05,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 12:10:05,245 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 1128 flow. Second operand 9 states and 162 transitions. [2024-05-12 12:10:05,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 1540 flow [2024-05-12 12:10:05,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 151 transitions, 1469 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 12:10:05,271 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 1140 flow [2024-05-12 12:10:05,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1140, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-05-12 12:10:05,272 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2024-05-12 12:10:05,272 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 1140 flow [2024-05-12 12:10:05,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:05,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:05,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:05,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:10:05,273 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:05,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1276452279, now seen corresponding path program 1 times [2024-05-12 12:10:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:05,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225406129] [2024-05-12 12:10:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:05,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225406129] [2024-05-12 12:10:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225406129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821934167] [2024-05-12 12:10:10,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:10,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:11,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:11,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 1140 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:11,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:11,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:11,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:11,721 INFO L124 PetriNetUnfolderBase]: 815/1440 cut-off events. [2024-05-12 12:10:11,721 INFO L125 PetriNetUnfolderBase]: For 9224/9224 co-relation queries the response was YES. [2024-05-12 12:10:11,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6577 conditions, 1440 events. 815/1440 cut-off events. For 9224/9224 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8010 event pairs, 104 based on Foata normal form. 1/1413 useless extension candidates. Maximal degree in co-relation 6519. Up to 957 conditions per place. [2024-05-12 12:10:11,730 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 121 selfloop transitions, 38 changer transitions 0/166 dead transitions. [2024-05-12 12:10:11,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 166 transitions, 1743 flow [2024-05-12 12:10:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:10:11,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-05-12 12:10:11,733 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 1140 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:10:11,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 166 transitions, 1743 flow [2024-05-12 12:10:11,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 166 transitions, 1679 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 12:10:11,759 INFO L231 Difference]: Finished difference. Result has 125 places, 124 transitions, 1279 flow [2024-05-12 12:10:11,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=125, PETRI_TRANSITIONS=124} [2024-05-12 12:10:11,760 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places. [2024-05-12 12:10:11,760 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 124 transitions, 1279 flow [2024-05-12 12:10:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:11,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:11,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:10:11,761 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:11,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2134420583, now seen corresponding path program 2 times [2024-05-12 12:10:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34152190] [2024-05-12 12:10:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:17,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34152190] [2024-05-12 12:10:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34152190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:17,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333375511] [2024-05-12 12:10:17,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:17,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:17,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:17,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:17,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 124 transitions, 1279 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:17,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:17,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:18,178 INFO L124 PetriNetUnfolderBase]: 850/1565 cut-off events. [2024-05-12 12:10:18,178 INFO L125 PetriNetUnfolderBase]: For 10410/10410 co-relation queries the response was YES. [2024-05-12 12:10:18,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 1565 events. 850/1565 cut-off events. For 10410/10410 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9154 event pairs, 154 based on Foata normal form. 1/1514 useless extension candidates. Maximal degree in co-relation 7189. Up to 1188 conditions per place. [2024-05-12 12:10:18,188 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 135 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-05-12 12:10:18,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 168 transitions, 1815 flow [2024-05-12 12:10:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 12:10:18,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2024-05-12 12:10:18,189 INFO L175 Difference]: Start difference. First operand has 125 places, 124 transitions, 1279 flow. Second operand 9 states and 158 transitions. [2024-05-12 12:10:18,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 168 transitions, 1815 flow [2024-05-12 12:10:18,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 168 transitions, 1765 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 12:10:18,211 INFO L231 Difference]: Finished difference. Result has 131 places, 134 transitions, 1417 flow [2024-05-12 12:10:18,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1417, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2024-05-12 12:10:18,212 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-05-12 12:10:18,212 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 1417 flow [2024-05-12 12:10:18,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:18,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:18,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:18,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:10:18,213 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:18,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2134425233, now seen corresponding path program 3 times [2024-05-12 12:10:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880681697] [2024-05-12 12:10:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:24,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880681697] [2024-05-12 12:10:24,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880681697] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088213613] [2024-05-12 12:10:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:24,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:24,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:24,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 1417 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:24,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:24,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:24,752 INFO L124 PetriNetUnfolderBase]: 864/1503 cut-off events. [2024-05-12 12:10:24,753 INFO L125 PetriNetUnfolderBase]: For 11115/11115 co-relation queries the response was YES. [2024-05-12 12:10:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 1503 events. 864/1503 cut-off events. For 11115/11115 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8271 event pairs, 96 based on Foata normal form. 1/1480 useless extension candidates. Maximal degree in co-relation 7415. Up to 1108 conditions per place. [2024-05-12 12:10:24,761 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 118 selfloop transitions, 52 changer transitions 0/177 dead transitions. [2024-05-12 12:10:24,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1952 flow [2024-05-12 12:10:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 12:10:24,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-05-12 12:10:24,763 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 1417 flow. Second operand 9 states and 161 transitions. [2024-05-12 12:10:24,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1952 flow [2024-05-12 12:10:24,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 177 transitions, 1936 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:10:24,796 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1586 flow [2024-05-12 12:10:24,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1586, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2024-05-12 12:10:24,797 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2024-05-12 12:10:24,797 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1586 flow [2024-05-12 12:10:24,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:24,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:24,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:10:24,798 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:24,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1394539959, now seen corresponding path program 4 times [2024-05-12 12:10:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:24,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100177777] [2024-05-12 12:10:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:30,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100177777] [2024-05-12 12:10:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100177777] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572593207] [2024-05-12 12:10:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:30,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:30,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1586 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:30,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:30,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:30,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:31,279 INFO L124 PetriNetUnfolderBase]: 875/1512 cut-off events. [2024-05-12 12:10:31,279 INFO L125 PetriNetUnfolderBase]: For 12164/12164 co-relation queries the response was YES. [2024-05-12 12:10:31,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7910 conditions, 1512 events. 875/1512 cut-off events. For 12164/12164 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8295 event pairs, 101 based on Foata normal form. 1/1491 useless extension candidates. Maximal degree in co-relation 7844. Up to 1073 conditions per place. [2024-05-12 12:10:31,289 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 121 selfloop transitions, 60 changer transitions 0/188 dead transitions. [2024-05-12 12:10:31,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 188 transitions, 2200 flow [2024-05-12 12:10:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 12:10:31,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-05-12 12:10:31,291 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1586 flow. Second operand 9 states and 169 transitions. [2024-05-12 12:10:31,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 188 transitions, 2200 flow [2024-05-12 12:10:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 188 transitions, 2139 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 12:10:31,321 INFO L231 Difference]: Finished difference. Result has 144 places, 147 transitions, 1766 flow [2024-05-12 12:10:31,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1766, PETRI_PLACES=144, PETRI_TRANSITIONS=147} [2024-05-12 12:10:31,322 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places. [2024-05-12 12:10:31,322 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 147 transitions, 1766 flow [2024-05-12 12:10:31,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:31,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:31,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:31,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:10:31,322 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:31,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1394717589, now seen corresponding path program 5 times [2024-05-12 12:10:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:31,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309763318] [2024-05-12 12:10:31,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309763318] [2024-05-12 12:10:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309763318] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:10:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260166598] [2024-05-12 12:10:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:37,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:10:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:10:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:10:37,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:37,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 147 transitions, 1766 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:37,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:37,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:37,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:37,977 INFO L124 PetriNetUnfolderBase]: 886/1533 cut-off events. [2024-05-12 12:10:37,977 INFO L125 PetriNetUnfolderBase]: For 13162/13162 co-relation queries the response was YES. [2024-05-12 12:10:37,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8420 conditions, 1533 events. 886/1533 cut-off events. For 13162/13162 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8426 event pairs, 100 based on Foata normal form. 1/1511 useless extension candidates. Maximal degree in co-relation 8351. Up to 1167 conditions per place. [2024-05-12 12:10:37,989 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 131 selfloop transitions, 52 changer transitions 0/190 dead transitions. [2024-05-12 12:10:37,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 190 transitions, 2305 flow [2024-05-12 12:10:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:10:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:10:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 12:10:37,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-05-12 12:10:37,990 INFO L175 Difference]: Start difference. First operand has 144 places, 147 transitions, 1766 flow. Second operand 10 states and 176 transitions. [2024-05-12 12:10:37,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 190 transitions, 2305 flow [2024-05-12 12:10:38,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 190 transitions, 2173 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 12:10:38,025 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 1799 flow [2024-05-12 12:10:38,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1799, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2024-05-12 12:10:38,026 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2024-05-12 12:10:38,026 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 1799 flow [2024-05-12 12:10:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:38,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:38,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:38,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:10:38,027 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:38,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2019129413, now seen corresponding path program 6 times [2024-05-12 12:10:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619593279] [2024-05-12 12:10:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619593279] [2024-05-12 12:10:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619593279] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:43,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:10:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004190664] [2024-05-12 12:10:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:43,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:10:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:10:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:10:43,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:43,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 1799 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:44,336 INFO L124 PetriNetUnfolderBase]: 919/1590 cut-off events. [2024-05-12 12:10:44,337 INFO L125 PetriNetUnfolderBase]: For 14770/14770 co-relation queries the response was YES. [2024-05-12 12:10:44,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8448 conditions, 1590 events. 919/1590 cut-off events. For 14770/14770 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8773 event pairs, 113 based on Foata normal form. 3/1569 useless extension candidates. Maximal degree in co-relation 8379. Up to 985 conditions per place. [2024-05-12 12:10:44,347 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 133 selfloop transitions, 61 changer transitions 0/201 dead transitions. [2024-05-12 12:10:44,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 201 transitions, 2411 flow [2024-05-12 12:10:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 12:10:44,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 12:10:44,348 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 1799 flow. Second operand 9 states and 171 transitions. [2024-05-12 12:10:44,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 201 transitions, 2411 flow [2024-05-12 12:10:44,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 201 transitions, 2289 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 12:10:44,383 INFO L231 Difference]: Finished difference. Result has 151 places, 156 transitions, 1909 flow [2024-05-12 12:10:44,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1909, PETRI_PLACES=151, PETRI_TRANSITIONS=156} [2024-05-12 12:10:44,384 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2024-05-12 12:10:44,384 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 156 transitions, 1909 flow [2024-05-12 12:10:44,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:44,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:44,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:10:44,385 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:44,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379069, now seen corresponding path program 1 times [2024-05-12 12:10:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294674741] [2024-05-12 12:10:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294674741] [2024-05-12 12:10:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294674741] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:49,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:10:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077416124] [2024-05-12 12:10:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:49,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:10:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:10:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:10:49,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:49,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 156 transitions, 1909 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:49,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:49,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:49,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:50,309 INFO L124 PetriNetUnfolderBase]: 921/1670 cut-off events. [2024-05-12 12:10:50,309 INFO L125 PetriNetUnfolderBase]: For 15263/15263 co-relation queries the response was YES. [2024-05-12 12:10:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8829 conditions, 1670 events. 921/1670 cut-off events. For 15263/15263 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9735 event pairs, 241 based on Foata normal form. 2/1629 useless extension candidates. Maximal degree in co-relation 8758. Up to 1410 conditions per place. [2024-05-12 12:10:50,321 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 161 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2024-05-12 12:10:50,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 186 transitions, 2359 flow [2024-05-12 12:10:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-05-12 12:10:50,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2024-05-12 12:10:50,322 INFO L175 Difference]: Start difference. First operand has 151 places, 156 transitions, 1909 flow. Second operand 9 states and 150 transitions. [2024-05-12 12:10:50,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 186 transitions, 2359 flow [2024-05-12 12:10:50,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 186 transitions, 2258 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 12:10:50,363 INFO L231 Difference]: Finished difference. Result has 155 places, 158 transitions, 1871 flow [2024-05-12 12:10:50,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1871, PETRI_PLACES=155, PETRI_TRANSITIONS=158} [2024-05-12 12:10:50,363 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2024-05-12 12:10:50,363 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 158 transitions, 1871 flow [2024-05-12 12:10:50,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:50,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:50,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:50,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:10:50,364 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:50,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1533597653, now seen corresponding path program 7 times [2024-05-12 12:10:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099102164] [2024-05-12 12:10:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:10:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:10:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:10:56,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099102164] [2024-05-12 12:10:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099102164] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:10:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:10:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:10:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4614159] [2024-05-12 12:10:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:10:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:10:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:10:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:10:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:10:56,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:10:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 158 transitions, 1871 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:56,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:10:56,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:10:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:10:57,318 INFO L124 PetriNetUnfolderBase]: 954/1721 cut-off events. [2024-05-12 12:10:57,319 INFO L125 PetriNetUnfolderBase]: For 15960/15960 co-relation queries the response was YES. [2024-05-12 12:10:57,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8889 conditions, 1721 events. 954/1721 cut-off events. For 15960/15960 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10068 event pairs, 220 based on Foata normal form. 3/1681 useless extension candidates. Maximal degree in co-relation 8817. Up to 1342 conditions per place. [2024-05-12 12:10:57,330 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 163 selfloop transitions, 32 changer transitions 0/202 dead transitions. [2024-05-12 12:10:57,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 2462 flow [2024-05-12 12:10:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:10:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:10:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 12:10:57,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-05-12 12:10:57,332 INFO L175 Difference]: Start difference. First operand has 155 places, 158 transitions, 1871 flow. Second operand 9 states and 161 transitions. [2024-05-12 12:10:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 202 transitions, 2462 flow [2024-05-12 12:10:57,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 202 transitions, 2421 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 12:10:57,378 INFO L231 Difference]: Finished difference. Result has 157 places, 162 transitions, 1953 flow [2024-05-12 12:10:57,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1953, PETRI_PLACES=157, PETRI_TRANSITIONS=162} [2024-05-12 12:10:57,379 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-05-12 12:10:57,379 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 162 transitions, 1953 flow [2024-05-12 12:10:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:10:57,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:10:57,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:10:57,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:10:57,380 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:10:57,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:10:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1789204433, now seen corresponding path program 8 times [2024-05-12 12:10:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:10:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325396683] [2024-05-12 12:10:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:10:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:10:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325396683] [2024-05-12 12:11:03,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325396683] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:03,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:03,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:03,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366522200] [2024-05-12 12:11:03,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:03,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:03,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:03,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:03,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 162 transitions, 1953 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:03,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:03,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:04,695 INFO L124 PetriNetUnfolderBase]: 955/1743 cut-off events. [2024-05-12 12:11:04,696 INFO L125 PetriNetUnfolderBase]: For 16030/16030 co-relation queries the response was YES. [2024-05-12 12:11:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9058 conditions, 1743 events. 955/1743 cut-off events. For 16030/16030 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10317 event pairs, 239 based on Foata normal form. 1/1696 useless extension candidates. Maximal degree in co-relation 8985. Up to 1482 conditions per place. [2024-05-12 12:11:04,707 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 166 selfloop transitions, 25 changer transitions 0/198 dead transitions. [2024-05-12 12:11:04,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 198 transitions, 2495 flow [2024-05-12 12:11:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:11:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:11:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:11:04,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-05-12 12:11:04,709 INFO L175 Difference]: Start difference. First operand has 157 places, 162 transitions, 1953 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:11:04,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 198 transitions, 2495 flow [2024-05-12 12:11:04,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 198 transitions, 2404 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 12:11:04,755 INFO L231 Difference]: Finished difference. Result has 161 places, 168 transitions, 2014 flow [2024-05-12 12:11:04,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2014, PETRI_PLACES=161, PETRI_TRANSITIONS=168} [2024-05-12 12:11:04,755 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-05-12 12:11:04,756 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 168 transitions, 2014 flow [2024-05-12 12:11:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:04,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:04,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:04,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:11:04,756 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:04,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1670199867, now seen corresponding path program 1 times [2024-05-12 12:11:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503502115] [2024-05-12 12:11:04,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503502115] [2024-05-12 12:11:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503502115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:11:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868244579] [2024-05-12 12:11:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:04,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:11:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:11:04,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:11:05,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 12:11:05,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 168 transitions, 2014 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:05,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:05,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 12:11:05,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:05,715 INFO L124 PetriNetUnfolderBase]: 1985/3493 cut-off events. [2024-05-12 12:11:05,715 INFO L125 PetriNetUnfolderBase]: For 27436/27475 co-relation queries the response was YES. [2024-05-12 12:11:05,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17058 conditions, 3493 events. 1985/3493 cut-off events. For 27436/27475 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22587 event pairs, 394 based on Foata normal form. 22/3358 useless extension candidates. Maximal degree in co-relation 16982. Up to 1220 conditions per place. [2024-05-12 12:11:05,742 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 189 selfloop transitions, 84 changer transitions 189/502 dead transitions. [2024-05-12 12:11:05,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 502 transitions, 7144 flow [2024-05-12 12:11:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:11:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:11:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-05-12 12:11:05,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5735735735735735 [2024-05-12 12:11:05,743 INFO L175 Difference]: Start difference. First operand has 161 places, 168 transitions, 2014 flow. Second operand 9 states and 191 transitions. [2024-05-12 12:11:05,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 502 transitions, 7144 flow [2024-05-12 12:11:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 502 transitions, 7032 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 12:11:05,820 INFO L231 Difference]: Finished difference. Result has 171 places, 214 transitions, 2922 flow [2024-05-12 12:11:05,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2922, PETRI_PLACES=171, PETRI_TRANSITIONS=214} [2024-05-12 12:11:05,821 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-05-12 12:11:05,821 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 214 transitions, 2922 flow [2024-05-12 12:11:05,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:05,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:05,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:05,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:11:05,821 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:05,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 446383292, now seen corresponding path program 1 times [2024-05-12 12:11:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203136812] [2024-05-12 12:11:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203136812] [2024-05-12 12:11:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203136812] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306193798] [2024-05-12 12:11:14,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:14,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:14,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:14,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 214 transitions, 2922 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:14,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:14,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:14,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:15,861 INFO L124 PetriNetUnfolderBase]: 2160/4017 cut-off events. [2024-05-12 12:11:15,861 INFO L125 PetriNetUnfolderBase]: For 50778/50896 co-relation queries the response was YES. [2024-05-12 12:11:15,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21981 conditions, 4017 events. 2160/4017 cut-off events. For 50778/50896 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28246 event pairs, 544 based on Foata normal form. 93/4079 useless extension candidates. Maximal degree in co-relation 21899. Up to 2430 conditions per place. [2024-05-12 12:11:15,892 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 269 selfloop transitions, 48 changer transitions 10/336 dead transitions. [2024-05-12 12:11:15,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 336 transitions, 4771 flow [2024-05-12 12:11:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:11:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:11:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-05-12 12:11:15,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-05-12 12:11:15,894 INFO L175 Difference]: Start difference. First operand has 171 places, 214 transitions, 2922 flow. Second operand 11 states and 205 transitions. [2024-05-12 12:11:15,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 336 transitions, 4771 flow [2024-05-12 12:11:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 336 transitions, 4739 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-05-12 12:11:16,027 INFO L231 Difference]: Finished difference. Result has 187 places, 251 transitions, 3527 flow [2024-05-12 12:11:16,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3527, PETRI_PLACES=187, PETRI_TRANSITIONS=251} [2024-05-12 12:11:16,028 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places. [2024-05-12 12:11:16,028 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 251 transitions, 3527 flow [2024-05-12 12:11:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:16,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:16,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:16,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:11:16,028 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:16,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1831241386, now seen corresponding path program 2 times [2024-05-12 12:11:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198707584] [2024-05-12 12:11:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198707584] [2024-05-12 12:11:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198707584] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:21,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675487148] [2024-05-12 12:11:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:21,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:21,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:21,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 251 transitions, 3527 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:21,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:21,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:21,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:23,148 INFO L124 PetriNetUnfolderBase]: 2065/3636 cut-off events. [2024-05-12 12:11:23,148 INFO L125 PetriNetUnfolderBase]: For 57008/57253 co-relation queries the response was YES. [2024-05-12 12:11:23,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22285 conditions, 3636 events. 2065/3636 cut-off events. For 57008/57253 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23842 event pairs, 359 based on Foata normal form. 220/3814 useless extension candidates. Maximal degree in co-relation 22194. Up to 2215 conditions per place. [2024-05-12 12:11:23,178 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 173 selfloop transitions, 113 changer transitions 2/297 dead transitions. [2024-05-12 12:11:23,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 297 transitions, 4373 flow [2024-05-12 12:11:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:11:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:11:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:11:23,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-05-12 12:11:23,180 INFO L175 Difference]: Start difference. First operand has 187 places, 251 transitions, 3527 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:11:23,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 297 transitions, 4373 flow [2024-05-12 12:11:23,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 297 transitions, 4303 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 12:11:23,337 INFO L231 Difference]: Finished difference. Result has 191 places, 250 transitions, 3674 flow [2024-05-12 12:11:23,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3457, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3674, PETRI_PLACES=191, PETRI_TRANSITIONS=250} [2024-05-12 12:11:23,337 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2024-05-12 12:11:23,338 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 250 transitions, 3674 flow [2024-05-12 12:11:23,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:23,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:23,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:11:23,338 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:23,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1829363716, now seen corresponding path program 3 times [2024-05-12 12:11:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562640532] [2024-05-12 12:11:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562640532] [2024-05-12 12:11:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562640532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525582163] [2024-05-12 12:11:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:28,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:28,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:28,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 250 transitions, 3674 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:28,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:28,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:28,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:30,098 INFO L124 PetriNetUnfolderBase]: 2088/3692 cut-off events. [2024-05-12 12:11:30,098 INFO L125 PetriNetUnfolderBase]: For 61160/61353 co-relation queries the response was YES. [2024-05-12 12:11:30,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23073 conditions, 3692 events. 2088/3692 cut-off events. For 61160/61353 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24586 event pairs, 425 based on Foata normal form. 184/3828 useless extension candidates. Maximal degree in co-relation 22982. Up to 2707 conditions per place. [2024-05-12 12:11:30,131 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 178 selfloop transitions, 107 changer transitions 0/294 dead transitions. [2024-05-12 12:11:30,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 294 transitions, 4465 flow [2024-05-12 12:11:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:11:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:11:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:11:30,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-05-12 12:11:30,132 INFO L175 Difference]: Start difference. First operand has 191 places, 250 transitions, 3674 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:11:30,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 294 transitions, 4465 flow [2024-05-12 12:11:30,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 294 transitions, 4250 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 12:11:30,303 INFO L231 Difference]: Finished difference. Result has 193 places, 252 transitions, 3720 flow [2024-05-12 12:11:30,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3465, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3720, PETRI_PLACES=193, PETRI_TRANSITIONS=252} [2024-05-12 12:11:30,304 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 152 predicate places. [2024-05-12 12:11:30,304 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 252 transitions, 3720 flow [2024-05-12 12:11:30,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:30,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:30,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:30,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:11:30,304 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:30,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 915312142, now seen corresponding path program 4 times [2024-05-12 12:11:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646242895] [2024-05-12 12:11:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646242895] [2024-05-12 12:11:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646242895] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872243364] [2024-05-12 12:11:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:36,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:36,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:36,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 252 transitions, 3720 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:36,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:36,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:36,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:37,812 INFO L124 PetriNetUnfolderBase]: 2221/4078 cut-off events. [2024-05-12 12:11:37,813 INFO L125 PetriNetUnfolderBase]: For 65429/65576 co-relation queries the response was YES. [2024-05-12 12:11:37,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24539 conditions, 4078 events. 2221/4078 cut-off events. For 65429/65576 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 28259 event pairs, 467 based on Foata normal form. 134/4155 useless extension candidates. Maximal degree in co-relation 24448. Up to 2131 conditions per place. [2024-05-12 12:11:37,845 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 192 selfloop transitions, 108 changer transitions 0/309 dead transitions. [2024-05-12 12:11:37,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 309 transitions, 4731 flow [2024-05-12 12:11:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:11:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:11:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 12:11:37,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:11:37,847 INFO L175 Difference]: Start difference. First operand has 193 places, 252 transitions, 3720 flow. Second operand 10 states and 185 transitions. [2024-05-12 12:11:37,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 309 transitions, 4731 flow [2024-05-12 12:11:38,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 309 transitions, 4505 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:11:38,012 INFO L231 Difference]: Finished difference. Result has 197 places, 259 transitions, 3900 flow [2024-05-12 12:11:38,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3506, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3900, PETRI_PLACES=197, PETRI_TRANSITIONS=259} [2024-05-12 12:11:38,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2024-05-12 12:11:38,012 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 259 transitions, 3900 flow [2024-05-12 12:11:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:38,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:38,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:11:38,013 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:38,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 915316017, now seen corresponding path program 1 times [2024-05-12 12:11:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566788413] [2024-05-12 12:11:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:43,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566788413] [2024-05-12 12:11:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566788413] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:43,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579218599] [2024-05-12 12:11:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:43,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:43,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:43,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 259 transitions, 3900 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:43,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:43,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:43,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:44,792 INFO L124 PetriNetUnfolderBase]: 2250/3987 cut-off events. [2024-05-12 12:11:44,792 INFO L125 PetriNetUnfolderBase]: For 69957/70119 co-relation queries the response was YES. [2024-05-12 12:11:44,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25655 conditions, 3987 events. 2250/3987 cut-off events. For 69957/70119 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26749 event pairs, 341 based on Foata normal form. 147/4071 useless extension candidates. Maximal degree in co-relation 25561. Up to 1972 conditions per place. [2024-05-12 12:11:44,829 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 193 selfloop transitions, 107 changer transitions 0/309 dead transitions. [2024-05-12 12:11:44,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 309 transitions, 4816 flow [2024-05-12 12:11:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:11:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:11:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 12:11:44,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-05-12 12:11:44,832 INFO L175 Difference]: Start difference. First operand has 197 places, 259 transitions, 3900 flow. Second operand 10 states and 186 transitions. [2024-05-12 12:11:44,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 309 transitions, 4816 flow [2024-05-12 12:11:45,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 309 transitions, 4672 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:11:45,028 INFO L231 Difference]: Finished difference. Result has 201 places, 263 transitions, 4036 flow [2024-05-12 12:11:45,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3756, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4036, PETRI_PLACES=201, PETRI_TRANSITIONS=263} [2024-05-12 12:11:45,029 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places. [2024-05-12 12:11:45,029 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 263 transitions, 4036 flow [2024-05-12 12:11:45,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:45,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:45,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:11:45,029 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:45,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1002157557, now seen corresponding path program 2 times [2024-05-12 12:11:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932195801] [2024-05-12 12:11:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932195801] [2024-05-12 12:11:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932195801] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943154438] [2024-05-12 12:11:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:51,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:51,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:51,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 263 transitions, 4036 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:51,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:51,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:51,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:11:52,903 INFO L124 PetriNetUnfolderBase]: 2394/4382 cut-off events. [2024-05-12 12:11:52,903 INFO L125 PetriNetUnfolderBase]: For 77172/77291 co-relation queries the response was YES. [2024-05-12 12:11:52,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27823 conditions, 4382 events. 2394/4382 cut-off events. For 77172/77291 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30923 event pairs, 502 based on Foata normal form. 98/4410 useless extension candidates. Maximal degree in co-relation 27728. Up to 3144 conditions per place. [2024-05-12 12:11:52,948 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 264 selfloop transitions, 56 changer transitions 0/329 dead transitions. [2024-05-12 12:11:52,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 329 transitions, 5256 flow [2024-05-12 12:11:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:11:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:11:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 12:11:52,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-05-12 12:11:52,950 INFO L175 Difference]: Start difference. First operand has 201 places, 263 transitions, 4036 flow. Second operand 10 states and 179 transitions. [2024-05-12 12:11:52,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 329 transitions, 5256 flow [2024-05-12 12:11:53,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 329 transitions, 5120 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:11:53,197 INFO L231 Difference]: Finished difference. Result has 207 places, 281 transitions, 4358 flow [2024-05-12 12:11:53,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3912, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4358, PETRI_PLACES=207, PETRI_TRANSITIONS=281} [2024-05-12 12:11:53,197 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 166 predicate places. [2024-05-12 12:11:53,198 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 281 transitions, 4358 flow [2024-05-12 12:11:53,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:53,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:11:53,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:11:53,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:11:53,198 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:11:53,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:11:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1002151822, now seen corresponding path program 5 times [2024-05-12 12:11:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:11:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517143946] [2024-05-12 12:11:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:11:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:11:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:11:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:11:59,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:11:59,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517143946] [2024-05-12 12:11:59,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517143946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:11:59,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:11:59,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:11:59,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696895451] [2024-05-12 12:11:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:11:59,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:11:59,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:11:59,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:11:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:11:59,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:11:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 281 transitions, 4358 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:11:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:11:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:11:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:01,332 INFO L124 PetriNetUnfolderBase]: 2420/4487 cut-off events. [2024-05-12 12:12:01,332 INFO L125 PetriNetUnfolderBase]: For 79502/79627 co-relation queries the response was YES. [2024-05-12 12:12:01,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28916 conditions, 4487 events. 2420/4487 cut-off events. For 79502/79627 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32255 event pairs, 567 based on Foata normal form. 109/4520 useless extension candidates. Maximal degree in co-relation 28817. Up to 3523 conditions per place. [2024-05-12 12:12:01,372 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 239 selfloop transitions, 78 changer transitions 0/326 dead transitions. [2024-05-12 12:12:01,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 326 transitions, 5266 flow [2024-05-12 12:12:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 12:12:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-05-12 12:12:01,374 INFO L175 Difference]: Start difference. First operand has 207 places, 281 transitions, 4358 flow. Second operand 10 states and 175 transitions. [2024-05-12 12:12:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 326 transitions, 5266 flow [2024-05-12 12:12:01,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 326 transitions, 5166 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:12:01,622 INFO L231 Difference]: Finished difference. Result has 212 places, 287 transitions, 4584 flow [2024-05-12 12:12:01,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4258, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4584, PETRI_PLACES=212, PETRI_TRANSITIONS=287} [2024-05-12 12:12:01,623 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 171 predicate places. [2024-05-12 12:12:01,623 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 287 transitions, 4584 flow [2024-05-12 12:12:01,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:01,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:01,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:01,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:12:01,624 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:01,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1742527601, now seen corresponding path program 3 times [2024-05-12 12:12:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974581510] [2024-05-12 12:12:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974581510] [2024-05-12 12:12:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974581510] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:06,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728911399] [2024-05-12 12:12:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:06,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:06,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 287 transitions, 4584 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:06,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:06,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:06,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:08,255 INFO L124 PetriNetUnfolderBase]: 2456/4323 cut-off events. [2024-05-12 12:12:08,255 INFO L125 PetriNetUnfolderBase]: For 83140/83339 co-relation queries the response was YES. [2024-05-12 12:12:08,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29069 conditions, 4323 events. 2456/4323 cut-off events. For 83140/83339 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29310 event pairs, 328 based on Foata normal form. 183/4426 useless extension candidates. Maximal degree in co-relation 28968. Up to 2900 conditions per place. [2024-05-12 12:12:08,295 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 214 selfloop transitions, 111 changer transitions 0/334 dead transitions. [2024-05-12 12:12:08,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 334 transitions, 5480 flow [2024-05-12 12:12:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 12:12:08,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-05-12 12:12:08,296 INFO L175 Difference]: Start difference. First operand has 212 places, 287 transitions, 4584 flow. Second operand 10 states and 184 transitions. [2024-05-12 12:12:08,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 334 transitions, 5480 flow [2024-05-12 12:12:08,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 334 transitions, 5352 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-05-12 12:12:08,584 INFO L231 Difference]: Finished difference. Result has 216 places, 291 transitions, 4775 flow [2024-05-12 12:12:08,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4456, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4775, PETRI_PLACES=216, PETRI_TRANSITIONS=291} [2024-05-12 12:12:08,584 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places. [2024-05-12 12:12:08,584 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 291 transitions, 4775 flow [2024-05-12 12:12:08,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:08,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:08,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:08,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:12:08,585 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:08,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1742671751, now seen corresponding path program 4 times [2024-05-12 12:12:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:08,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072773428] [2024-05-12 12:12:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:14,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072773428] [2024-05-12 12:12:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072773428] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88963139] [2024-05-12 12:12:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:14,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:14,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:14,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 291 transitions, 4775 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:14,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:14,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:14,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:15,826 INFO L124 PetriNetUnfolderBase]: 2504/4561 cut-off events. [2024-05-12 12:12:15,826 INFO L125 PetriNetUnfolderBase]: For 90083/90203 co-relation queries the response was YES. [2024-05-12 12:12:15,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30436 conditions, 4561 events. 2504/4561 cut-off events. For 90083/90203 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32162 event pairs, 533 based on Foata normal form. 84/4569 useless extension candidates. Maximal degree in co-relation 30333. Up to 3212 conditions per place. [2024-05-12 12:12:15,866 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 272 selfloop transitions, 67 changer transitions 0/348 dead transitions. [2024-05-12 12:12:15,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 348 transitions, 5894 flow [2024-05-12 12:12:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 12:12:15,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-05-12 12:12:15,868 INFO L175 Difference]: Start difference. First operand has 216 places, 291 transitions, 4775 flow. Second operand 10 states and 182 transitions. [2024-05-12 12:12:15,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 348 transitions, 5894 flow [2024-05-12 12:12:16,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 348 transitions, 5713 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 12:12:16,156 INFO L231 Difference]: Finished difference. Result has 222 places, 299 transitions, 4891 flow [2024-05-12 12:12:16,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4618, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4891, PETRI_PLACES=222, PETRI_TRANSITIONS=299} [2024-05-12 12:12:16,157 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 181 predicate places. [2024-05-12 12:12:16,157 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 299 transitions, 4891 flow [2024-05-12 12:12:16,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:16,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:16,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:16,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:12:16,158 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:16,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1742675626, now seen corresponding path program 6 times [2024-05-12 12:12:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008787168] [2024-05-12 12:12:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:22,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008787168] [2024-05-12 12:12:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008787168] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474438024] [2024-05-12 12:12:22,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:22,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:22,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:22,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:22,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:22,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:22,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 299 transitions, 4891 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:22,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:22,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:22,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:23,876 INFO L124 PetriNetUnfolderBase]: 2569/4537 cut-off events. [2024-05-12 12:12:23,876 INFO L125 PetriNetUnfolderBase]: For 101073/101293 co-relation queries the response was YES. [2024-05-12 12:12:23,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31246 conditions, 4537 events. 2569/4537 cut-off events. For 101073/101293 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 31097 event pairs, 499 based on Foata normal form. 176/4618 useless extension candidates. Maximal degree in co-relation 31140. Up to 3545 conditions per place. [2024-05-12 12:12:23,918 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 237 selfloop transitions, 98 changer transitions 0/344 dead transitions. [2024-05-12 12:12:23,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 344 transitions, 5903 flow [2024-05-12 12:12:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:12:23,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-05-12 12:12:23,919 INFO L175 Difference]: Start difference. First operand has 222 places, 299 transitions, 4891 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:12:23,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 344 transitions, 5903 flow [2024-05-12 12:12:24,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 344 transitions, 5773 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 12:12:24,218 INFO L231 Difference]: Finished difference. Result has 227 places, 303 transitions, 5052 flow [2024-05-12 12:12:24,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4761, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5052, PETRI_PLACES=227, PETRI_TRANSITIONS=303} [2024-05-12 12:12:24,219 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places. [2024-05-12 12:12:24,219 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 303 transitions, 5052 flow [2024-05-12 12:12:24,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:24,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:24,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:24,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:12:24,219 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:24,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -25779168, now seen corresponding path program 7 times [2024-05-12 12:12:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316793862] [2024-05-12 12:12:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:30,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316793862] [2024-05-12 12:12:30,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316793862] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:30,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:30,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202014853] [2024-05-12 12:12:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:30,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:30,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:30,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 303 transitions, 5052 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:30,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:30,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:30,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:31,629 INFO L124 PetriNetUnfolderBase]: 2563/4527 cut-off events. [2024-05-12 12:12:31,630 INFO L125 PetriNetUnfolderBase]: For 100482/100702 co-relation queries the response was YES. [2024-05-12 12:12:31,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31068 conditions, 4527 events. 2563/4527 cut-off events. For 100482/100702 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 31017 event pairs, 509 based on Foata normal form. 176/4608 useless extension candidates. Maximal degree in co-relation 30960. Up to 3689 conditions per place. [2024-05-12 12:12:31,673 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 238 selfloop transitions, 95 changer transitions 0/342 dead transitions. [2024-05-12 12:12:31,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 342 transitions, 5892 flow [2024-05-12 12:12:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 12:12:31,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-05-12 12:12:31,675 INFO L175 Difference]: Start difference. First operand has 227 places, 303 transitions, 5052 flow. Second operand 10 states and 176 transitions. [2024-05-12 12:12:31,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 342 transitions, 5892 flow [2024-05-12 12:12:32,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 342 transitions, 5732 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 12:12:32,017 INFO L231 Difference]: Finished difference. Result has 230 places, 303 transitions, 5089 flow [2024-05-12 12:12:32,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4892, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5089, PETRI_PLACES=230, PETRI_TRANSITIONS=303} [2024-05-12 12:12:32,018 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-05-12 12:12:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 303 transitions, 5089 flow [2024-05-12 12:12:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:32,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:32,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:12:32,019 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:32,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1831350644, now seen corresponding path program 8 times [2024-05-12 12:12:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635356548] [2024-05-12 12:12:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635356548] [2024-05-12 12:12:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635356548] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501852733] [2024-05-12 12:12:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:38,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:38,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 303 transitions, 5089 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:38,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:38,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:38,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:39,722 INFO L124 PetriNetUnfolderBase]: 2614/4538 cut-off events. [2024-05-12 12:12:39,723 INFO L125 PetriNetUnfolderBase]: For 101090/101304 co-relation queries the response was YES. [2024-05-12 12:12:39,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31701 conditions, 4538 events. 2614/4538 cut-off events. For 101090/101304 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30725 event pairs, 406 based on Foata normal form. 190/4624 useless extension candidates. Maximal degree in co-relation 31592. Up to 3414 conditions per place. [2024-05-12 12:12:39,769 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 212 selfloop transitions, 129 changer transitions 1/351 dead transitions. [2024-05-12 12:12:39,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 351 transitions, 6096 flow [2024-05-12 12:12:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 12:12:39,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:12:39,772 INFO L175 Difference]: Start difference. First operand has 230 places, 303 transitions, 5089 flow. Second operand 10 states and 185 transitions. [2024-05-12 12:12:39,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 351 transitions, 6096 flow [2024-05-12 12:12:40,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 351 transitions, 5907 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:12:40,142 INFO L231 Difference]: Finished difference. Result has 232 places, 304 transitions, 5190 flow [2024-05-12 12:12:40,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4900, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5190, PETRI_PLACES=232, PETRI_TRANSITIONS=304} [2024-05-12 12:12:40,142 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places. [2024-05-12 12:12:40,142 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 304 transitions, 5190 flow [2024-05-12 12:12:40,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:40,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:40,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:40,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:12:40,143 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:40,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1831354364, now seen corresponding path program 9 times [2024-05-12 12:12:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154775509] [2024-05-12 12:12:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154775509] [2024-05-12 12:12:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154775509] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469759696] [2024-05-12 12:12:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:45,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:45,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:45,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 304 transitions, 5190 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:45,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:45,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:47,494 INFO L124 PetriNetUnfolderBase]: 2700/4895 cut-off events. [2024-05-12 12:12:47,494 INFO L125 PetriNetUnfolderBase]: For 108287/108440 co-relation queries the response was YES. [2024-05-12 12:12:47,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33406 conditions, 4895 events. 2700/4895 cut-off events. For 108287/108440 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 34961 event pairs, 383 based on Foata normal form. 137/4936 useless extension candidates. Maximal degree in co-relation 33296. Up to 2896 conditions per place. [2024-05-12 12:12:47,546 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 215 selfloop transitions, 145 changer transitions 0/369 dead transitions. [2024-05-12 12:12:47,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 369 transitions, 6411 flow [2024-05-12 12:12:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 12:12:47,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-05-12 12:12:47,548 INFO L175 Difference]: Start difference. First operand has 232 places, 304 transitions, 5190 flow. Second operand 10 states and 191 transitions. [2024-05-12 12:12:47,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 369 transitions, 6411 flow [2024-05-12 12:12:47,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 369 transitions, 6044 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 12:12:47,937 INFO L231 Difference]: Finished difference. Result has 237 places, 321 transitions, 5574 flow [2024-05-12 12:12:47,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4831, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5574, PETRI_PLACES=237, PETRI_TRANSITIONS=321} [2024-05-12 12:12:47,937 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 196 predicate places. [2024-05-12 12:12:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 321 transitions, 5574 flow [2024-05-12 12:12:47,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:47,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:47,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:47,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:12:47,938 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:47,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash 281066801, now seen corresponding path program 5 times [2024-05-12 12:12:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:47,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394693917] [2024-05-12 12:12:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:12:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:12:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:12:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394693917] [2024-05-12 12:12:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394693917] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:12:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:12:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:12:54,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986305339] [2024-05-12 12:12:54,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:12:54,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:12:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:12:54,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:12:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:12:54,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:12:54,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 321 transitions, 5574 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:54,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:12:54,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:12:54,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:12:56,196 INFO L124 PetriNetUnfolderBase]: 2796/5076 cut-off events. [2024-05-12 12:12:56,196 INFO L125 PetriNetUnfolderBase]: For 114853/115017 co-relation queries the response was YES. [2024-05-12 12:12:56,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36164 conditions, 5076 events. 2796/5076 cut-off events. For 114853/115017 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 36437 event pairs, 497 based on Foata normal form. 145/5128 useless extension candidates. Maximal degree in co-relation 36050. Up to 3355 conditions per place. [2024-05-12 12:12:56,253 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 305 selfloop transitions, 89 changer transitions 0/403 dead transitions. [2024-05-12 12:12:56,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 403 transitions, 7280 flow [2024-05-12 12:12:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:12:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:12:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 12:12:56,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 12:12:56,254 INFO L175 Difference]: Start difference. First operand has 237 places, 321 transitions, 5574 flow. Second operand 10 states and 190 transitions. [2024-05-12 12:12:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 403 transitions, 7280 flow [2024-05-12 12:12:56,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 403 transitions, 7140 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 12:12:56,773 INFO L231 Difference]: Finished difference. Result has 246 places, 349 transitions, 6276 flow [2024-05-12 12:12:56,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6276, PETRI_PLACES=246, PETRI_TRANSITIONS=349} [2024-05-12 12:12:56,773 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places. [2024-05-12 12:12:56,774 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 349 transitions, 6276 flow [2024-05-12 12:12:56,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:12:56,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:12:56,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:12:56,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:12:56,774 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:12:56,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:12:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 286788657, now seen corresponding path program 1 times [2024-05-12 12:12:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:12:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804667484] [2024-05-12 12:12:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:12:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:12:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804667484] [2024-05-12 12:13:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804667484] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:02,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:02,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027835525] [2024-05-12 12:13:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:02,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:02,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:02,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:02,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 349 transitions, 6276 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:02,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:02,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:03,986 INFO L124 PetriNetUnfolderBase]: 2831/5196 cut-off events. [2024-05-12 12:13:03,986 INFO L125 PetriNetUnfolderBase]: For 129005/129154 co-relation queries the response was YES. [2024-05-12 12:13:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37196 conditions, 5196 events. 2831/5196 cut-off events. For 129005/129154 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 37880 event pairs, 546 based on Foata normal form. 113/5212 useless extension candidates. Maximal degree in co-relation 37079. Up to 3872 conditions per place. [2024-05-12 12:13:04,174 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 328 selfloop transitions, 54 changer transitions 0/391 dead transitions. [2024-05-12 12:13:04,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 391 transitions, 7237 flow [2024-05-12 12:13:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:13:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:13:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 12:13:04,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-05-12 12:13:04,176 INFO L175 Difference]: Start difference. First operand has 246 places, 349 transitions, 6276 flow. Second operand 10 states and 179 transitions. [2024-05-12 12:13:04,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 391 transitions, 7237 flow [2024-05-12 12:13:04,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 391 transitions, 7191 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 12:13:04,694 INFO L231 Difference]: Finished difference. Result has 253 places, 351 transitions, 6369 flow [2024-05-12 12:13:04,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6369, PETRI_PLACES=253, PETRI_TRANSITIONS=351} [2024-05-12 12:13:04,694 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places. [2024-05-12 12:13:04,695 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 351 transitions, 6369 flow [2024-05-12 12:13:04,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:04,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:04,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:13:04,695 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:04,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2030272869, now seen corresponding path program 6 times [2024-05-12 12:13:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358496518] [2024-05-12 12:13:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358496518] [2024-05-12 12:13:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358496518] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732490229] [2024-05-12 12:13:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:11,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:11,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 351 transitions, 6369 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:11,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:11,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:11,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:12,888 INFO L124 PetriNetUnfolderBase]: 2907/5355 cut-off events. [2024-05-12 12:13:12,888 INFO L125 PetriNetUnfolderBase]: For 137739/137884 co-relation queries the response was YES. [2024-05-12 12:13:12,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38985 conditions, 5355 events. 2907/5355 cut-off events. For 137739/137884 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 39511 event pairs, 527 based on Foata normal form. 107/5368 useless extension candidates. Maximal degree in co-relation 38866. Up to 3854 conditions per place. [2024-05-12 12:13:12,939 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 331 selfloop transitions, 62 changer transitions 0/402 dead transitions. [2024-05-12 12:13:12,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 402 transitions, 7575 flow [2024-05-12 12:13:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:13:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:13:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 12:13:12,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-05-12 12:13:12,941 INFO L175 Difference]: Start difference. First operand has 253 places, 351 transitions, 6369 flow. Second operand 10 states and 186 transitions. [2024-05-12 12:13:12,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 402 transitions, 7575 flow [2024-05-12 12:13:13,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 402 transitions, 7466 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-05-12 12:13:13,428 INFO L231 Difference]: Finished difference. Result has 257 places, 357 transitions, 6542 flow [2024-05-12 12:13:13,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6260, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6542, PETRI_PLACES=257, PETRI_TRANSITIONS=357} [2024-05-12 12:13:13,429 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2024-05-12 12:13:13,429 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 357 transitions, 6542 flow [2024-05-12 12:13:13,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:13,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:13,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:13,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:13:13,430 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:13,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 286780721, now seen corresponding path program 7 times [2024-05-12 12:13:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957547666] [2024-05-12 12:13:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957547666] [2024-05-12 12:13:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957547666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628790150] [2024-05-12 12:13:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:18,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:19,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:19,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 357 transitions, 6542 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:19,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:19,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:19,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:20,998 INFO L124 PetriNetUnfolderBase]: 2902/5336 cut-off events. [2024-05-12 12:13:20,998 INFO L125 PetriNetUnfolderBase]: For 141527/141679 co-relation queries the response was YES. [2024-05-12 12:13:21,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39018 conditions, 5336 events. 2902/5336 cut-off events. For 141527/141679 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 39223 event pairs, 536 based on Foata normal form. 116/5358 useless extension candidates. Maximal degree in co-relation 38897. Up to 3971 conditions per place. [2024-05-12 12:13:21,062 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 345 selfloop transitions, 62 changer transitions 6/422 dead transitions. [2024-05-12 12:13:21,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 422 transitions, 7835 flow [2024-05-12 12:13:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 12:13:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 12:13:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2024-05-12 12:13:21,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760914760914761 [2024-05-12 12:13:21,063 INFO L175 Difference]: Start difference. First operand has 257 places, 357 transitions, 6542 flow. Second operand 13 states and 229 transitions. [2024-05-12 12:13:21,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 422 transitions, 7835 flow [2024-05-12 12:13:21,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 422 transitions, 7687 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:13:21,742 INFO L231 Difference]: Finished difference. Result has 264 places, 365 transitions, 6737 flow [2024-05-12 12:13:21,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6404, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6737, PETRI_PLACES=264, PETRI_TRANSITIONS=365} [2024-05-12 12:13:21,743 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places. [2024-05-12 12:13:21,743 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 365 transitions, 6737 flow [2024-05-12 12:13:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:21,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:21,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:21,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:13:21,744 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:21,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 281210796, now seen corresponding path program 10 times [2024-05-12 12:13:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515504643] [2024-05-12 12:13:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515504643] [2024-05-12 12:13:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515504643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:26,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:13:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018917984] [2024-05-12 12:13:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:26,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:13:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:13:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:13:26,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:26,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 365 transitions, 6737 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:26,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:26,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:26,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:28,215 INFO L124 PetriNetUnfolderBase]: 2908/5036 cut-off events. [2024-05-12 12:13:28,215 INFO L125 PetriNetUnfolderBase]: For 135118/135342 co-relation queries the response was YES. [2024-05-12 12:13:28,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38437 conditions, 5036 events. 2908/5036 cut-off events. For 135118/135342 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 34711 event pairs, 494 based on Foata normal form. 204/5114 useless extension candidates. Maximal degree in co-relation 38315. Up to 4302 conditions per place. [2024-05-12 12:13:28,272 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 288 selfloop transitions, 106 changer transitions 2/405 dead transitions. [2024-05-12 12:13:28,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 405 transitions, 7743 flow [2024-05-12 12:13:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:13:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:13:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:13:28,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-05-12 12:13:28,273 INFO L175 Difference]: Start difference. First operand has 264 places, 365 transitions, 6737 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:13:28,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 405 transitions, 7743 flow [2024-05-12 12:13:28,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 405 transitions, 7610 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-05-12 12:13:28,864 INFO L231 Difference]: Finished difference. Result has 266 places, 365 transitions, 6835 flow [2024-05-12 12:13:28,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6604, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6835, PETRI_PLACES=266, PETRI_TRANSITIONS=365} [2024-05-12 12:13:28,864 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places. [2024-05-12 12:13:28,865 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 365 transitions, 6835 flow [2024-05-12 12:13:28,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:28,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:28,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:13:28,865 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:28,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 281210951, now seen corresponding path program 8 times [2024-05-12 12:13:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511712524] [2024-05-12 12:13:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511712524] [2024-05-12 12:13:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511712524] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:13:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230789491] [2024-05-12 12:13:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:34,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:13:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:13:34,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:13:34,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:34,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 365 transitions, 6835 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:34,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:34,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:36,060 INFO L124 PetriNetUnfolderBase]: 2910/5028 cut-off events. [2024-05-12 12:13:36,061 INFO L125 PetriNetUnfolderBase]: For 136373/136546 co-relation queries the response was YES. [2024-05-12 12:13:36,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38386 conditions, 5028 events. 2910/5028 cut-off events. For 136373/136546 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 34742 event pairs, 303 based on Foata normal form. 152/5053 useless extension candidates. Maximal degree in co-relation 38262. Up to 3555 conditions per place. [2024-05-12 12:13:36,124 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 247 selfloop transitions, 161 changer transitions 0/417 dead transitions. [2024-05-12 12:13:36,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 417 transitions, 7997 flow [2024-05-12 12:13:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:13:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:13:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 12:13:36,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-05-12 12:13:36,125 INFO L175 Difference]: Start difference. First operand has 266 places, 365 transitions, 6835 flow. Second operand 10 states and 189 transitions. [2024-05-12 12:13:36,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 417 transitions, 7997 flow [2024-05-12 12:13:36,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 417 transitions, 7766 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-05-12 12:13:36,832 INFO L231 Difference]: Finished difference. Result has 271 places, 371 transitions, 7087 flow [2024-05-12 12:13:36,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6604, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7087, PETRI_PLACES=271, PETRI_TRANSITIONS=371} [2024-05-12 12:13:36,832 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 230 predicate places. [2024-05-12 12:13:36,832 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 371 transitions, 7087 flow [2024-05-12 12:13:36,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:36,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:36,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:36,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:13:36,833 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:36,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 286578911, now seen corresponding path program 9 times [2024-05-12 12:13:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364175715] [2024-05-12 12:13:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:41,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364175715] [2024-05-12 12:13:41,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364175715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074634429] [2024-05-12 12:13:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:41,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:42,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:42,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 371 transitions, 7087 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:42,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:42,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:42,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:43,999 INFO L124 PetriNetUnfolderBase]: 2915/5394 cut-off events. [2024-05-12 12:13:44,000 INFO L125 PetriNetUnfolderBase]: For 145023/145151 co-relation queries the response was YES. [2024-05-12 12:13:44,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39351 conditions, 5394 events. 2915/5394 cut-off events. For 145023/145151 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 39934 event pairs, 560 based on Foata normal form. 94/5389 useless extension candidates. Maximal degree in co-relation 39226. Up to 4011 conditions per place. [2024-05-12 12:13:44,054 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 348 selfloop transitions, 61 changer transitions 0/418 dead transitions. [2024-05-12 12:13:44,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 418 transitions, 8117 flow [2024-05-12 12:13:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:13:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:13:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 12:13:44,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 12:13:44,055 INFO L175 Difference]: Start difference. First operand has 271 places, 371 transitions, 7087 flow. Second operand 11 states and 198 transitions. [2024-05-12 12:13:44,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 418 transitions, 8117 flow [2024-05-12 12:13:44,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 418 transitions, 7786 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-05-12 12:13:44,580 INFO L231 Difference]: Finished difference. Result has 276 places, 371 transitions, 6886 flow [2024-05-12 12:13:44,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6756, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6886, PETRI_PLACES=276, PETRI_TRANSITIONS=371} [2024-05-12 12:13:44,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-05-12 12:13:44,581 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 371 transitions, 6886 flow [2024-05-12 12:13:44,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:44,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:44,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:44,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:13:44,581 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:44,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash 286573176, now seen corresponding path program 11 times [2024-05-12 12:13:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625928266] [2024-05-12 12:13:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625928266] [2024-05-12 12:13:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625928266] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546530780] [2024-05-12 12:13:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:50,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:51,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:51,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 371 transitions, 6886 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:51,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:51,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:51,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:13:52,770 INFO L124 PetriNetUnfolderBase]: 2915/5297 cut-off events. [2024-05-12 12:13:52,771 INFO L125 PetriNetUnfolderBase]: For 141335/141572 co-relation queries the response was YES. [2024-05-12 12:13:52,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38894 conditions, 5297 events. 2915/5297 cut-off events. For 141335/141572 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 38565 event pairs, 591 based on Foata normal form. 213/5405 useless extension candidates. Maximal degree in co-relation 38767. Up to 4296 conditions per place. [2024-05-12 12:13:52,833 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 318 selfloop transitions, 89 changer transitions 0/416 dead transitions. [2024-05-12 12:13:52,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 416 transitions, 7910 flow [2024-05-12 12:13:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:13:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:13:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-05-12 12:13:52,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-05-12 12:13:52,834 INFO L175 Difference]: Start difference. First operand has 276 places, 371 transitions, 6886 flow. Second operand 11 states and 191 transitions. [2024-05-12 12:13:52,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 416 transitions, 7910 flow [2024-05-12 12:13:53,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 416 transitions, 7778 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-05-12 12:13:53,470 INFO L231 Difference]: Finished difference. Result has 277 places, 372 transitions, 6951 flow [2024-05-12 12:13:53,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6754, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6951, PETRI_PLACES=277, PETRI_TRANSITIONS=372} [2024-05-12 12:13:53,471 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 236 predicate places. [2024-05-12 12:13:53,471 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 372 transitions, 6951 flow [2024-05-12 12:13:53,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:53,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:13:53,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:13:53,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:13:53,472 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:13:53,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:13:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 296887864, now seen corresponding path program 12 times [2024-05-12 12:13:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:13:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591636101] [2024-05-12 12:13:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:13:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:13:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:13:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:13:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:13:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591636101] [2024-05-12 12:13:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591636101] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:13:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:13:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:13:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354053151] [2024-05-12 12:13:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:13:58,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:13:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:13:58,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:13:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:13:58,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:13:58,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 372 transitions, 6951 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:13:58,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:13:58,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:13:58,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:00,567 INFO L124 PetriNetUnfolderBase]: 2958/5341 cut-off events. [2024-05-12 12:14:00,567 INFO L125 PetriNetUnfolderBase]: For 143090/143288 co-relation queries the response was YES. [2024-05-12 12:14:00,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39356 conditions, 5341 events. 2958/5341 cut-off events. For 143090/143288 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 38748 event pairs, 1038 based on Foata normal form. 112/5322 useless extension candidates. Maximal degree in co-relation 39229. Up to 4668 conditions per place. [2024-05-12 12:14:00,633 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 347 selfloop transitions, 62 changer transitions 0/418 dead transitions. [2024-05-12 12:14:00,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 418 transitions, 8102 flow [2024-05-12 12:14:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:14:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:14:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-05-12 12:14:00,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-05-12 12:14:00,634 INFO L175 Difference]: Start difference. First operand has 277 places, 372 transitions, 6951 flow. Second operand 10 states and 168 transitions. [2024-05-12 12:14:00,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 418 transitions, 8102 flow [2024-05-12 12:14:01,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 418 transitions, 7932 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:14:01,267 INFO L231 Difference]: Finished difference. Result has 281 places, 382 transitions, 7120 flow [2024-05-12 12:14:01,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6789, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7120, PETRI_PLACES=281, PETRI_TRANSITIONS=382} [2024-05-12 12:14:01,267 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 240 predicate places. [2024-05-12 12:14:01,267 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 382 transitions, 7120 flow [2024-05-12 12:14:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:01,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:01,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:14:01,268 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:01,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 296888019, now seen corresponding path program 10 times [2024-05-12 12:14:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022741712] [2024-05-12 12:14:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022741712] [2024-05-12 12:14:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022741712] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401650490] [2024-05-12 12:14:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:06,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:06,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:06,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 382 transitions, 7120 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:06,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:06,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:06,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:08,857 INFO L124 PetriNetUnfolderBase]: 2988/5400 cut-off events. [2024-05-12 12:14:08,857 INFO L125 PetriNetUnfolderBase]: For 146366/146557 co-relation queries the response was YES. [2024-05-12 12:14:08,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39786 conditions, 5400 events. 2988/5400 cut-off events. For 146366/146557 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 39229 event pairs, 1063 based on Foata normal form. 102/5378 useless extension candidates. Maximal degree in co-relation 39656. Up to 4631 conditions per place. [2024-05-12 12:14:08,913 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 387 selfloop transitions, 37 changer transitions 0/433 dead transitions. [2024-05-12 12:14:08,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 433 transitions, 8309 flow [2024-05-12 12:14:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:14:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:14:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 12:14:08,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-05-12 12:14:08,914 INFO L175 Difference]: Start difference. First operand has 281 places, 382 transitions, 7120 flow. Second operand 11 states and 193 transitions. [2024-05-12 12:14:08,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 433 transitions, 8309 flow [2024-05-12 12:14:09,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 433 transitions, 8103 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-05-12 12:14:09,587 INFO L231 Difference]: Finished difference. Result has 286 places, 388 transitions, 7145 flow [2024-05-12 12:14:09,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6916, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7145, PETRI_PLACES=286, PETRI_TRANSITIONS=388} [2024-05-12 12:14:09,588 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places. [2024-05-12 12:14:09,588 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 388 transitions, 7145 flow [2024-05-12 12:14:09,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:09,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:09,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:09,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:14:09,589 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:09,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 498452065, now seen corresponding path program 2 times [2024-05-12 12:14:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879183794] [2024-05-12 12:14:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879183794] [2024-05-12 12:14:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879183794] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439561385] [2024-05-12 12:14:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:15,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:15,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 388 transitions, 7145 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:15,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:15,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:15,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:17,206 INFO L124 PetriNetUnfolderBase]: 3005/5449 cut-off events. [2024-05-12 12:14:17,207 INFO L125 PetriNetUnfolderBase]: For 150094/150270 co-relation queries the response was YES. [2024-05-12 12:14:17,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40055 conditions, 5449 events. 3005/5449 cut-off events. For 150094/150270 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 39758 event pairs, 1040 based on Foata normal form. 91/5409 useless extension candidates. Maximal degree in co-relation 39925. Up to 4767 conditions per place. [2024-05-12 12:14:17,268 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 377 selfloop transitions, 36 changer transitions 0/422 dead transitions. [2024-05-12 12:14:17,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 422 transitions, 8146 flow [2024-05-12 12:14:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:14:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:14:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 12:14:17,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45645645645645644 [2024-05-12 12:14:17,270 INFO L175 Difference]: Start difference. First operand has 286 places, 388 transitions, 7145 flow. Second operand 9 states and 152 transitions. [2024-05-12 12:14:17,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 422 transitions, 8146 flow [2024-05-12 12:14:17,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 422 transitions, 8036 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-05-12 12:14:17,937 INFO L231 Difference]: Finished difference. Result has 291 places, 391 transitions, 7187 flow [2024-05-12 12:14:17,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7035, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7187, PETRI_PLACES=291, PETRI_TRANSITIONS=391} [2024-05-12 12:14:17,937 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places. [2024-05-12 12:14:17,937 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 391 transitions, 7187 flow [2024-05-12 12:14:17,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:17,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:14:17,938 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:17,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 491042755, now seen corresponding path program 3 times [2024-05-12 12:14:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012417883] [2024-05-12 12:14:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012417883] [2024-05-12 12:14:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012417883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391254485] [2024-05-12 12:14:23,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:23,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:23,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:23,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 391 transitions, 7187 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:23,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:23,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:23,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:25,304 INFO L124 PetriNetUnfolderBase]: 3031/5487 cut-off events. [2024-05-12 12:14:25,305 INFO L125 PetriNetUnfolderBase]: For 151407/151589 co-relation queries the response was YES. [2024-05-12 12:14:25,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 5487 events. 3031/5487 cut-off events. For 151407/151589 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 40012 event pairs, 1116 based on Foata normal form. 91/5444 useless extension candidates. Maximal degree in co-relation 40120. Up to 4889 conditions per place. [2024-05-12 12:14:25,368 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 394 selfloop transitions, 18 changer transitions 0/421 dead transitions. [2024-05-12 12:14:25,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 421 transitions, 8148 flow [2024-05-12 12:14:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:14:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:14:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-05-12 12:14:25,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44744744744744747 [2024-05-12 12:14:25,369 INFO L175 Difference]: Start difference. First operand has 291 places, 391 transitions, 7187 flow. Second operand 9 states and 149 transitions. [2024-05-12 12:14:25,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 421 transitions, 8148 flow [2024-05-12 12:14:26,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 421 transitions, 8059 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:14:26,154 INFO L231 Difference]: Finished difference. Result has 294 places, 392 transitions, 7159 flow [2024-05-12 12:14:26,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7098, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7159, PETRI_PLACES=294, PETRI_TRANSITIONS=392} [2024-05-12 12:14:26,154 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-05-12 12:14:26,155 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 392 transitions, 7159 flow [2024-05-12 12:14:26,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:26,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:26,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 12:14:26,155 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:26,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 297103345, now seen corresponding path program 4 times [2024-05-12 12:14:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:26,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422750099] [2024-05-12 12:14:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422750099] [2024-05-12 12:14:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422750099] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:14:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682121969] [2024-05-12 12:14:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:31,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:14:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:14:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:14:31,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 12:14:31,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 392 transitions, 7159 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:31,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:31,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 12:14:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:33,222 INFO L124 PetriNetUnfolderBase]: 2732/5079 cut-off events. [2024-05-12 12:14:33,223 INFO L125 PetriNetUnfolderBase]: For 151283/151474 co-relation queries the response was YES. [2024-05-12 12:14:33,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37511 conditions, 5079 events. 2732/5079 cut-off events. For 151283/151474 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 38334 event pairs, 1081 based on Foata normal form. 100/5042 useless extension candidates. Maximal degree in co-relation 37378. Up to 4429 conditions per place. [2024-05-12 12:14:33,285 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 379 selfloop transitions, 30 changer transitions 0/420 dead transitions. [2024-05-12 12:14:33,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 420 transitions, 8118 flow [2024-05-12 12:14:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:14:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:14:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-05-12 12:14:33,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-05-12 12:14:33,286 INFO L175 Difference]: Start difference. First operand has 294 places, 392 transitions, 7159 flow. Second operand 9 states and 157 transitions. [2024-05-12 12:14:33,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 420 transitions, 8118 flow [2024-05-12 12:14:33,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 420 transitions, 8078 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 12:14:33,873 INFO L231 Difference]: Finished difference. Result has 300 places, 394 transitions, 7220 flow [2024-05-12 12:14:33,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7119, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7220, PETRI_PLACES=300, PETRI_TRANSITIONS=394} [2024-05-12 12:14:33,873 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-05-12 12:14:33,873 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 394 transitions, 7220 flow [2024-05-12 12:14:33,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:33,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:33,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:33,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 12:14:33,874 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:33,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 491034819, now seen corresponding path program 11 times [2024-05-12 12:14:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663442808] [2024-05-12 12:14:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663442808] [2024-05-12 12:14:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663442808] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335445806] [2024-05-12 12:14:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:39,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:39,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:39,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 394 transitions, 7220 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:39,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:39,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:39,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:41,499 INFO L124 PetriNetUnfolderBase]: 3045/5503 cut-off events. [2024-05-12 12:14:41,499 INFO L125 PetriNetUnfolderBase]: For 154887/155057 co-relation queries the response was YES. [2024-05-12 12:14:41,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40278 conditions, 5503 events. 3045/5503 cut-off events. For 154887/155057 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 40116 event pairs, 1102 based on Foata normal form. 87/5454 useless extension candidates. Maximal degree in co-relation 40143. Up to 4834 conditions per place. [2024-05-12 12:14:41,564 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 394 selfloop transitions, 24 changer transitions 6/433 dead transitions. [2024-05-12 12:14:41,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 433 transitions, 8309 flow [2024-05-12 12:14:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:14:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:14:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 12:14:41,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-05-12 12:14:41,565 INFO L175 Difference]: Start difference. First operand has 300 places, 394 transitions, 7220 flow. Second operand 10 states and 169 transitions. [2024-05-12 12:14:41,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 433 transitions, 8309 flow [2024-05-12 12:14:42,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 433 transitions, 8255 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 12:14:42,449 INFO L231 Difference]: Finished difference. Result has 306 places, 398 transitions, 7314 flow [2024-05-12 12:14:42,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7166, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7314, PETRI_PLACES=306, PETRI_TRANSITIONS=398} [2024-05-12 12:14:42,450 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places. [2024-05-12 12:14:42,450 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 398 transitions, 7314 flow [2024-05-12 12:14:42,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:42,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:42,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:42,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 12:14:42,451 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:42,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash -84822863, now seen corresponding path program 12 times [2024-05-12 12:14:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558071015] [2024-05-12 12:14:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:47,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:47,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558071015] [2024-05-12 12:14:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558071015] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:47,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797933972] [2024-05-12 12:14:47,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:48,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:48,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 398 transitions, 7314 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:48,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:48,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:48,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:49,935 INFO L124 PetriNetUnfolderBase]: 3077/5562 cut-off events. [2024-05-12 12:14:49,936 INFO L125 PetriNetUnfolderBase]: For 155014/155185 co-relation queries the response was YES. [2024-05-12 12:14:49,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40537 conditions, 5562 events. 3077/5562 cut-off events. For 155014/155185 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 40594 event pairs, 1133 based on Foata normal form. 89/5514 useless extension candidates. Maximal degree in co-relation 40401. Up to 4854 conditions per place. [2024-05-12 12:14:50,014 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 392 selfloop transitions, 36 changer transitions 6/443 dead transitions. [2024-05-12 12:14:50,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 443 transitions, 8500 flow [2024-05-12 12:14:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:14:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:14:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 12:14:50,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44226044226044225 [2024-05-12 12:14:50,016 INFO L175 Difference]: Start difference. First operand has 306 places, 398 transitions, 7314 flow. Second operand 11 states and 180 transitions. [2024-05-12 12:14:50,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 443 transitions, 8500 flow [2024-05-12 12:14:50,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 443 transitions, 8442 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 12:14:50,861 INFO L231 Difference]: Finished difference. Result has 315 places, 408 transitions, 7559 flow [2024-05-12 12:14:50,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7256, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7559, PETRI_PLACES=315, PETRI_TRANSITIONS=408} [2024-05-12 12:14:50,862 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 274 predicate places. [2024-05-12 12:14:50,862 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 408 transitions, 7559 flow [2024-05-12 12:14:50,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:50,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:50,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:50,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 12:14:50,863 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:50,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -369236548, now seen corresponding path program 13 times [2024-05-12 12:14:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039499628] [2024-05-12 12:14:50,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:14:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:14:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:14:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039499628] [2024-05-12 12:14:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039499628] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:14:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:14:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:14:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630336071] [2024-05-12 12:14:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:14:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:14:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:14:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:14:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:14:57,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:14:57,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 408 transitions, 7559 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:57,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:14:57,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:14:57,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:14:58,908 INFO L124 PetriNetUnfolderBase]: 3065/5542 cut-off events. [2024-05-12 12:14:58,909 INFO L125 PetriNetUnfolderBase]: For 153441/153622 co-relation queries the response was YES. [2024-05-12 12:14:58,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40479 conditions, 5542 events. 3065/5542 cut-off events. For 153441/153622 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 40484 event pairs, 1067 based on Foata normal form. 98/5499 useless extension candidates. Maximal degree in co-relation 40339. Up to 4887 conditions per place. [2024-05-12 12:14:58,989 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 388 selfloop transitions, 46 changer transitions 0/443 dead transitions. [2024-05-12 12:14:58,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 443 transitions, 8579 flow [2024-05-12 12:14:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:14:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:14:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-05-12 12:14:58,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-05-12 12:14:58,990 INFO L175 Difference]: Start difference. First operand has 315 places, 408 transitions, 7559 flow. Second operand 10 states and 166 transitions. [2024-05-12 12:14:58,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 443 transitions, 8579 flow [2024-05-12 12:14:59,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 443 transitions, 8454 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-05-12 12:14:59,853 INFO L231 Difference]: Finished difference. Result has 319 places, 408 transitions, 7532 flow [2024-05-12 12:14:59,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7434, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7532, PETRI_PLACES=319, PETRI_TRANSITIONS=408} [2024-05-12 12:14:59,854 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-05-12 12:14:59,854 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 408 transitions, 7532 flow [2024-05-12 12:14:59,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:14:59,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:14:59,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:14:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 12:14:59,855 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:14:59,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:14:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -74369167, now seen corresponding path program 5 times [2024-05-12 12:14:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:14:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253499253] [2024-05-12 12:14:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:14:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:14:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:05,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:05,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253499253] [2024-05-12 12:15:05,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253499253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:05,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:05,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:05,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90025031] [2024-05-12 12:15:05,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:05,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:05,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:05,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:05,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:05,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 408 transitions, 7532 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:05,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:05,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:05,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:07,320 INFO L124 PetriNetUnfolderBase]: 3074/5581 cut-off events. [2024-05-12 12:15:07,320 INFO L125 PetriNetUnfolderBase]: For 151689/151854 co-relation queries the response was YES. [2024-05-12 12:15:07,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40207 conditions, 5581 events. 3074/5581 cut-off events. For 151689/151854 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 41071 event pairs, 1079 based on Foata normal form. 88/5528 useless extension candidates. Maximal degree in co-relation 40066. Up to 4902 conditions per place. [2024-05-12 12:15:07,391 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 402 selfloop transitions, 30 changer transitions 0/441 dead transitions. [2024-05-12 12:15:07,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 441 transitions, 8545 flow [2024-05-12 12:15:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:15:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:15:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:15:07,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-05-12 12:15:07,392 INFO L175 Difference]: Start difference. First operand has 319 places, 408 transitions, 7532 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:15:07,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 441 transitions, 8545 flow [2024-05-12 12:15:08,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 441 transitions, 8170 flow, removed 24 selfloop flow, removed 13 redundant places. [2024-05-12 12:15:08,134 INFO L231 Difference]: Finished difference. Result has 316 places, 411 transitions, 7273 flow [2024-05-12 12:15:08,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7157, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7273, PETRI_PLACES=316, PETRI_TRANSITIONS=411} [2024-05-12 12:15:08,135 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2024-05-12 12:15:08,135 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 411 transitions, 7273 flow [2024-05-12 12:15:08,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:08,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:08,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:08,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 12:15:08,136 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:08,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 490827429, now seen corresponding path program 13 times [2024-05-12 12:15:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337789555] [2024-05-12 12:15:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337789555] [2024-05-12 12:15:13,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337789555] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109843459] [2024-05-12 12:15:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:13,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:13,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:13,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 411 transitions, 7273 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:13,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:13,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:13,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:15,626 INFO L124 PetriNetUnfolderBase]: 3134/5673 cut-off events. [2024-05-12 12:15:15,626 INFO L125 PetriNetUnfolderBase]: For 151450/151623 co-relation queries the response was YES. [2024-05-12 12:15:15,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40624 conditions, 5673 events. 3134/5673 cut-off events. For 151450/151623 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 41762 event pairs, 1005 based on Foata normal form. 96/5634 useless extension candidates. Maximal degree in co-relation 40486. Up to 4544 conditions per place. [2024-05-12 12:15:15,708 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 358 selfloop transitions, 94 changer transitions 0/461 dead transitions. [2024-05-12 12:15:15,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 461 transitions, 8701 flow [2024-05-12 12:15:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:15:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:15:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 12:15:15,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-05-12 12:15:15,711 INFO L175 Difference]: Start difference. First operand has 316 places, 411 transitions, 7273 flow. Second operand 10 states and 176 transitions. [2024-05-12 12:15:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 461 transitions, 8701 flow [2024-05-12 12:15:16,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 461 transitions, 8620 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-05-12 12:15:16,698 INFO L231 Difference]: Finished difference. Result has 323 places, 421 transitions, 7733 flow [2024-05-12 12:15:16,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7192, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7733, PETRI_PLACES=323, PETRI_TRANSITIONS=421} [2024-05-12 12:15:16,699 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places. [2024-05-12 12:15:16,699 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 421 transitions, 7733 flow [2024-05-12 12:15:16,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:16,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:16,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:16,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 12:15:16,700 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:16,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:16,701 INFO L85 PathProgramCache]: Analyzing trace with hash -369230813, now seen corresponding path program 14 times [2024-05-12 12:15:16,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:16,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252460188] [2024-05-12 12:15:16,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252460188] [2024-05-12 12:15:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252460188] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:22,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357356984] [2024-05-12 12:15:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:22,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:22,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 421 transitions, 7733 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:22,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:22,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:24,669 INFO L124 PetriNetUnfolderBase]: 3138/5699 cut-off events. [2024-05-12 12:15:24,669 INFO L125 PetriNetUnfolderBase]: For 153996/154163 co-relation queries the response was YES. [2024-05-12 12:15:24,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41374 conditions, 5699 events. 3138/5699 cut-off events. For 153996/154163 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 42095 event pairs, 1153 based on Foata normal form. 90/5650 useless extension candidates. Maximal degree in co-relation 41232. Up to 4998 conditions per place. [2024-05-12 12:15:24,743 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 423 selfloop transitions, 25 changer transitions 0/457 dead transitions. [2024-05-12 12:15:24,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 457 transitions, 8791 flow [2024-05-12 12:15:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:15:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:15:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 12:15:24,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-05-12 12:15:24,745 INFO L175 Difference]: Start difference. First operand has 323 places, 421 transitions, 7733 flow. Second operand 10 states and 170 transitions. [2024-05-12 12:15:24,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 457 transitions, 8791 flow [2024-05-12 12:15:25,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 457 transitions, 8548 flow, removed 106 selfloop flow, removed 4 redundant places. [2024-05-12 12:15:25,701 INFO L231 Difference]: Finished difference. Result has 329 places, 421 transitions, 7545 flow [2024-05-12 12:15:25,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7490, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7545, PETRI_PLACES=329, PETRI_TRANSITIONS=421} [2024-05-12 12:15:25,701 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2024-05-12 12:15:25,701 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 421 transitions, 7545 flow [2024-05-12 12:15:25,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:25,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:25,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:25,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 12:15:25,702 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:25,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -933907086, now seen corresponding path program 1 times [2024-05-12 12:15:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596609008] [2024-05-12 12:15:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596609008] [2024-05-12 12:15:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596609008] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013256407] [2024-05-12 12:15:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:31,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 421 transitions, 7545 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:33,959 INFO L124 PetriNetUnfolderBase]: 3433/6172 cut-off events. [2024-05-12 12:15:33,959 INFO L125 PetriNetUnfolderBase]: For 195452/195663 co-relation queries the response was YES. [2024-05-12 12:15:34,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43936 conditions, 6172 events. 3433/6172 cut-off events. For 195452/195663 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 45927 event pairs, 731 based on Foata normal form. 205/6217 useless extension candidates. Maximal degree in co-relation 43792. Up to 1990 conditions per place. [2024-05-12 12:15:34,032 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 382 selfloop transitions, 112 changer transitions 3/506 dead transitions. [2024-05-12 12:15:34,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 506 transitions, 9250 flow [2024-05-12 12:15:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:15:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:15:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-05-12 12:15:34,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061425061425061 [2024-05-12 12:15:34,034 INFO L175 Difference]: Start difference. First operand has 329 places, 421 transitions, 7545 flow. Second operand 11 states and 206 transitions. [2024-05-12 12:15:34,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 506 transitions, 9250 flow [2024-05-12 12:15:34,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 506 transitions, 9202 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 12:15:35,004 INFO L231 Difference]: Finished difference. Result has 337 places, 425 transitions, 7915 flow [2024-05-12 12:15:35,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7497, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7915, PETRI_PLACES=337, PETRI_TRANSITIONS=425} [2024-05-12 12:15:35,005 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2024-05-12 12:15:35,005 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 425 transitions, 7915 flow [2024-05-12 12:15:35,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:35,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:35,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:35,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 12:15:35,006 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:35,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash -875699316, now seen corresponding path program 2 times [2024-05-12 12:15:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944623206] [2024-05-12 12:15:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944623206] [2024-05-12 12:15:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944623206] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204426790] [2024-05-12 12:15:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:41,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:41,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:41,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:41,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 425 transitions, 7915 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:41,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:41,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:41,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:43,435 INFO L124 PetriNetUnfolderBase]: 3577/6437 cut-off events. [2024-05-12 12:15:43,435 INFO L125 PetriNetUnfolderBase]: For 228197/228421 co-relation queries the response was YES. [2024-05-12 12:15:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46928 conditions, 6437 events. 3577/6437 cut-off events. For 228197/228421 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 48712 event pairs, 599 based on Foata normal form. 212/6489 useless extension candidates. Maximal degree in co-relation 46779. Up to 3320 conditions per place. [2024-05-12 12:15:43,524 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 264 selfloop transitions, 212 changer transitions 0/485 dead transitions. [2024-05-12 12:15:43,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 485 transitions, 9281 flow [2024-05-12 12:15:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:15:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:15:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-05-12 12:15:43,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 12:15:43,526 INFO L175 Difference]: Start difference. First operand has 337 places, 425 transitions, 7915 flow. Second operand 11 states and 209 transitions. [2024-05-12 12:15:43,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 485 transitions, 9281 flow [2024-05-12 12:15:44,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 485 transitions, 9207 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-05-12 12:15:44,893 INFO L231 Difference]: Finished difference. Result has 343 places, 425 transitions, 8269 flow [2024-05-12 12:15:44,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7841, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8269, PETRI_PLACES=343, PETRI_TRANSITIONS=425} [2024-05-12 12:15:44,893 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 302 predicate places. [2024-05-12 12:15:44,893 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 425 transitions, 8269 flow [2024-05-12 12:15:44,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:44,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:44,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:44,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 12:15:44,894 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:44,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1690093638, now seen corresponding path program 3 times [2024-05-12 12:15:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329238636] [2024-05-12 12:15:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:15:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:15:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:15:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329238636] [2024-05-12 12:15:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329238636] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:15:52,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:15:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:15:52,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794137941] [2024-05-12 12:15:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:15:52,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:15:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:15:52,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:15:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:15:53,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:15:53,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 425 transitions, 8269 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:53,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:15:53,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:15:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:15:55,669 INFO L124 PetriNetUnfolderBase]: 3856/7092 cut-off events. [2024-05-12 12:15:55,670 INFO L125 PetriNetUnfolderBase]: For 289657/289880 co-relation queries the response was YES. [2024-05-12 12:15:55,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52086 conditions, 7092 events. 3856/7092 cut-off events. For 289657/289880 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 55448 event pairs, 911 based on Foata normal form. 197/7134 useless extension candidates. Maximal degree in co-relation 51936. Up to 3586 conditions per place. [2024-05-12 12:15:55,760 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 369 selfloop transitions, 124 changer transitions 0/502 dead transitions. [2024-05-12 12:15:55,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 502 transitions, 9857 flow [2024-05-12 12:15:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:15:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:15:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-05-12 12:15:55,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-05-12 12:15:55,762 INFO L175 Difference]: Start difference. First operand has 343 places, 425 transitions, 8269 flow. Second operand 12 states and 230 transitions. [2024-05-12 12:15:55,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 502 transitions, 9857 flow [2024-05-12 12:15:57,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 502 transitions, 9432 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 12:15:57,366 INFO L231 Difference]: Finished difference. Result has 348 places, 429 transitions, 8182 flow [2024-05-12 12:15:57,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7847, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8182, PETRI_PLACES=348, PETRI_TRANSITIONS=429} [2024-05-12 12:15:57,367 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 307 predicate places. [2024-05-12 12:15:57,367 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 429 transitions, 8182 flow [2024-05-12 12:15:57,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:15:57,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:15:57,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:15:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 12:15:57,367 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:15:57,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:15:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1689973668, now seen corresponding path program 4 times [2024-05-12 12:15:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:15:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135021081] [2024-05-12 12:15:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:15:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:15:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135021081] [2024-05-12 12:16:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135021081] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082301329] [2024-05-12 12:16:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:04,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:04,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 429 transitions, 8182 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:04,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:04,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:04,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:06,839 INFO L124 PetriNetUnfolderBase]: 3825/7202 cut-off events. [2024-05-12 12:16:06,839 INFO L125 PetriNetUnfolderBase]: For 281406/281615 co-relation queries the response was YES. [2024-05-12 12:16:06,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51471 conditions, 7202 events. 3825/7202 cut-off events. For 281406/281615 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 57726 event pairs, 1046 based on Foata normal form. 193/7255 useless extension candidates. Maximal degree in co-relation 51318. Up to 4787 conditions per place. [2024-05-12 12:16:06,953 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 368 selfloop transitions, 110 changer transitions 0/487 dead transitions. [2024-05-12 12:16:06,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 487 transitions, 9464 flow [2024-05-12 12:16:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-05-12 12:16:06,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49385749385749383 [2024-05-12 12:16:06,955 INFO L175 Difference]: Start difference. First operand has 348 places, 429 transitions, 8182 flow. Second operand 11 states and 201 transitions. [2024-05-12 12:16:06,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 487 transitions, 9464 flow [2024-05-12 12:16:08,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 487 transitions, 9196 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:16:08,813 INFO L231 Difference]: Finished difference. Result has 353 places, 431 transitions, 8168 flow [2024-05-12 12:16:08,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7914, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8168, PETRI_PLACES=353, PETRI_TRANSITIONS=431} [2024-05-12 12:16:08,813 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2024-05-12 12:16:08,813 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 431 transitions, 8168 flow [2024-05-12 12:16:08,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:08,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:16:08,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:16:08,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 12:16:08,814 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:16:08,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:16:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1002114072, now seen corresponding path program 5 times [2024-05-12 12:16:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:16:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121888429] [2024-05-12 12:16:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:16:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:16:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121888429] [2024-05-12 12:16:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121888429] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:14,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:14,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:14,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109739771] [2024-05-12 12:16:14,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:14,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:14,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:14,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 431 transitions, 8168 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:14,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:14,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:17,380 INFO L124 PetriNetUnfolderBase]: 3870/7269 cut-off events. [2024-05-12 12:16:17,380 INFO L125 PetriNetUnfolderBase]: For 288042/288225 co-relation queries the response was YES. [2024-05-12 12:16:17,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51172 conditions, 7269 events. 3870/7269 cut-off events. For 288042/288225 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 58442 event pairs, 1048 based on Foata normal form. 168/7281 useless extension candidates. Maximal degree in co-relation 51016. Up to 5494 conditions per place. [2024-05-12 12:16:17,486 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 408 selfloop transitions, 64 changer transitions 0/481 dead transitions. [2024-05-12 12:16:17,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 481 transitions, 9358 flow [2024-05-12 12:16:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 12:16:17,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 12:16:17,487 INFO L175 Difference]: Start difference. First operand has 353 places, 431 transitions, 8168 flow. Second operand 11 states and 198 transitions. [2024-05-12 12:16:17,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 481 transitions, 9358 flow [2024-05-12 12:16:19,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 481 transitions, 9126 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:16:19,233 INFO L231 Difference]: Finished difference. Result has 357 places, 431 transitions, 8070 flow [2024-05-12 12:16:19,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7936, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8070, PETRI_PLACES=357, PETRI_TRANSITIONS=431} [2024-05-12 12:16:19,233 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 316 predicate places. [2024-05-12 12:16:19,233 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 431 transitions, 8070 flow [2024-05-12 12:16:19,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:19,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:16:19,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:16:19,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 12:16:19,234 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:16:19,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:16:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2100819022, now seen corresponding path program 6 times [2024-05-12 12:16:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:16:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538948203] [2024-05-12 12:16:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:16:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:16:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538948203] [2024-05-12 12:16:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538948203] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784305898] [2024-05-12 12:16:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:24,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:25,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:25,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 431 transitions, 8070 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:25,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:25,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:25,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:27,568 INFO L124 PetriNetUnfolderBase]: 4037/7295 cut-off events. [2024-05-12 12:16:27,568 INFO L125 PetriNetUnfolderBase]: For 288231/288486 co-relation queries the response was YES. [2024-05-12 12:16:27,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52082 conditions, 7295 events. 4037/7295 cut-off events. For 288231/288486 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 56838 event pairs, 755 based on Foata normal form. 237/7367 useless extension candidates. Maximal degree in co-relation 51925. Up to 4909 conditions per place. [2024-05-12 12:16:27,677 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 342 selfloop transitions, 137 changer transitions 0/488 dead transitions. [2024-05-12 12:16:27,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 488 transitions, 9440 flow [2024-05-12 12:16:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-05-12 12:16:27,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061425061425061 [2024-05-12 12:16:27,678 INFO L175 Difference]: Start difference. First operand has 357 places, 431 transitions, 8070 flow. Second operand 11 states and 206 transitions. [2024-05-12 12:16:27,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 488 transitions, 9440 flow [2024-05-12 12:16:29,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 488 transitions, 9316 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 12:16:29,463 INFO L231 Difference]: Finished difference. Result has 359 places, 431 transitions, 8224 flow [2024-05-12 12:16:29,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7946, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8224, PETRI_PLACES=359, PETRI_TRANSITIONS=431} [2024-05-12 12:16:29,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2024-05-12 12:16:29,464 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 431 transitions, 8224 flow [2024-05-12 12:16:29,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:29,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:16:29,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:16:29,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 12:16:29,465 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:16:29,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:16:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1001941092, now seen corresponding path program 7 times [2024-05-12 12:16:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:16:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802358796] [2024-05-12 12:16:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:16:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:16:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802358796] [2024-05-12 12:16:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802358796] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:35,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:35,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722718340] [2024-05-12 12:16:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:35,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:35,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:35,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 431 transitions, 8224 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:35,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:35,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:37,824 INFO L124 PetriNetUnfolderBase]: 4046/7359 cut-off events. [2024-05-12 12:16:37,824 INFO L125 PetriNetUnfolderBase]: For 279524/279765 co-relation queries the response was YES. [2024-05-12 12:16:37,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52336 conditions, 7359 events. 4046/7359 cut-off events. For 279524/279765 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 57877 event pairs, 791 based on Foata normal form. 221/7417 useless extension candidates. Maximal degree in co-relation 52178. Up to 5556 conditions per place. [2024-05-12 12:16:37,939 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 335 selfloop transitions, 140 changer transitions 0/484 dead transitions. [2024-05-12 12:16:37,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 484 transitions, 9434 flow [2024-05-12 12:16:37,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-05-12 12:16:37,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987714987714988 [2024-05-12 12:16:37,940 INFO L175 Difference]: Start difference. First operand has 359 places, 431 transitions, 8224 flow. Second operand 11 states and 203 transitions. [2024-05-12 12:16:37,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 484 transitions, 9434 flow [2024-05-12 12:16:39,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 484 transitions, 9162 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 12:16:39,722 INFO L231 Difference]: Finished difference. Result has 361 places, 433 transitions, 8266 flow [2024-05-12 12:16:39,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7952, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8266, PETRI_PLACES=361, PETRI_TRANSITIONS=433} [2024-05-12 12:16:39,723 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2024-05-12 12:16:39,723 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 433 transitions, 8266 flow [2024-05-12 12:16:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:39,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:16:39,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:16:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 12:16:39,724 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:16:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:16:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -258667172, now seen corresponding path program 8 times [2024-05-12 12:16:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:16:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365502435] [2024-05-12 12:16:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:16:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:16:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365502435] [2024-05-12 12:16:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365502435] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369712439] [2024-05-12 12:16:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:45,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:45,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 433 transitions, 8266 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:45,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:45,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:48,276 INFO L124 PetriNetUnfolderBase]: 4065/7360 cut-off events. [2024-05-12 12:16:48,277 INFO L125 PetriNetUnfolderBase]: For 281153/281396 co-relation queries the response was YES. [2024-05-12 12:16:48,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52604 conditions, 7360 events. 4065/7360 cut-off events. For 281153/281396 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 57599 event pairs, 803 based on Foata normal form. 217/7413 useless extension candidates. Maximal degree in co-relation 52445. Up to 5409 conditions per place. [2024-05-12 12:16:48,377 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 331 selfloop transitions, 148 changer transitions 0/488 dead transitions. [2024-05-12 12:16:48,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 488 transitions, 9544 flow [2024-05-12 12:16:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-05-12 12:16:48,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-05-12 12:16:48,378 INFO L175 Difference]: Start difference. First operand has 361 places, 433 transitions, 8266 flow. Second operand 11 states and 204 transitions. [2024-05-12 12:16:48,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 488 transitions, 9544 flow [2024-05-12 12:16:50,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 488 transitions, 9252 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-05-12 12:16:50,177 INFO L231 Difference]: Finished difference. Result has 364 places, 435 transitions, 8343 flow [2024-05-12 12:16:50,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7974, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8343, PETRI_PLACES=364, PETRI_TRANSITIONS=435} [2024-05-12 12:16:50,178 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 323 predicate places. [2024-05-12 12:16:50,178 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 435 transitions, 8343 flow [2024-05-12 12:16:50,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:50,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:16:50,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:16:50,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 12:16:50,179 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:16:50,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:16:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -799153176, now seen corresponding path program 9 times [2024-05-12 12:16:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:16:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557188705] [2024-05-12 12:16:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:16:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:16:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:16:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:16:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:16:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557188705] [2024-05-12 12:16:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557188705] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:16:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:16:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:16:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383693694] [2024-05-12 12:16:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:16:56,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:16:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:16:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:16:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:16:56,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:16:56,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 435 transitions, 8343 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:16:56,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:16:56,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:16:56,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:16:59,464 INFO L124 PetriNetUnfolderBase]: 4079/7704 cut-off events. [2024-05-12 12:16:59,464 INFO L125 PetriNetUnfolderBase]: For 276419/276594 co-relation queries the response was YES. [2024-05-12 12:16:59,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53001 conditions, 7704 events. 4079/7704 cut-off events. For 276419/276594 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 63139 event pairs, 1168 based on Foata normal form. 140/7681 useless extension candidates. Maximal degree in co-relation 52840. Up to 5753 conditions per place. [2024-05-12 12:16:59,570 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 407 selfloop transitions, 75 changer transitions 0/491 dead transitions. [2024-05-12 12:16:59,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 491 transitions, 9598 flow [2024-05-12 12:16:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:16:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:16:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-05-12 12:16:59,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-05-12 12:16:59,572 INFO L175 Difference]: Start difference. First operand has 364 places, 435 transitions, 8343 flow. Second operand 11 states and 205 transitions. [2024-05-12 12:16:59,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 491 transitions, 9598 flow [2024-05-12 12:17:01,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 491 transitions, 9269 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-05-12 12:17:01,265 INFO L231 Difference]: Finished difference. Result has 368 places, 436 transitions, 8191 flow [2024-05-12 12:17:01,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8014, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8191, PETRI_PLACES=368, PETRI_TRANSITIONS=436} [2024-05-12 12:17:01,265 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 327 predicate places. [2024-05-12 12:17:01,265 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 436 transitions, 8191 flow [2024-05-12 12:17:01,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:01,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:01,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 12:17:01,266 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:01,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 937296148, now seen corresponding path program 10 times [2024-05-12 12:17:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906377006] [2024-05-12 12:17:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:17:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:17:07,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:17:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906377006] [2024-05-12 12:17:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906377006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:17:07,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:17:07,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:17:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245609013] [2024-05-12 12:17:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:17:07,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:17:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:17:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:17:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:17:07,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:17:07,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 436 transitions, 8191 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:07,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:17:07,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:17:07,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:17:10,442 INFO L124 PetriNetUnfolderBase]: 4215/7622 cut-off events. [2024-05-12 12:17:10,443 INFO L125 PetriNetUnfolderBase]: For 287065/287280 co-relation queries the response was YES. [2024-05-12 12:17:10,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53564 conditions, 7622 events. 4215/7622 cut-off events. For 287065/287280 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 60012 event pairs, 712 based on Foata normal form. 203/7652 useless extension candidates. Maximal degree in co-relation 53401. Up to 3213 conditions per place. [2024-05-12 12:17:10,561 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 254 selfloop transitions, 236 changer transitions 0/499 dead transitions. [2024-05-12 12:17:10,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 499 transitions, 9615 flow [2024-05-12 12:17:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:17:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:17:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-05-12 12:17:10,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282555282555282 [2024-05-12 12:17:10,562 INFO L175 Difference]: Start difference. First operand has 368 places, 436 transitions, 8191 flow. Second operand 11 states and 215 transitions. [2024-05-12 12:17:10,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 499 transitions, 9615 flow [2024-05-12 12:17:12,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 499 transitions, 9473 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:17:12,660 INFO L231 Difference]: Finished difference. Result has 371 places, 436 transitions, 8525 flow [2024-05-12 12:17:12,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8049, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8525, PETRI_PLACES=371, PETRI_TRANSITIONS=436} [2024-05-12 12:17:12,661 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 330 predicate places. [2024-05-12 12:17:12,661 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 436 transitions, 8525 flow [2024-05-12 12:17:12,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:12,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:12,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:12,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 12:17:12,662 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:12,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 937411468, now seen corresponding path program 11 times [2024-05-12 12:17:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955903281] [2024-05-12 12:17:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:17:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:17:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:17:18,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955903281] [2024-05-12 12:17:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955903281] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:17:18,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:17:18,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:17:18,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428257977] [2024-05-12 12:17:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:17:18,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:17:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:17:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:17:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:17:18,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:17:18,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 436 transitions, 8525 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:18,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:17:18,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:17:18,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:17:21,730 INFO L124 PetriNetUnfolderBase]: 4365/8279 cut-off events. [2024-05-12 12:17:21,731 INFO L125 PetriNetUnfolderBase]: For 324129/324331 co-relation queries the response was YES. [2024-05-12 12:17:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57090 conditions, 8279 events. 4365/8279 cut-off events. For 324129/324331 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 69030 event pairs, 1303 based on Foata normal form. 184/8300 useless extension candidates. Maximal degree in co-relation 56926. Up to 5902 conditions per place. [2024-05-12 12:17:21,854 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 381 selfloop transitions, 111 changer transitions 0/501 dead transitions. [2024-05-12 12:17:21,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 501 transitions, 10015 flow [2024-05-12 12:17:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:17:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:17:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-05-12 12:17:21,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-05-12 12:17:21,855 INFO L175 Difference]: Start difference. First operand has 371 places, 436 transitions, 8525 flow. Second operand 11 states and 213 transitions. [2024-05-12 12:17:21,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 501 transitions, 10015 flow [2024-05-12 12:17:24,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 501 transitions, 9494 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-05-12 12:17:24,463 INFO L231 Difference]: Finished difference. Result has 373 places, 437 transitions, 8253 flow [2024-05-12 12:17:24,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8004, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8253, PETRI_PLACES=373, PETRI_TRANSITIONS=437} [2024-05-12 12:17:24,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 332 predicate places. [2024-05-12 12:17:24,464 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 437 transitions, 8253 flow [2024-05-12 12:17:24,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:24,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:24,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 12:17:24,465 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:24,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash 937416118, now seen corresponding path program 12 times [2024-05-12 12:17:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443436745] [2024-05-12 12:17:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:17:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:17:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:17:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443436745] [2024-05-12 12:17:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443436745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:17:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:17:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:17:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138730674] [2024-05-12 12:17:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:17:29,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:17:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:17:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:17:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:17:29,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:17:29,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 437 transitions, 8253 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:29,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:17:29,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:17:29,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:17:32,731 INFO L124 PetriNetUnfolderBase]: 4295/7764 cut-off events. [2024-05-12 12:17:32,731 INFO L125 PetriNetUnfolderBase]: For 289937/290149 co-relation queries the response was YES. [2024-05-12 12:17:32,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54220 conditions, 7764 events. 4295/7764 cut-off events. For 289937/290149 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 61554 event pairs, 838 based on Foata normal form. 204/7796 useless extension candidates. Maximal degree in co-relation 54055. Up to 5235 conditions per place. [2024-05-12 12:17:32,838 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 246 selfloop transitions, 239 changer transitions 0/494 dead transitions. [2024-05-12 12:17:32,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 494 transitions, 9543 flow [2024-05-12 12:17:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:17:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:17:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-05-12 12:17:32,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324324324324324 [2024-05-12 12:17:32,840 INFO L175 Difference]: Start difference. First operand has 373 places, 437 transitions, 8253 flow. Second operand 10 states and 197 transitions. [2024-05-12 12:17:32,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 494 transitions, 9543 flow [2024-05-12 12:17:34,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 494 transitions, 9329 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:17:34,978 INFO L231 Difference]: Finished difference. Result has 375 places, 439 transitions, 8571 flow [2024-05-12 12:17:34,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8039, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8571, PETRI_PLACES=375, PETRI_TRANSITIONS=439} [2024-05-12 12:17:34,979 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 334 predicate places. [2024-05-12 12:17:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 439 transitions, 8571 flow [2024-05-12 12:17:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:17:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:34,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 12:17:34,979 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:34,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1108118548, now seen corresponding path program 13 times [2024-05-12 12:17:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358168973] [2024-05-12 12:17:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:34,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:17:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:17:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:17:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358168973] [2024-05-12 12:17:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358168973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:17:40,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:17:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:17:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121378227] [2024-05-12 12:17:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:17:40,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:17:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:17:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:17:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:17:40,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:17:40,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 439 transitions, 8571 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:17:40,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:17:40,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:17:40,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:17:43,446 INFO L124 PetriNetUnfolderBase]: 4370/7978 cut-off events. [2024-05-12 12:17:43,447 INFO L125 PetriNetUnfolderBase]: For 302517/302778 co-relation queries the response was YES. [2024-05-12 12:17:43,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55641 conditions, 7978 events. 4370/7978 cut-off events. For 302517/302778 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 64127 event pairs, 979 based on Foata normal form. 239/8053 useless extension candidates. Maximal degree in co-relation 55475. Up to 6018 conditions per place. [2024-05-12 12:17:43,560 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 347 selfloop transitions, 141 changer transitions 0/497 dead transitions. [2024-05-12 12:17:43,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 497 transitions, 9887 flow [2024-05-12 12:17:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:17:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:17:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-05-12 12:17:43,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-05-12 12:17:43,561 INFO L175 Difference]: Start difference. First operand has 375 places, 439 transitions, 8571 flow. Second operand 11 states and 207 transitions. [2024-05-12 12:17:43,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 497 transitions, 9887 flow [2024-05-12 12:17:45,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 497 transitions, 9379 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-05-12 12:17:45,589 INFO L231 Difference]: Finished difference. Result has 380 places, 441 transitions, 8416 flow [2024-05-12 12:17:45,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8067, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8416, PETRI_PLACES=380, PETRI_TRANSITIONS=441} [2024-05-12 12:17:45,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 339 predicate places. [2024-05-12 12:17:45,590 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 441 transitions, 8416 flow [2024-05-12 12:17:45,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:17:45,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:45,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:45,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 12:17:45,590 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:45,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1108113898, now seen corresponding path program 14 times [2024-05-12 12:17:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:45,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396367743] [2024-05-12 12:17:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:17:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:17:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:17:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396367743] [2024-05-12 12:17:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396367743] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:17:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:17:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:17:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856963267] [2024-05-12 12:17:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:17:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:17:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:17:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:17:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:17:51,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:17:51,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 441 transitions, 8416 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:17:51,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:17:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:17:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:17:54,717 INFO L124 PetriNetUnfolderBase]: 4723/8663 cut-off events. [2024-05-12 12:17:54,717 INFO L125 PetriNetUnfolderBase]: For 388172/388449 co-relation queries the response was YES. [2024-05-12 12:17:54,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59930 conditions, 8663 events. 4723/8663 cut-off events. For 388172/388449 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 70960 event pairs, 1031 based on Foata normal form. 255/8753 useless extension candidates. Maximal degree in co-relation 59762. Up to 5691 conditions per place. [2024-05-12 12:17:54,836 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 354 selfloop transitions, 141 changer transitions 0/504 dead transitions. [2024-05-12 12:17:54,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 504 transitions, 9872 flow [2024-05-12 12:17:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:17:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:17:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2024-05-12 12:17:54,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-05-12 12:17:54,838 INFO L175 Difference]: Start difference. First operand has 380 places, 441 transitions, 8416 flow. Second operand 12 states and 224 transitions. [2024-05-12 12:17:54,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 504 transitions, 9872 flow [2024-05-12 12:17:56,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 504 transitions, 9527 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-05-12 12:17:56,929 INFO L231 Difference]: Finished difference. Result has 384 places, 441 transitions, 8357 flow [2024-05-12 12:17:56,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8357, PETRI_PLACES=384, PETRI_TRANSITIONS=441} [2024-05-12 12:17:56,930 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 343 predicate places. [2024-05-12 12:17:56,930 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 441 transitions, 8357 flow [2024-05-12 12:17:56,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:17:56,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:17:56,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:17:56,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 12:17:56,930 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:17:56,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:17:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1108298472, now seen corresponding path program 1 times [2024-05-12 12:17:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:17:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704923782] [2024-05-12 12:17:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:17:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:17:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:18:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:18:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:18:02,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704923782] [2024-05-12 12:18:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704923782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:18:02,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:18:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:18:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372619084] [2024-05-12 12:18:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:18:02,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:18:02,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:18:02,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:18:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:18:02,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:18:02,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 441 transitions, 8357 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:18:02,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:18:02,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:18:02,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:18:06,251 INFO L124 PetriNetUnfolderBase]: 4760/9123 cut-off events. [2024-05-12 12:18:06,252 INFO L125 PetriNetUnfolderBase]: For 397717/397924 co-relation queries the response was YES. [2024-05-12 12:18:06,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59391 conditions, 9123 events. 4760/9123 cut-off events. For 397717/397924 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 78656 event pairs, 1571 based on Foata normal form. 196/9180 useless extension candidates. Maximal degree in co-relation 59223. Up to 7070 conditions per place. [2024-05-12 12:18:06,380 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 420 selfloop transitions, 70 changer transitions 0/499 dead transitions. [2024-05-12 12:18:06,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 499 transitions, 9631 flow [2024-05-12 12:18:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:18:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:18:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2024-05-12 12:18:06,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-05-12 12:18:06,381 INFO L175 Difference]: Start difference. First operand has 384 places, 441 transitions, 8357 flow. Second operand 12 states and 219 transitions. [2024-05-12 12:18:06,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 499 transitions, 9631 flow [2024-05-12 12:18:08,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 499 transitions, 9351 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 12:18:08,264 INFO L231 Difference]: Finished difference. Result has 386 places, 441 transitions, 8225 flow [2024-05-12 12:18:08,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8077, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8225, PETRI_PLACES=386, PETRI_TRANSITIONS=441} [2024-05-12 12:18:08,265 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 345 predicate places. [2024-05-12 12:18:08,265 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 441 transitions, 8225 flow [2024-05-12 12:18:08,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:18:08,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:18:08,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:18:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 12:18:08,266 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:18:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:18:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 941884768, now seen corresponding path program 15 times [2024-05-12 12:18:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:18:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668219614] [2024-05-12 12:18:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:18:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:18:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:18:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:18:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:18:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668219614] [2024-05-12 12:18:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668219614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:18:14,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:18:14,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:18:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139114385] [2024-05-12 12:18:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:18:14,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:18:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:18:14,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:18:14,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:18:14,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:18:14,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 441 transitions, 8225 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:14,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:18:14,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:18:14,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:18:17,593 INFO L124 PetriNetUnfolderBase]: 4699/9011 cut-off events. [2024-05-12 12:18:17,593 INFO L125 PetriNetUnfolderBase]: For 321064/321234 co-relation queries the response was YES. [2024-05-12 12:18:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57898 conditions, 9011 events. 4699/9011 cut-off events. For 321064/321234 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 77496 event pairs, 1566 based on Foata normal form. 141/8977 useless extension candidates. Maximal degree in co-relation 57729. Up to 7199 conditions per place. [2024-05-12 12:18:17,714 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 405 selfloop transitions, 79 changer transitions 0/493 dead transitions. [2024-05-12 12:18:17,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 493 transitions, 9466 flow [2024-05-12 12:18:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:18:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:18:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 12:18:17,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-05-12 12:18:17,715 INFO L175 Difference]: Start difference. First operand has 386 places, 441 transitions, 8225 flow. Second operand 10 states and 191 transitions. [2024-05-12 12:18:17,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 493 transitions, 9466 flow [2024-05-12 12:18:20,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 493 transitions, 9365 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 12:18:20,045 INFO L231 Difference]: Finished difference. Result has 388 places, 442 transitions, 8317 flow [2024-05-12 12:18:20,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8124, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8317, PETRI_PLACES=388, PETRI_TRANSITIONS=442} [2024-05-12 12:18:20,046 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 347 predicate places. [2024-05-12 12:18:20,046 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 442 transitions, 8317 flow [2024-05-12 12:18:20,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:20,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:18:20,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:18:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 12:18:20,047 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:18:20,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:18:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash 941880118, now seen corresponding path program 16 times [2024-05-12 12:18:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:18:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268255569] [2024-05-12 12:18:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:18:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:18:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:18:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:18:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:18:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268255569] [2024-05-12 12:18:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268255569] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:18:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:18:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:18:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149867927] [2024-05-12 12:18:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:18:25,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:18:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:18:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:18:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:18:25,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:18:25,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 442 transitions, 8317 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:25,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:18:25,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:18:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:18:29,277 INFO L124 PetriNetUnfolderBase]: 4867/8889 cut-off events. [2024-05-12 12:18:29,277 INFO L125 PetriNetUnfolderBase]: For 349661/349873 co-relation queries the response was YES. [2024-05-12 12:18:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59329 conditions, 8889 events. 4867/8889 cut-off events. For 349661/349873 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 73292 event pairs, 1002 based on Foata normal form. 195/8909 useless extension candidates. Maximal degree in co-relation 59158. Up to 6453 conditions per place. [2024-05-12 12:18:29,410 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 314 selfloop transitions, 179 changer transitions 0/502 dead transitions. [2024-05-12 12:18:29,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 502 transitions, 9753 flow [2024-05-12 12:18:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:18:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:18:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-05-12 12:18:29,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184275184275184 [2024-05-12 12:18:29,412 INFO L175 Difference]: Start difference. First operand has 388 places, 442 transitions, 8317 flow. Second operand 11 states and 211 transitions. [2024-05-12 12:18:29,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 502 transitions, 9753 flow [2024-05-12 12:18:32,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 502 transitions, 9515 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:18:32,494 INFO L231 Difference]: Finished difference. Result has 391 places, 442 transitions, 8441 flow [2024-05-12 12:18:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8079, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8441, PETRI_PLACES=391, PETRI_TRANSITIONS=442} [2024-05-12 12:18:32,495 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 350 predicate places. [2024-05-12 12:18:32,495 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 442 transitions, 8441 flow [2024-05-12 12:18:32,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:32,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:18:32,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:18:32,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 12:18:32,495 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:18:32,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:18:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1114785222, now seen corresponding path program 2 times [2024-05-12 12:18:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:18:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130397304] [2024-05-12 12:18:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:18:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:18:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:18:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:18:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:18:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130397304] [2024-05-12 12:18:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130397304] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:18:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:18:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:18:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729676692] [2024-05-12 12:18:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:18:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:18:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:18:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:18:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:18:37,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:18:37,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 442 transitions, 8441 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:37,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:18:37,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:18:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:18:40,917 INFO L124 PetriNetUnfolderBase]: 4915/9493 cut-off events. [2024-05-12 12:18:40,917 INFO L125 PetriNetUnfolderBase]: For 345526/345706 co-relation queries the response was YES. [2024-05-12 12:18:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61076 conditions, 9493 events. 4915/9493 cut-off events. For 345526/345706 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 83155 event pairs, 1792 based on Foata normal form. 143/9468 useless extension candidates. Maximal degree in co-relation 60904. Up to 7847 conditions per place. [2024-05-12 12:18:41,073 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 420 selfloop transitions, 62 changer transitions 6/497 dead transitions. [2024-05-12 12:18:41,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 497 transitions, 9695 flow [2024-05-12 12:18:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:18:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:18:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-05-12 12:18:41,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2024-05-12 12:18:41,075 INFO L175 Difference]: Start difference. First operand has 391 places, 442 transitions, 8441 flow. Second operand 12 states and 214 transitions. [2024-05-12 12:18:41,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 497 transitions, 9695 flow [2024-05-12 12:18:43,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 497 transitions, 9339 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 12:18:43,661 INFO L231 Difference]: Finished difference. Result has 394 places, 443 transitions, 8224 flow [2024-05-12 12:18:43,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8085, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8224, PETRI_PLACES=394, PETRI_TRANSITIONS=443} [2024-05-12 12:18:43,662 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 353 predicate places. [2024-05-12 12:18:43,662 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 443 transitions, 8224 flow [2024-05-12 12:18:43,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:43,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:18:43,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:18:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 12:18:43,663 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:18:43,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:18:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 300514590, now seen corresponding path program 3 times [2024-05-12 12:18:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:18:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165994672] [2024-05-12 12:18:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:18:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:18:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:18:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:18:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:18:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165994672] [2024-05-12 12:18:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165994672] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:18:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:18:49,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:18:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445330961] [2024-05-12 12:18:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:18:49,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:18:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:18:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:18:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:18:49,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:18:49,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 443 transitions, 8224 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:49,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:18:49,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:18:49,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:18:52,786 INFO L124 PetriNetUnfolderBase]: 4807/9268 cut-off events. [2024-05-12 12:18:52,787 INFO L125 PetriNetUnfolderBase]: For 314789/314971 co-relation queries the response was YES. [2024-05-12 12:18:52,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59083 conditions, 9268 events. 4807/9268 cut-off events. For 314789/314971 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 80615 event pairs, 1653 based on Foata normal form. 145/9241 useless extension candidates. Maximal degree in co-relation 58910. Up to 7513 conditions per place. [2024-05-12 12:18:52,926 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 421 selfloop transitions, 66 changer transitions 3/499 dead transitions. [2024-05-12 12:18:52,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 499 transitions, 9492 flow [2024-05-12 12:18:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:18:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:18:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-05-12 12:18:52,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2024-05-12 12:18:52,927 INFO L175 Difference]: Start difference. First operand has 394 places, 443 transitions, 8224 flow. Second operand 12 states and 214 transitions. [2024-05-12 12:18:52,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 499 transitions, 9492 flow [2024-05-12 12:18:55,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 499 transitions, 9384 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 12:18:55,518 INFO L231 Difference]: Finished difference. Result has 399 places, 445 transitions, 8274 flow [2024-05-12 12:18:55,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8116, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8274, PETRI_PLACES=399, PETRI_TRANSITIONS=445} [2024-05-12 12:18:55,519 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2024-05-12 12:18:55,519 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 445 transitions, 8274 flow [2024-05-12 12:18:55,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:18:55,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:18:55,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:18:55,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 12:18:55,520 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:18:55,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:18:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 942064692, now seen corresponding path program 4 times [2024-05-12 12:18:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:18:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567975651] [2024-05-12 12:18:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:18:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:18:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:01,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-05-12 12:19:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567975651] [2024-05-12 12:19:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567975651] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:01,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:19:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919835950] [2024-05-12 12:19:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:19:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:19:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:19:01,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:19:01,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 445 transitions, 8274 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:01,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:01,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:19:01,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:04,646 INFO L124 PetriNetUnfolderBase]: 4822/9293 cut-off events. [2024-05-12 12:19:04,646 INFO L125 PetriNetUnfolderBase]: For 318171/318345 co-relation queries the response was YES. [2024-05-12 12:19:04,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59388 conditions, 9293 events. 4822/9293 cut-off events. For 318171/318345 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 80809 event pairs, 1549 based on Foata normal form. 137/9285 useless extension candidates. Maximal degree in co-relation 59214. Up to 7596 conditions per place. [2024-05-12 12:19:04,781 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 401 selfloop transitions, 79 changer transitions 0/489 dead transitions. [2024-05-12 12:19:04,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 489 transitions, 9442 flow [2024-05-12 12:19:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:19:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:19:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-05-12 12:19:04,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-05-12 12:19:04,782 INFO L175 Difference]: Start difference. First operand has 399 places, 445 transitions, 8274 flow. Second operand 10 states and 183 transitions. [2024-05-12 12:19:04,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 489 transitions, 9442 flow [2024-05-12 12:19:07,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 489 transitions, 9351 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 12:19:07,616 INFO L231 Difference]: Finished difference. Result has 401 places, 446 transitions, 8360 flow [2024-05-12 12:19:07,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8183, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8360, PETRI_PLACES=401, PETRI_TRANSITIONS=446} [2024-05-12 12:19:07,617 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 360 predicate places. [2024-05-12 12:19:07,617 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 446 transitions, 8360 flow [2024-05-12 12:19:07,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:07,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:07,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:07,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 12:19:07,618 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:19:07,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash 300268636, now seen corresponding path program 17 times [2024-05-12 12:19:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6496407] [2024-05-12 12:19:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:13,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6496407] [2024-05-12 12:19:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6496407] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:13,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:13,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:19:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867069228] [2024-05-12 12:19:13,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:13,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:19:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:19:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:19:13,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:19:13,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 446 transitions, 8360 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:13,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:13,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:19:13,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:16,835 INFO L124 PetriNetUnfolderBase]: 4881/9405 cut-off events. [2024-05-12 12:19:16,835 INFO L125 PetriNetUnfolderBase]: For 354340/354534 co-relation queries the response was YES. [2024-05-12 12:19:16,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59518 conditions, 9405 events. 4881/9405 cut-off events. For 354340/354534 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 82019 event pairs, 1673 based on Foata normal form. 175/9410 useless extension candidates. Maximal degree in co-relation 59342. Up to 7419 conditions per place. [2024-05-12 12:19:16,978 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 427 selfloop transitions, 66 changer transitions 11/513 dead transitions. [2024-05-12 12:19:16,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 513 transitions, 9710 flow [2024-05-12 12:19:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-12 12:19:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-05-12 12:19:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 248 transitions. [2024-05-12 12:19:16,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2024-05-12 12:19:16,979 INFO L175 Difference]: Start difference. First operand has 401 places, 446 transitions, 8360 flow. Second operand 14 states and 248 transitions. [2024-05-12 12:19:16,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 513 transitions, 9710 flow [2024-05-12 12:19:19,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 513 transitions, 9591 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 12:19:19,571 INFO L231 Difference]: Finished difference. Result has 409 places, 446 transitions, 8379 flow [2024-05-12 12:19:19,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8241, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8379, PETRI_PLACES=409, PETRI_TRANSITIONS=446} [2024-05-12 12:19:19,571 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 368 predicate places. [2024-05-12 12:19:19,571 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 446 transitions, 8379 flow [2024-05-12 12:19:19,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:19,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:19,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:19,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 12:19:19,572 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:19:19,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 127778746, now seen corresponding path program 18 times [2024-05-12 12:19:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991721842] [2024-05-12 12:19:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:26,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-05-12 12:19:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991721842] [2024-05-12 12:19:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991721842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:19:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134744951] [2024-05-12 12:19:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:26,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:19:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:19:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:19:26,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:19:26,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 446 transitions, 8379 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:26,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:26,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:19:26,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:29,757 INFO L124 PetriNetUnfolderBase]: 4962/9564 cut-off events. [2024-05-12 12:19:29,758 INFO L125 PetriNetUnfolderBase]: For 347084/347266 co-relation queries the response was YES. [2024-05-12 12:19:29,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59416 conditions, 9564 events. 4962/9564 cut-off events. For 347084/347266 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 83762 event pairs, 1675 based on Foata normal form. 169/9554 useless extension candidates. Maximal degree in co-relation 59239. Up to 7504 conditions per place. [2024-05-12 12:19:29,908 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 413 selfloop transitions, 74 changer transitions 0/496 dead transitions. [2024-05-12 12:19:29,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 496 transitions, 9605 flow [2024-05-12 12:19:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:19:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:19:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 12:19:29,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-05-12 12:19:29,909 INFO L175 Difference]: Start difference. First operand has 409 places, 446 transitions, 8379 flow. Second operand 10 states and 189 transitions. [2024-05-12 12:19:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 496 transitions, 9605 flow [2024-05-12 12:19:32,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 496 transitions, 9483 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 12:19:32,439 INFO L231 Difference]: Finished difference. Result has 408 places, 446 transitions, 8413 flow [2024-05-12 12:19:32,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8257, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8413, PETRI_PLACES=408, PETRI_TRANSITIONS=446} [2024-05-12 12:19:32,440 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 367 predicate places. [2024-05-12 12:19:32,440 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 446 transitions, 8413 flow [2024-05-12 12:19:32,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:32,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:32,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:32,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 12:19:32,440 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:19:32,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1881380242, now seen corresponding path program 19 times [2024-05-12 12:19:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908113636] [2024-05-12 12:19:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908113636] [2024-05-12 12:19:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908113636] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:38,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:19:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068582003] [2024-05-12 12:19:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:38,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:19:38,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:38,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:19:38,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:19:38,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:19:38,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 446 transitions, 8413 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:38,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:38,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:19:38,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:42,232 INFO L124 PetriNetUnfolderBase]: 5122/9653 cut-off events. [2024-05-12 12:19:42,232 INFO L125 PetriNetUnfolderBase]: For 324596/324864 co-relation queries the response was YES. [2024-05-12 12:19:42,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61449 conditions, 9653 events. 5122/9653 cut-off events. For 324596/324864 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 83163 event pairs, 2541 based on Foata normal form. 169/9628 useless extension candidates. Maximal degree in co-relation 61271. Up to 8402 conditions per place. [2024-05-12 12:19:42,370 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 453 selfloop transitions, 37 changer transitions 0/499 dead transitions. [2024-05-12 12:19:42,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 499 transitions, 9837 flow [2024-05-12 12:19:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:19:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:19:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 12:19:42,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48402948402948404 [2024-05-12 12:19:42,371 INFO L175 Difference]: Start difference. First operand has 408 places, 446 transitions, 8413 flow. Second operand 11 states and 197 transitions. [2024-05-12 12:19:42,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 499 transitions, 9837 flow [2024-05-12 12:19:45,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 499 transitions, 9696 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 12:19:45,098 INFO L231 Difference]: Finished difference. Result has 413 places, 450 transitions, 8414 flow [2024-05-12 12:19:45,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8272, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8414, PETRI_PLACES=413, PETRI_TRANSITIONS=450} [2024-05-12 12:19:45,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 372 predicate places. [2024-05-12 12:19:45,098 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 450 transitions, 8414 flow [2024-05-12 12:19:45,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:45,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:45,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:45,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-12 12:19:45,099 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:19:45,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1445010616, now seen corresponding path program 5 times [2024-05-12 12:19:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932311890] [2024-05-12 12:19:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932311890] [2024-05-12 12:19:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932311890] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:19:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246063385] [2024-05-12 12:19:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:19:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:19:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:19:50,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:19:50,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 450 transitions, 8414 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:50,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:50,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:19:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:54,263 INFO L124 PetriNetUnfolderBase]: 5135/9728 cut-off events. [2024-05-12 12:19:54,263 INFO L125 PetriNetUnfolderBase]: For 324624/324876 co-relation queries the response was YES. [2024-05-12 12:19:54,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62228 conditions, 9728 events. 5135/9728 cut-off events. For 324624/324876 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 84291 event pairs, 2636 based on Foata normal form. 151/9681 useless extension candidates. Maximal degree in co-relation 62048. Up to 8764 conditions per place. [2024-05-12 12:19:54,403 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 444 selfloop transitions, 28 changer transitions 6/487 dead transitions. [2024-05-12 12:19:54,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 487 transitions, 9544 flow [2024-05-12 12:19:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:19:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:19:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 12:19:54,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-05-12 12:19:54,405 INFO L175 Difference]: Start difference. First operand has 413 places, 450 transitions, 8414 flow. Second operand 10 states and 171 transitions. [2024-05-12 12:19:54,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 487 transitions, 9544 flow [2024-05-12 12:19:57,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 487 transitions, 9481 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-05-12 12:19:57,191 INFO L231 Difference]: Finished difference. Result has 416 places, 451 transitions, 8427 flow [2024-05-12 12:19:57,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8351, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8427, PETRI_PLACES=416, PETRI_TRANSITIONS=451} [2024-05-12 12:19:57,192 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 375 predicate places. [2024-05-12 12:19:57,192 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 451 transitions, 8427 flow [2024-05-12 12:19:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:19:57,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:57,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-12 12:19:57,192 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:19:57,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1438574582, now seen corresponding path program 20 times [2024-05-12 12:19:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655988664] [2024-05-12 12:19:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655988664] [2024-05-12 12:20:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655988664] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:20:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621165128] [2024-05-12 12:20:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:20:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:02,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:20:02,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:20:03,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:20:03,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 451 transitions, 8427 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:03,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:03,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:20:03,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:06,863 INFO L124 PetriNetUnfolderBase]: 5193/9830 cut-off events. [2024-05-12 12:20:06,863 INFO L125 PetriNetUnfolderBase]: For 357149/357417 co-relation queries the response was YES. [2024-05-12 12:20:06,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62695 conditions, 9830 events. 5193/9830 cut-off events. For 357149/357417 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 85188 event pairs, 2618 based on Foata normal form. 165/9794 useless extension candidates. Maximal degree in co-relation 62513. Up to 8717 conditions per place. [2024-05-12 12:20:07,013 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 460 selfloop transitions, 30 changer transitions 0/499 dead transitions. [2024-05-12 12:20:07,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 499 transitions, 9669 flow [2024-05-12 12:20:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:20:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:20:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 12:20:07,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668304668304668 [2024-05-12 12:20:07,014 INFO L175 Difference]: Start difference. First operand has 416 places, 451 transitions, 8427 flow. Second operand 11 states and 190 transitions. [2024-05-12 12:20:07,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 499 transitions, 9669 flow [2024-05-12 12:20:09,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 499 transitions, 9577 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 12:20:09,708 INFO L231 Difference]: Finished difference. Result has 420 places, 453 transitions, 8447 flow [2024-05-12 12:20:09,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8335, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8447, PETRI_PLACES=420, PETRI_TRANSITIONS=453} [2024-05-12 12:20:09,709 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 379 predicate places. [2024-05-12 12:20:09,709 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 453 transitions, 8447 flow [2024-05-12 12:20:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:09,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:09,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:09,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-05-12 12:20:09,710 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:09,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1978510874, now seen corresponding path program 6 times [2024-05-12 12:20:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267709255] [2024-05-12 12:20:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267709255] [2024-05-12 12:20:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267709255] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:15,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:20:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042144349] [2024-05-12 12:20:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:15,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:20:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:20:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:20:15,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:20:15,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 453 transitions, 8447 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:15,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:15,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:20:15,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:19,899 INFO L124 PetriNetUnfolderBase]: 5235/9926 cut-off events. [2024-05-12 12:20:19,900 INFO L125 PetriNetUnfolderBase]: For 341876/342148 co-relation queries the response was YES. [2024-05-12 12:20:20,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63409 conditions, 9926 events. 5235/9926 cut-off events. For 341876/342148 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 86506 event pairs, 2576 based on Foata normal form. 171/9894 useless extension candidates. Maximal degree in co-relation 63225. Up to 8843 conditions per place. [2024-05-12 12:20:20,064 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 438 selfloop transitions, 45 changer transitions 3/495 dead transitions. [2024-05-12 12:20:20,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 495 transitions, 9821 flow [2024-05-12 12:20:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:20:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:20:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 12:20:20,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-05-12 12:20:20,065 INFO L175 Difference]: Start difference. First operand has 420 places, 453 transitions, 8447 flow. Second operand 10 states and 171 transitions. [2024-05-12 12:20:20,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 495 transitions, 9821 flow [2024-05-12 12:20:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 495 transitions, 9777 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:20:23,236 INFO L231 Difference]: Finished difference. Result has 424 places, 457 transitions, 8593 flow [2024-05-12 12:20:23,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8403, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8593, PETRI_PLACES=424, PETRI_TRANSITIONS=457} [2024-05-12 12:20:23,237 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 383 predicate places. [2024-05-12 12:20:23,237 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 457 transitions, 8593 flow [2024-05-12 12:20:23,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:23,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:23,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:23,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-05-12 12:20:23,238 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:23,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1445249626, now seen corresponding path program 7 times [2024-05-12 12:20:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:23,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603710809] [2024-05-12 12:20:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603710809] [2024-05-12 12:20:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603710809] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:20:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932795695] [2024-05-12 12:20:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:29,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:20:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:20:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:20:29,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:20:29,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 457 transitions, 8593 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:29,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:29,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:20:29,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:33,046 INFO L124 PetriNetUnfolderBase]: 5281/10000 cut-off events. [2024-05-12 12:20:33,047 INFO L125 PetriNetUnfolderBase]: For 357765/358025 co-relation queries the response was YES. [2024-05-12 12:20:33,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64397 conditions, 10000 events. 5281/10000 cut-off events. For 357765/358025 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 87077 event pairs, 2709 based on Foata normal form. 159/9957 useless extension candidates. Maximal degree in co-relation 64211. Up to 9019 conditions per place. [2024-05-12 12:20:33,237 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 459 selfloop transitions, 24 changer transitions 3/495 dead transitions. [2024-05-12 12:20:33,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 495 transitions, 9933 flow [2024-05-12 12:20:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:20:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:20:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 12:20:33,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-05-12 12:20:33,238 INFO L175 Difference]: Start difference. First operand has 424 places, 457 transitions, 8593 flow. Second operand 10 states and 169 transitions. [2024-05-12 12:20:33,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 495 transitions, 9933 flow [2024-05-12 12:20:36,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 495 transitions, 9860 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-05-12 12:20:36,401 INFO L231 Difference]: Finished difference. Result has 429 places, 459 transitions, 8610 flow [2024-05-12 12:20:36,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8520, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8610, PETRI_PLACES=429, PETRI_TRANSITIONS=459} [2024-05-12 12:20:36,401 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 388 predicate places. [2024-05-12 12:20:36,401 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 459 transitions, 8610 flow [2024-05-12 12:20:36,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:36,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:36,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:36,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-05-12 12:20:36,402 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:36,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 613774798, now seen corresponding path program 8 times [2024-05-12 12:20:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015441035] [2024-05-12 12:20:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:42,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-05-12 12:20:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015441035] [2024-05-12 12:20:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015441035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:20:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745031627] [2024-05-12 12:20:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:42,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:20:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:20:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:20:42,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:20:42,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 459 transitions, 8610 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:42,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:42,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:20:42,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:46,126 INFO L124 PetriNetUnfolderBase]: 5289/10014 cut-off events. [2024-05-12 12:20:46,126 INFO L125 PetriNetUnfolderBase]: For 355991/356272 co-relation queries the response was YES. [2024-05-12 12:20:46,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64315 conditions, 10014 events. 5289/10014 cut-off events. For 355991/356272 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 87238 event pairs, 2690 based on Foata normal form. 170/9986 useless extension candidates. Maximal degree in co-relation 64127. Up to 9068 conditions per place. [2024-05-12 12:20:46,288 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 459 selfloop transitions, 31 changer transitions 0/499 dead transitions. [2024-05-12 12:20:46,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 499 transitions, 9794 flow [2024-05-12 12:20:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:20:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:20:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-05-12 12:20:46,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-05-12 12:20:46,289 INFO L175 Difference]: Start difference. First operand has 429 places, 459 transitions, 8610 flow. Second operand 10 states and 174 transitions. [2024-05-12 12:20:46,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 499 transitions, 9794 flow [2024-05-12 12:20:50,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 499 transitions, 9743 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 12:20:50,535 INFO L231 Difference]: Finished difference. Result has 433 places, 460 transitions, 8647 flow [2024-05-12 12:20:50,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8559, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8647, PETRI_PLACES=433, PETRI_TRANSITIONS=460} [2024-05-12 12:20:50,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 392 predicate places. [2024-05-12 12:20:50,536 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 460 transitions, 8647 flow [2024-05-12 12:20:50,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:50,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:50,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:50,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-12 12:20:50,537 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:50,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1989523934, now seen corresponding path program 9 times [2024-05-12 12:20:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119179561] [2024-05-12 12:20:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119179561] [2024-05-12 12:20:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119179561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:20:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970572895] [2024-05-12 12:20:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:56,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:20:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:56,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:20:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:20:56,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:20:56,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 460 transitions, 8647 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:20:56,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:56,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:20:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:00,493 INFO L124 PetriNetUnfolderBase]: 5289/10023 cut-off events. [2024-05-12 12:21:00,493 INFO L125 PetriNetUnfolderBase]: For 360892/361162 co-relation queries the response was YES. [2024-05-12 12:21:00,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64466 conditions, 10023 events. 5289/10023 cut-off events. For 360892/361162 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 87174 event pairs, 2593 based on Foata normal form. 159/9975 useless extension candidates. Maximal degree in co-relation 64276. Up to 9099 conditions per place. [2024-05-12 12:21:00,690 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 454 selfloop transitions, 31 changer transitions 3/497 dead transitions. [2024-05-12 12:21:00,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 497 transitions, 9785 flow [2024-05-12 12:21:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:21:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:21:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-05-12 12:21:00,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45135135135135135 [2024-05-12 12:21:00,692 INFO L175 Difference]: Start difference. First operand has 433 places, 460 transitions, 8647 flow. Second operand 10 states and 167 transitions. [2024-05-12 12:21:00,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 497 transitions, 9785 flow [2024-05-12 12:21:04,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 497 transitions, 9707 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 12:21:04,130 INFO L231 Difference]: Finished difference. Result has 435 places, 461 transitions, 8659 flow [2024-05-12 12:21:04,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8569, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8659, PETRI_PLACES=435, PETRI_TRANSITIONS=461} [2024-05-12 12:21:04,131 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 394 predicate places. [2024-05-12 12:21:04,131 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 461 transitions, 8659 flow [2024-05-12 12:21:04,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:21:04,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:04,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:04,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-12 12:21:04,131 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:04,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1978502504, now seen corresponding path program 10 times [2024-05-12 12:21:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:04,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125279049] [2024-05-12 12:21:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125279049] [2024-05-12 12:21:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125279049] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:21:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102599823] [2024-05-12 12:21:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:10,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:21:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:21:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:21:10,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:21:10,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 461 transitions, 8659 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:21:10,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:10,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:21:10,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:14,952 INFO L124 PetriNetUnfolderBase]: 5309/10075 cut-off events. [2024-05-12 12:21:14,952 INFO L125 PetriNetUnfolderBase]: For 358260/358515 co-relation queries the response was YES. [2024-05-12 12:21:15,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64455 conditions, 10075 events. 5309/10075 cut-off events. For 358260/358515 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 87983 event pairs, 2604 based on Foata normal form. 154/10027 useless extension candidates. Maximal degree in co-relation 64264. Up to 9047 conditions per place. [2024-05-12 12:21:15,102 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 433 selfloop transitions, 50 changer transitions 6/498 dead transitions. [2024-05-12 12:21:15,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 498 transitions, 9795 flow [2024-05-12 12:21:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:21:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:21:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 12:21:15,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-05-12 12:21:15,103 INFO L175 Difference]: Start difference. First operand has 435 places, 461 transitions, 8659 flow. Second operand 10 states and 169 transitions. [2024-05-12 12:21:15,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 498 transitions, 9795 flow [2024-05-12 12:21:18,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 498 transitions, 9707 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 12:21:18,773 INFO L231 Difference]: Finished difference. Result has 437 places, 461 transitions, 8679 flow [2024-05-12 12:21:18,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8571, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8679, PETRI_PLACES=437, PETRI_TRANSITIONS=461} [2024-05-12 12:21:18,775 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 396 predicate places. [2024-05-12 12:21:18,775 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 461 transitions, 8679 flow [2024-05-12 12:21:18,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:21:18,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:18,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:18,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-05-12 12:21:18,775 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:18,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1870484574, now seen corresponding path program 21 times [2024-05-12 12:21:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:18,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972147508] [2024-05-12 12:21:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972147508] [2024-05-12 12:21:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972147508] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:21:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231680929] [2024-05-12 12:21:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:25,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:21:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:21:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:21:25,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 12:21:25,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 461 transitions, 8679 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 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-05-12 12:21:25,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:25,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 12:21:25,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15