./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-06-19_11-23-25.files/mutex-meet-rel/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 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:32:29,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:32:29,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:32:29,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:32:29,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:32:29,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:32:29,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:32:29,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:32:29,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:32:29,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:32:29,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:32:29,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:32:29,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:32:29,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:32:29,767 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:32:29,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:32:29,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:32:29,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:32:29,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:32:29,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:32:29,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:32:29,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:32:29,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:32:29,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:32:29,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:32:29,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:32:29,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:32:29,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:32:29,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:32:29,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:32:29,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:32:29,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:32:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:32:29,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:32:29,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:32:29,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:32:29,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:32:29,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:32:29,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:32:29,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:32:29,775 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:32:29,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:32:29,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:32:29,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:32:30,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:32:30,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:32:30,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:32:30,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:32:30,100 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:32:30,101 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-06-27 22:32:31,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:32:31,657 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:32:31,668 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-06-27 22:32:31,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ad4157b/3cdc855f172c4049819cec70c15ed93f/FLAGe0443ad27 [2024-06-27 22:32:31,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ad4157b/3cdc855f172c4049819cec70c15ed93f [2024-06-27 22:32:31,704 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:32:31,705 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:32:31,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:32:31,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:32:31,793 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:32:31,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:32:31,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:32:31,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:32:31,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:32:31" (1/2) ... [2024-06-27 22:32:31,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7e6b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:32:31, skipping insertion in model container [2024-06-27 22:32:31,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:32:31" (1/2) ... [2024-06-27 22:32:31,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4106bf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:32:31, skipping insertion in model container [2024-06-27 22:32:31,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:32:31" (2/2) ... [2024-06-27 22:32:31,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7e6b07 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:31, skipping insertion in model container [2024-06-27 22:32:31,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:32:31" (2/2) ... [2024-06-27 22:32:31,805 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:32:31,830 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:32:31,832 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$w_buff0_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0_used >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0_used >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff0_used >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0_used >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0_used >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0_used + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0_used + (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0_used >= 0LL) && (1LL + (long long )x$w_buff0_used) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:32:31,832 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$flush_delayed) + (long long )x$w_buff0_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 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_buff0_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 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_buff0_used >= 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_buff0_used >= 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$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0_used >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0_used >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff0_used >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0_used >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0_used >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0_used + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0_used + (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0_used >= 0LL) && (1LL + (long long )x$w_buff0_used) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:32:31,832 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:32:31,833 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-27 22:32:31,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:32:32,060 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2024-06-27 22:32:32,235 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:32:32,245 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:32:32,277 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/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-06-27 22:32:32,432 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:32:32,469 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:32:32,470 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32 WrapperNode [2024-06-27 22:32:32,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:32:32,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:32:32,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:32:32,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:32:32,478 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 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,509 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 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,568 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-06-27 22:32:32,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:32:32,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:32:32,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:32:32,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:32:32,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:32:32,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:32:32,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:32:32,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:32:32,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:32:32,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (1/1) ... [2024-06-27 22:32:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:32:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:32:32,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:32:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:32:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:32:32,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:32:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:32:32,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:32:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:32:32,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:32:32,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:32:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:32:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:32:32,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:32:32,763 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:32:32,871 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:32:32,873 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:32:33,382 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:32:33,382 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:32:33,551 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:32:33,551 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:32:33,552 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:32:33 BoogieIcfgContainer [2024-06-27 22:32:33,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:32:33,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:32:33,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:32:33,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:32:33,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:32:31" (1/4) ... [2024-06-27 22:32:33,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336ee936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:32:33, skipping insertion in model container [2024-06-27 22:32:33,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:32:31" (2/4) ... [2024-06-27 22:32:33,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336ee936 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:32:33, skipping insertion in model container [2024-06-27 22:32:33,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:32:32" (3/4) ... [2024-06-27 22:32:33,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336ee936 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:32:33, skipping insertion in model container [2024-06-27 22:32:33,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:32:33" (4/4) ... [2024-06-27 22:32:33,563 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:32:33,580 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:32:33,581 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:32:33,581 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:32:33,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:32:33,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:32:33,706 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 22:32:33,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:32:33,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-27 22:32:33,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:32:33,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-27 22:32:33,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:32:33,737 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;@23d570a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:32:33,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:32:33,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:32:33,743 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:32:33,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:32:33,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:33,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:32:33,744 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-06-27 22:32:33,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 308678707, now seen corresponding path program 1 times [2024-06-27 22:32:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293499011] [2024-06-27 22:32:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293499011] [2024-06-27 22:32:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293499011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:32:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804919020] [2024-06-27 22:32:35,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:32:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:32:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:32:35,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:32:35,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:35,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:35,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:32:35,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:35,565 INFO L124 PetriNetUnfolderBase]: 460/809 cut-off events. [2024-06-27 22:32:35,565 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 22:32:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 809 events. 460/809 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4054 event pairs, 210 based on Foata normal form. 42/802 useless extension candidates. Maximal degree in co-relation 1586. Up to 761 conditions per place. [2024-06-27 22:32:35,577 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:32:35,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 161 flow [2024-06-27 22:32:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:32:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:32:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 22:32:35,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-27 22:32:35,592 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-06-27 22:32:35,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 161 flow [2024-06-27 22:32:35,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:35,597 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 93 flow [2024-06-27 22:32:35,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2024-06-27 22:32:35,602 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 22:32:35,602 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 93 flow [2024-06-27 22:32:35,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:35,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:35,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:35,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:32:35,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:35,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 287676551, now seen corresponding path program 1 times [2024-06-27 22:32:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899155929] [2024-06-27 22:32:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899155929] [2024-06-27 22:32:36,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899155929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:36,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:36,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:32:36,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871847421] [2024-06-27 22:32:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:36,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:32:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:32:36,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:32:36,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:32:36,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:36,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:36,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:32:36,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:36,812 INFO L124 PetriNetUnfolderBase]: 462/913 cut-off events. [2024-06-27 22:32:36,813 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-06-27 22:32:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 913 events. 462/913 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4997 event pairs, 255 based on Foata normal form. 2/838 useless extension candidates. Maximal degree in co-relation 1873. Up to 753 conditions per place. [2024-06-27 22:32:36,818 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 36 selfloop transitions, 6 changer transitions 1/53 dead transitions. [2024-06-27 22:32:36,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 227 flow [2024-06-27 22:32:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:32:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:32:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 22:32:36,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-06-27 22:32:36,821 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 93 flow. Second operand 4 states and 91 transitions. [2024-06-27 22:32:36,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 227 flow [2024-06-27 22:32:36,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:36,823 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 139 flow [2024-06-27 22:32:36,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-27 22:32:36,824 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-27 22:32:36,824 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 139 flow [2024-06-27 22:32:36,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:36,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:36,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:36,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:32:36,825 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-06-27 22:32:36,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 328039780, now seen corresponding path program 1 times [2024-06-27 22:32:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:36,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378417472] [2024-06-27 22:32:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:37,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-06-27 22:32:37,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:37,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378417472] [2024-06-27 22:32:37,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378417472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:37,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:32:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550240837] [2024-06-27 22:32:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:37,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:32:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:37,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:32:37,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:32:37,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:32:37,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:37,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:37,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:32:37,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:38,055 INFO L124 PetriNetUnfolderBase]: 570/1096 cut-off events. [2024-06-27 22:32:38,055 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-06-27 22:32:38,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1096 events. 570/1096 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6104 event pairs, 211 based on Foata normal form. 3/1007 useless extension candidates. Maximal degree in co-relation 2466. Up to 861 conditions per place. [2024-06-27 22:32:38,061 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 48 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2024-06-27 22:32:38,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 363 flow [2024-06-27 22:32:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:32:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:32:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 22:32:38,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-06-27 22:32:38,064 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 139 flow. Second operand 5 states and 116 transitions. [2024-06-27 22:32:38,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 363 flow [2024-06-27 22:32:38,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 356 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:38,067 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 229 flow [2024-06-27 22:32:38,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-06-27 22:32:38,068 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 22:32:38,068 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 229 flow [2024-06-27 22:32:38,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:38,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:38,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:38,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:32:38,069 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-06-27 22:32:38,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1440771760, now seen corresponding path program 1 times [2024-06-27 22:32:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:38,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598819539] [2024-06-27 22:32:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598819539] [2024-06-27 22:32:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598819539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:39,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154277717] [2024-06-27 22:32:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:39,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:39,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:32:39,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:39,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:39,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:32:39,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:39,820 INFO L124 PetriNetUnfolderBase]: 576/1099 cut-off events. [2024-06-27 22:32:39,820 INFO L125 PetriNetUnfolderBase]: For 981/981 co-relation queries the response was YES. [2024-06-27 22:32:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 1099 events. 576/1099 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6097 event pairs, 194 based on Foata normal form. 7/1021 useless extension candidates. Maximal degree in co-relation 2931. Up to 842 conditions per place. [2024-06-27 22:32:39,829 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 55 selfloop transitions, 16 changer transitions 3/83 dead transitions. [2024-06-27 22:32:39,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 478 flow [2024-06-27 22:32:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-27 22:32:39,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-27 22:32:39,834 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 229 flow. Second operand 6 states and 138 transitions. [2024-06-27 22:32:39,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 478 flow [2024-06-27 22:32:39,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 474 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:32:39,843 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 278 flow [2024-06-27 22:32:39,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-27 22:32:39,845 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-06-27 22:32:39,845 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 278 flow [2024-06-27 22:32:39,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:39,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:39,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:39,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:32:39,847 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-06-27 22:32:39,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1714252953, now seen corresponding path program 1 times [2024-06-27 22:32:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431322983] [2024-06-27 22:32:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:41,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431322983] [2024-06-27 22:32:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431322983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:41,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254371228] [2024-06-27 22:32:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:41,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:41,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:41,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:41,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:32:41,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:41,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:41,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:32:41,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:41,950 INFO L124 PetriNetUnfolderBase]: 596/1129 cut-off events. [2024-06-27 22:32:41,950 INFO L125 PetriNetUnfolderBase]: For 1475/1475 co-relation queries the response was YES. [2024-06-27 22:32:41,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 1129 events. 596/1129 cut-off events. For 1475/1475 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6347 event pairs, 146 based on Foata normal form. 6/1052 useless extension candidates. Maximal degree in co-relation 3303. Up to 820 conditions per place. [2024-06-27 22:32:41,958 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 59 selfloop transitions, 18 changer transitions 4/90 dead transitions. [2024-06-27 22:32:41,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 560 flow [2024-06-27 22:32:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-06-27 22:32:41,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6150793650793651 [2024-06-27 22:32:41,961 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 278 flow. Second operand 7 states and 155 transitions. [2024-06-27 22:32:41,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 560 flow [2024-06-27 22:32:41,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 524 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:41,966 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 293 flow [2024-06-27 22:32:41,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-06-27 22:32:41,970 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2024-06-27 22:32:41,970 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 293 flow [2024-06-27 22:32:41,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:41,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:41,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:41,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:32:41,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:41,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 896135998, now seen corresponding path program 1 times [2024-06-27 22:32:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309463388] [2024-06-27 22:32:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309463388] [2024-06-27 22:32:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309463388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:32:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391218656] [2024-06-27 22:32:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:32:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:32:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:32:43,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:43,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:43,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:43,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:43,764 INFO L124 PetriNetUnfolderBase]: 681/1322 cut-off events. [2024-06-27 22:32:43,764 INFO L125 PetriNetUnfolderBase]: For 2195/2195 co-relation queries the response was YES. [2024-06-27 22:32:43,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1322 events. 681/1322 cut-off events. For 2195/2195 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7559 event pairs, 379 based on Foata normal form. 1/1226 useless extension candidates. Maximal degree in co-relation 3876. Up to 1097 conditions per place. [2024-06-27 22:32:43,773 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 52 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2024-06-27 22:32:43,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 499 flow [2024-06-27 22:32:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-27 22:32:43,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 22:32:43,776 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 293 flow. Second operand 6 states and 104 transitions. [2024-06-27 22:32:43,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 499 flow [2024-06-27 22:32:43,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 452 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:43,784 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 338 flow [2024-06-27 22:32:43,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2024-06-27 22:32:43,787 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-06-27 22:32:43,787 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 338 flow [2024-06-27 22:32:43,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:43,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:43,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:43,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:32:43,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:43,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2010428302, now seen corresponding path program 1 times [2024-06-27 22:32:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341513964] [2024-06-27 22:32:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341513964] [2024-06-27 22:32:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341513964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:32:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803521313] [2024-06-27 22:32:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:32:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:32:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:32:43,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 36 [2024-06-27 22:32:43,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:43,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:43,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 36 [2024-06-27 22:32:43,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:44,076 INFO L124 PetriNetUnfolderBase]: 295/742 cut-off events. [2024-06-27 22:32:44,076 INFO L125 PetriNetUnfolderBase]: For 983/1037 co-relation queries the response was YES. [2024-06-27 22:32:44,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 742 events. 295/742 cut-off events. For 983/1037 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4867 event pairs, 155 based on Foata normal form. 15/688 useless extension candidates. Maximal degree in co-relation 1902. Up to 417 conditions per place. [2024-06-27 22:32:44,081 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 29 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2024-06-27 22:32:44,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 409 flow [2024-06-27 22:32:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:32:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:32:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 22:32:44,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-06-27 22:32:44,083 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 338 flow. Second operand 3 states and 82 transitions. [2024-06-27 22:32:44,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 409 flow [2024-06-27 22:32:44,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 395 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:44,087 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 311 flow [2024-06-27 22:32:44,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2024-06-27 22:32:44,089 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-06-27 22:32:44,089 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 311 flow [2024-06-27 22:32:44,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:44,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:44,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:44,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:32:44,090 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-06-27 22:32:44,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2101708420, now seen corresponding path program 1 times [2024-06-27 22:32:44,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:44,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178598934] [2024-06-27 22:32:44,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:44,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:45,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178598934] [2024-06-27 22:32:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178598934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800875667] [2024-06-27 22:32:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:45,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:45,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:45,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 311 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-06-27 22:32:45,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:45,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:45,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:45,726 INFO L124 PetriNetUnfolderBase]: 622/1209 cut-off events. [2024-06-27 22:32:45,726 INFO L125 PetriNetUnfolderBase]: For 2222/2222 co-relation queries the response was YES. [2024-06-27 22:32:45,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3581 conditions, 1209 events. 622/1209 cut-off events. For 2222/2222 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6642 event pairs, 339 based on Foata normal form. 1/1162 useless extension candidates. Maximal degree in co-relation 3553. Up to 1006 conditions per place. [2024-06-27 22:32:45,735 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 51 selfloop transitions, 12 changer transitions 2/72 dead transitions. [2024-06-27 22:32:45,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 488 flow [2024-06-27 22:32:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 22:32:45,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:32:45,739 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 311 flow. Second operand 7 states and 112 transitions. [2024-06-27 22:32:45,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 488 flow [2024-06-27 22:32:45,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:45,745 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 341 flow [2024-06-27 22:32:45,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-06-27 22:32:45,747 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-06-27 22:32:45,747 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 341 flow [2024-06-27 22:32:45,747 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-06-27 22:32:45,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:45,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:45,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:32:45,748 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-06-27 22:32:45,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2009980739, now seen corresponding path program 1 times [2024-06-27 22:32:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:45,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851645423] [2024-06-27 22:32:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851645423] [2024-06-27 22:32:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851645423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298933001] [2024-06-27 22:32:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:47,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:47,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:47,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 341 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-06-27 22:32:47,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:47,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:47,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:47,791 INFO L124 PetriNetUnfolderBase]: 523/1039 cut-off events. [2024-06-27 22:32:47,792 INFO L125 PetriNetUnfolderBase]: For 2108/2108 co-relation queries the response was YES. [2024-06-27 22:32:47,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 1039 events. 523/1039 cut-off events. For 2108/2108 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5689 event pairs, 273 based on Foata normal form. 3/1003 useless extension candidates. Maximal degree in co-relation 3104. Up to 821 conditions per place. [2024-06-27 22:32:47,799 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 55 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-27 22:32:47,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 529 flow [2024-06-27 22:32:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-27 22:32:47,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-27 22:32:47,801 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 341 flow. Second operand 6 states and 105 transitions. [2024-06-27 22:32:47,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 529 flow [2024-06-27 22:32:47,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 500 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:47,805 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 362 flow [2024-06-27 22:32:47,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-27 22:32:47,806 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-06-27 22:32:47,806 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 362 flow [2024-06-27 22:32:47,806 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-06-27 22:32:47,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:47,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:32:47,807 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-06-27 22:32:47,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1518744768, now seen corresponding path program 2 times [2024-06-27 22:32:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909753638] [2024-06-27 22:32:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909753638] [2024-06-27 22:32:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909753638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:49,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756621441] [2024-06-27 22:32:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:49,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:49,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:49,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:49,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:49,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 362 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-06-27 22:32:49,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:49,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:49,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:49,616 INFO L124 PetriNetUnfolderBase]: 577/1157 cut-off events. [2024-06-27 22:32:49,617 INFO L125 PetriNetUnfolderBase]: For 2423/2423 co-relation queries the response was YES. [2024-06-27 22:32:49,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625 conditions, 1157 events. 577/1157 cut-off events. For 2423/2423 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6378 event pairs, 147 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 3595. Up to 840 conditions per place. [2024-06-27 22:32:49,624 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 70 selfloop transitions, 27 changer transitions 0/104 dead transitions. [2024-06-27 22:32:49,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 792 flow [2024-06-27 22:32:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-27 22:32:49,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-06-27 22:32:49,626 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 362 flow. Second operand 6 states and 116 transitions. [2024-06-27 22:32:49,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 792 flow [2024-06-27 22:32:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 766 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:49,632 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 560 flow [2024-06-27 22:32:49,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2024-06-27 22:32:49,633 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2024-06-27 22:32:49,633 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 560 flow [2024-06-27 22:32:49,633 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-06-27 22:32:49,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:49,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:49,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:32:49,634 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-06-27 22:32:49,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1981060974, now seen corresponding path program 3 times [2024-06-27 22:32:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822870362] [2024-06-27 22:32:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:50,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822870362] [2024-06-27 22:32:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822870362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360928048] [2024-06-27 22:32:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:50,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:50,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:50,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 560 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-06-27 22:32:50,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:50,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:51,162 INFO L124 PetriNetUnfolderBase]: 605/1218 cut-off events. [2024-06-27 22:32:51,163 INFO L125 PetriNetUnfolderBase]: For 3181/3181 co-relation queries the response was YES. [2024-06-27 22:32:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 1218 events. 605/1218 cut-off events. For 3181/3181 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6834 event pairs, 271 based on Foata normal form. 2/1169 useless extension candidates. Maximal degree in co-relation 4139. Up to 884 conditions per place. [2024-06-27 22:32:51,174 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 73 selfloop transitions, 32 changer transitions 0/112 dead transitions. [2024-06-27 22:32:51,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 112 transitions, 986 flow [2024-06-27 22:32:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-27 22:32:51,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2024-06-27 22:32:51,176 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 560 flow. Second operand 6 states and 107 transitions. [2024-06-27 22:32:51,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 112 transitions, 986 flow [2024-06-27 22:32:51,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 937 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:51,190 INFO L231 Difference]: Finished difference. Result has 75 places, 94 transitions, 790 flow [2024-06-27 22:32:51,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=75, PETRI_TRANSITIONS=94} [2024-06-27 22:32:51,191 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-06-27 22:32:51,191 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 790 flow [2024-06-27 22:32:51,191 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-06-27 22:32:51,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:51,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:51,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:32:51,192 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-06-27 22:32:51,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash -163551421, now seen corresponding path program 1 times [2024-06-27 22:32:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596841422] [2024-06-27 22:32:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:52,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596841422] [2024-06-27 22:32:52,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596841422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:52,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:52,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832130813] [2024-06-27 22:32:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:52,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:52,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 790 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-06-27 22:32:52,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:52,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:52,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:53,362 INFO L124 PetriNetUnfolderBase]: 635/1267 cut-off events. [2024-06-27 22:32:53,363 INFO L125 PetriNetUnfolderBase]: For 3853/3853 co-relation queries the response was YES. [2024-06-27 22:32:53,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 1267 events. 635/1267 cut-off events. For 3853/3853 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7159 event pairs, 146 based on Foata normal form. 2/1216 useless extension candidates. Maximal degree in co-relation 4498. Up to 836 conditions per place. [2024-06-27 22:32:53,373 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 90 selfloop transitions, 42 changer transitions 0/139 dead transitions. [2024-06-27 22:32:53,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1318 flow [2024-06-27 22:32:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 22:32:53,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:32:53,375 INFO L175 Difference]: Start difference. First operand has 75 places, 94 transitions, 790 flow. Second operand 8 states and 145 transitions. [2024-06-27 22:32:53,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1318 flow [2024-06-27 22:32:53,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:53,389 INFO L231 Difference]: Finished difference. Result has 82 places, 108 transitions, 944 flow [2024-06-27 22:32:53,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=944, PETRI_PLACES=82, PETRI_TRANSITIONS=108} [2024-06-27 22:32:53,390 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-06-27 22:32:53,390 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 944 flow [2024-06-27 22:32:53,391 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-06-27 22:32:53,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:53,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:53,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:32:53,391 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-06-27 22:32:53,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1283349077, now seen corresponding path program 2 times [2024-06-27 22:32:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499720439] [2024-06-27 22:32:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499720439] [2024-06-27 22:32:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499720439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315842442] [2024-06-27 22:32:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:54,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:54,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:54,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 944 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-06-27 22:32:54,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:54,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:54,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:55,115 INFO L124 PetriNetUnfolderBase]: 683/1356 cut-off events. [2024-06-27 22:32:55,116 INFO L125 PetriNetUnfolderBase]: For 4924/4924 co-relation queries the response was YES. [2024-06-27 22:32:55,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 1356 events. 683/1356 cut-off events. For 4924/4924 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7736 event pairs, 270 based on Foata normal form. 2/1303 useless extension candidates. Maximal degree in co-relation 5189. Up to 903 conditions per place. [2024-06-27 22:32:55,135 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 99 selfloop transitions, 44 changer transitions 0/150 dead transitions. [2024-06-27 22:32:55,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 150 transitions, 1476 flow [2024-06-27 22:32:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 22:32:55,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2024-06-27 22:32:55,137 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 944 flow. Second operand 7 states and 127 transitions. [2024-06-27 22:32:55,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 150 transitions, 1476 flow [2024-06-27 22:32:55,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 150 transitions, 1418 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:55,171 INFO L231 Difference]: Finished difference. Result has 87 places, 122 transitions, 1106 flow [2024-06-27 22:32:55,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1106, PETRI_PLACES=87, PETRI_TRANSITIONS=122} [2024-06-27 22:32:55,172 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-06-27 22:32:55,172 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 122 transitions, 1106 flow [2024-06-27 22:32:55,172 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-06-27 22:32:55,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:55,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:55,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:32:55,173 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-06-27 22:32:55,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash -728184573, now seen corresponding path program 3 times [2024-06-27 22:32:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:55,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342016169] [2024-06-27 22:32:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342016169] [2024-06-27 22:32:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342016169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:56,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426764926] [2024-06-27 22:32:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:56,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:56,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 122 transitions, 1106 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-06-27 22:32:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:56,670 INFO L124 PetriNetUnfolderBase]: 698/1387 cut-off events. [2024-06-27 22:32:56,671 INFO L125 PetriNetUnfolderBase]: For 5823/5823 co-relation queries the response was YES. [2024-06-27 22:32:56,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 1387 events. 698/1387 cut-off events. For 5823/5823 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7984 event pairs, 277 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 5607. Up to 1108 conditions per place. [2024-06-27 22:32:56,685 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 119 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2024-06-27 22:32:56,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 143 transitions, 1469 flow [2024-06-27 22:32:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 22:32:56,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 22:32:56,687 INFO L175 Difference]: Start difference. First operand has 87 places, 122 transitions, 1106 flow. Second operand 7 states and 116 transitions. [2024-06-27 22:32:56,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 143 transitions, 1469 flow [2024-06-27 22:32:56,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 1442 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:56,706 INFO L231 Difference]: Finished difference. Result has 92 places, 126 transitions, 1157 flow [2024-06-27 22:32:56,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1157, PETRI_PLACES=92, PETRI_TRANSITIONS=126} [2024-06-27 22:32:56,707 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-06-27 22:32:56,707 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 126 transitions, 1157 flow [2024-06-27 22:32:56,707 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-06-27 22:32:56,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:56,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:32:56,708 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-06-27 22:32:56,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1144035003, now seen corresponding path program 4 times [2024-06-27 22:32:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183767624] [2024-06-27 22:32:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183767624] [2024-06-27 22:32:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183767624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783740674] [2024-06-27 22:32:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:58,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:32:58,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 126 transitions, 1157 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-06-27 22:32:58,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:58,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:32:58,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:58,401 INFO L124 PetriNetUnfolderBase]: 696/1385 cut-off events. [2024-06-27 22:32:58,402 INFO L125 PetriNetUnfolderBase]: For 6365/6365 co-relation queries the response was YES. [2024-06-27 22:32:58,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1385 events. 696/1385 cut-off events. For 6365/6365 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7978 event pairs, 276 based on Foata normal form. 1/1328 useless extension candidates. Maximal degree in co-relation 5695. Up to 1079 conditions per place. [2024-06-27 22:32:58,412 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 24 changer transitions 0/153 dead transitions. [2024-06-27 22:32:58,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 153 transitions, 1588 flow [2024-06-27 22:32:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 22:32:58,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:32:58,418 INFO L175 Difference]: Start difference. First operand has 92 places, 126 transitions, 1157 flow. Second operand 7 states and 119 transitions. [2024-06-27 22:32:58,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 153 transitions, 1588 flow [2024-06-27 22:32:58,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 153 transitions, 1547 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:58,432 INFO L231 Difference]: Finished difference. Result has 94 places, 130 transitions, 1218 flow [2024-06-27 22:32:58,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1218, PETRI_PLACES=94, PETRI_TRANSITIONS=130} [2024-06-27 22:32:58,433 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2024-06-27 22:32:58,433 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 130 transitions, 1218 flow [2024-06-27 22:32:58,434 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-06-27 22:32:58,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:58,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:32:58,434 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-06-27 22:32:58,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash -422143663, now seen corresponding path program 1 times [2024-06-27 22:32:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693244059] [2024-06-27 22:32:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693244059] [2024-06-27 22:33:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693244059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:33:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737504418] [2024-06-27 22:33:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:00,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:33:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:33:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:33:00,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:00,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 130 transitions, 1218 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:00,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:00,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:00,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:00,559 INFO L124 PetriNetUnfolderBase]: 682/1302 cut-off events. [2024-06-27 22:33:00,559 INFO L125 PetriNetUnfolderBase]: For 6702/6705 co-relation queries the response was YES. [2024-06-27 22:33:00,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 1302 events. 682/1302 cut-off events. For 6702/6705 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7501 event pairs, 133 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 5520. Up to 876 conditions per place. [2024-06-27 22:33:00,572 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 105 selfloop transitions, 40 changer transitions 0/155 dead transitions. [2024-06-27 22:33:00,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 155 transitions, 1632 flow [2024-06-27 22:33:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:33:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:33:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-27 22:33:00,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:33:00,574 INFO L175 Difference]: Start difference. First operand has 94 places, 130 transitions, 1218 flow. Second operand 6 states and 120 transitions. [2024-06-27 22:33:00,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 155 transitions, 1632 flow [2024-06-27 22:33:00,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 155 transitions, 1575 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:00,593 INFO L231 Difference]: Finished difference. Result has 95 places, 134 transitions, 1278 flow [2024-06-27 22:33:00,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1278, PETRI_PLACES=95, PETRI_TRANSITIONS=134} [2024-06-27 22:33:00,593 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2024-06-27 22:33:00,594 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 134 transitions, 1278 flow [2024-06-27 22:33:00,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:00,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:00,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:00,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:33:00,595 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-06-27 22:33:00,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1006685135, now seen corresponding path program 2 times [2024-06-27 22:33:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:00,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071475086] [2024-06-27 22:33:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071475086] [2024-06-27 22:33:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071475086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:33:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817348435] [2024-06-27 22:33:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:02,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:33:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:33:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:33:02,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:02,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 134 transitions, 1278 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:02,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:02,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:02,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:02,536 INFO L124 PetriNetUnfolderBase]: 688/1370 cut-off events. [2024-06-27 22:33:02,537 INFO L125 PetriNetUnfolderBase]: For 7418/7421 co-relation queries the response was YES. [2024-06-27 22:33:02,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5828 conditions, 1370 events. 688/1370 cut-off events. For 7418/7421 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7997 event pairs, 142 based on Foata normal form. 1/1309 useless extension candidates. Maximal degree in co-relation 5782. Up to 915 conditions per place. [2024-06-27 22:33:02,550 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 95 selfloop transitions, 57 changer transitions 0/162 dead transitions. [2024-06-27 22:33:02,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 162 transitions, 1741 flow [2024-06-27 22:33:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 22:33:02,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2024-06-27 22:33:02,552 INFO L175 Difference]: Start difference. First operand has 95 places, 134 transitions, 1278 flow. Second operand 7 states and 127 transitions. [2024-06-27 22:33:02,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 162 transitions, 1741 flow [2024-06-27 22:33:02,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 162 transitions, 1689 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:33:02,573 INFO L231 Difference]: Finished difference. Result has 102 places, 142 transitions, 1510 flow [2024-06-27 22:33:02,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1510, PETRI_PLACES=102, PETRI_TRANSITIONS=142} [2024-06-27 22:33:02,573 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2024-06-27 22:33:02,573 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 142 transitions, 1510 flow [2024-06-27 22:33:02,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:02,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:02,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:02,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:33:02,574 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-06-27 22:33:02,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -774843194, now seen corresponding path program 1 times [2024-06-27 22:33:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256987633] [2024-06-27 22:33:02,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256987633] [2024-06-27 22:33:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256987633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:33:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425270835] [2024-06-27 22:33:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:03,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:33:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:33:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:33:03,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:03,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 142 transitions, 1510 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:03,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:03,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:04,477 INFO L124 PetriNetUnfolderBase]: 750/1471 cut-off events. [2024-06-27 22:33:04,479 INFO L125 PetriNetUnfolderBase]: For 9638/9638 co-relation queries the response was YES. [2024-06-27 22:33:04,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6945 conditions, 1471 events. 750/1471 cut-off events. For 9638/9638 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8551 event pairs, 162 based on Foata normal form. 1/1413 useless extension candidates. Maximal degree in co-relation 6894. Up to 968 conditions per place. [2024-06-27 22:33:04,492 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 115 selfloop transitions, 70 changer transitions 0/192 dead transitions. [2024-06-27 22:33:04,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 192 transitions, 2298 flow [2024-06-27 22:33:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:33:04,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:33:04,495 INFO L175 Difference]: Start difference. First operand has 102 places, 142 transitions, 1510 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:33:04,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 192 transitions, 2298 flow [2024-06-27 22:33:04,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 192 transitions, 2230 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:04,523 INFO L231 Difference]: Finished difference. Result has 109 places, 162 transitions, 1871 flow [2024-06-27 22:33:04,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1871, PETRI_PLACES=109, PETRI_TRANSITIONS=162} [2024-06-27 22:33:04,524 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2024-06-27 22:33:04,525 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 162 transitions, 1871 flow [2024-06-27 22:33:04,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:04,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:04,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:04,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:33:04,526 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-06-27 22:33:04,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash -187380592, now seen corresponding path program 2 times [2024-06-27 22:33:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:04,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986676101] [2024-06-27 22:33:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986676101] [2024-06-27 22:33:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986676101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4339958] [2024-06-27 22:33:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:06,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:06,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:06,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 162 transitions, 1871 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-06-27 22:33:06,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:06,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:06,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:06,877 INFO L124 PetriNetUnfolderBase]: 752/1475 cut-off events. [2024-06-27 22:33:06,877 INFO L125 PetriNetUnfolderBase]: For 10576/10576 co-relation queries the response was YES. [2024-06-27 22:33:06,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1475 events. 752/1475 cut-off events. For 10576/10576 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8554 event pairs, 160 based on Foata normal form. 1/1416 useless extension candidates. Maximal degree in co-relation 7273. Up to 971 conditions per place. [2024-06-27 22:33:06,892 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 118 selfloop transitions, 71 changer transitions 0/196 dead transitions. [2024-06-27 22:33:06,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 196 transitions, 2480 flow [2024-06-27 22:33:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:33:06,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:33:06,895 INFO L175 Difference]: Start difference. First operand has 109 places, 162 transitions, 1871 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:33:06,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 196 transitions, 2480 flow [2024-06-27 22:33:06,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 196 transitions, 2382 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:06,926 INFO L231 Difference]: Finished difference. Result has 114 places, 165 transitions, 1957 flow [2024-06-27 22:33:06,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1957, PETRI_PLACES=114, PETRI_TRANSITIONS=165} [2024-06-27 22:33:06,927 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 74 predicate places. [2024-06-27 22:33:06,927 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 165 transitions, 1957 flow [2024-06-27 22:33:06,927 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-06-27 22:33:06,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:06,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:33:06,928 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-06-27 22:33:06,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash -588665145, now seen corresponding path program 1 times [2024-06-27 22:33:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:06,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097269615] [2024-06-27 22:33:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:08,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097269615] [2024-06-27 22:33:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097269615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:08,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868871540] [2024-06-27 22:33:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:08,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:08,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 165 transitions, 1957 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-06-27 22:33:08,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:08,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:08,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:09,500 INFO L124 PetriNetUnfolderBase]: 832/1596 cut-off events. [2024-06-27 22:33:09,500 INFO L125 PetriNetUnfolderBase]: For 13238/13238 co-relation queries the response was YES. [2024-06-27 22:33:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8010 conditions, 1596 events. 832/1596 cut-off events. For 13238/13238 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9289 event pairs, 165 based on Foata normal form. 4/1540 useless extension candidates. Maximal degree in co-relation 7955. Up to 938 conditions per place. [2024-06-27 22:33:09,512 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 138 selfloop transitions, 71 changer transitions 0/216 dead transitions. [2024-06-27 22:33:09,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 216 transitions, 2767 flow [2024-06-27 22:33:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:33:09,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 22:33:09,516 INFO L175 Difference]: Start difference. First operand has 114 places, 165 transitions, 1957 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:33:09,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 216 transitions, 2767 flow [2024-06-27 22:33:09,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 216 transitions, 2619 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:09,547 INFO L231 Difference]: Finished difference. Result has 118 places, 179 transitions, 2119 flow [2024-06-27 22:33:09,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2119, PETRI_PLACES=118, PETRI_TRANSITIONS=179} [2024-06-27 22:33:09,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2024-06-27 22:33:09,548 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 179 transitions, 2119 flow [2024-06-27 22:33:09,549 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-06-27 22:33:09,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:09,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:09,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:33:09,549 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-06-27 22:33:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2017540377, now seen corresponding path program 2 times [2024-06-27 22:33:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516576464] [2024-06-27 22:33:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:10,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:10,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516576464] [2024-06-27 22:33:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516576464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:10,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442444216] [2024-06-27 22:33:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:10,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:11,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:11,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 179 transitions, 2119 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-06-27 22:33:11,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:11,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:11,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:11,621 INFO L124 PetriNetUnfolderBase]: 928/1776 cut-off events. [2024-06-27 22:33:11,621 INFO L125 PetriNetUnfolderBase]: For 16051/16051 co-relation queries the response was YES. [2024-06-27 22:33:11,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9318 conditions, 1776 events. 928/1776 cut-off events. For 16051/16051 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10516 event pairs, 296 based on Foata normal form. 4/1715 useless extension candidates. Maximal degree in co-relation 9260. Up to 1045 conditions per place. [2024-06-27 22:33:11,637 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 161 selfloop transitions, 66 changer transitions 0/234 dead transitions. [2024-06-27 22:33:11,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 234 transitions, 3041 flow [2024-06-27 22:33:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 22:33:11,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-06-27 22:33:11,639 INFO L175 Difference]: Start difference. First operand has 118 places, 179 transitions, 2119 flow. Second operand 9 states and 157 transitions. [2024-06-27 22:33:11,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 234 transitions, 3041 flow [2024-06-27 22:33:11,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 234 transitions, 2925 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:11,677 INFO L231 Difference]: Finished difference. Result has 124 places, 193 transitions, 2340 flow [2024-06-27 22:33:11,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2340, PETRI_PLACES=124, PETRI_TRANSITIONS=193} [2024-06-27 22:33:11,677 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-06-27 22:33:11,678 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 193 transitions, 2340 flow [2024-06-27 22:33:11,678 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-06-27 22:33:11,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:11,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:11,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:33:11,678 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-06-27 22:33:11,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1189509412, now seen corresponding path program 3 times [2024-06-27 22:33:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845818869] [2024-06-27 22:33:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845818869] [2024-06-27 22:33:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845818869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:12,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582904434] [2024-06-27 22:33:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:12,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:12,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:12,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 193 transitions, 2340 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-06-27 22:33:12,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:12,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:12,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:13,390 INFO L124 PetriNetUnfolderBase]: 947/1812 cut-off events. [2024-06-27 22:33:13,390 INFO L125 PetriNetUnfolderBase]: For 17109/17109 co-relation queries the response was YES. [2024-06-27 22:33:13,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9699 conditions, 1812 events. 947/1812 cut-off events. For 17109/17109 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10783 event pairs, 296 based on Foata normal form. 1/1747 useless extension candidates. Maximal degree in co-relation 9638. Up to 1271 conditions per place. [2024-06-27 22:33:13,402 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 163 selfloop transitions, 68 changer transitions 0/238 dead transitions. [2024-06-27 22:33:13,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 238 transitions, 3169 flow [2024-06-27 22:33:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:33:13,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-27 22:33:13,404 INFO L175 Difference]: Start difference. First operand has 124 places, 193 transitions, 2340 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:33:13,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 238 transitions, 3169 flow [2024-06-27 22:33:13,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 238 transitions, 3084 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:13,441 INFO L231 Difference]: Finished difference. Result has 127 places, 201 transitions, 2499 flow [2024-06-27 22:33:13,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2499, PETRI_PLACES=127, PETRI_TRANSITIONS=201} [2024-06-27 22:33:13,441 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2024-06-27 22:33:13,442 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 201 transitions, 2499 flow [2024-06-27 22:33:13,442 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-06-27 22:33:13,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:13,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:13,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:33:13,442 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-06-27 22:33:13,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2017534580, now seen corresponding path program 4 times [2024-06-27 22:33:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833736007] [2024-06-27 22:33:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833736007] [2024-06-27 22:33:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833736007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:33:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358326306] [2024-06-27 22:33:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:14,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:33:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:33:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:33:14,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:14,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 201 transitions, 2499 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:14,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:14,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:15,068 INFO L124 PetriNetUnfolderBase]: 962/1836 cut-off events. [2024-06-27 22:33:15,068 INFO L125 PetriNetUnfolderBase]: For 17523/17523 co-relation queries the response was YES. [2024-06-27 22:33:15,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9914 conditions, 1836 events. 962/1836 cut-off events. For 17523/17523 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10963 event pairs, 304 based on Foata normal form. 1/1769 useless extension candidates. Maximal degree in co-relation 9852. Up to 1287 conditions per place. [2024-06-27 22:33:15,085 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 154 selfloop transitions, 80 changer transitions 0/241 dead transitions. [2024-06-27 22:33:15,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 241 transitions, 3314 flow [2024-06-27 22:33:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 22:33:15,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:33:15,087 INFO L175 Difference]: Start difference. First operand has 127 places, 201 transitions, 2499 flow. Second operand 7 states and 128 transitions. [2024-06-27 22:33:15,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 241 transitions, 3314 flow [2024-06-27 22:33:15,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 241 transitions, 3146 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:15,131 INFO L231 Difference]: Finished difference. Result has 129 places, 209 transitions, 2652 flow [2024-06-27 22:33:15,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2343, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2652, PETRI_PLACES=129, PETRI_TRANSITIONS=209} [2024-06-27 22:33:15,132 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-06-27 22:33:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 209 transitions, 2652 flow [2024-06-27 22:33:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:15,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:15,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:15,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:33:15,133 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-06-27 22:33:15,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1098588485, now seen corresponding path program 3 times [2024-06-27 22:33:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669279927] [2024-06-27 22:33:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669279927] [2024-06-27 22:33:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669279927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:16,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303699012] [2024-06-27 22:33:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:16,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:16,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:16,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:16,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:16,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 209 transitions, 2652 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-06-27 22:33:16,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:16,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:16,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:16,832 INFO L124 PetriNetUnfolderBase]: 993/1877 cut-off events. [2024-06-27 22:33:16,832 INFO L125 PetriNetUnfolderBase]: For 19379/19379 co-relation queries the response was YES. [2024-06-27 22:33:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10356 conditions, 1877 events. 993/1877 cut-off events. For 19379/19379 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11302 event pairs, 316 based on Foata normal form. 3/1814 useless extension candidates. Maximal degree in co-relation 10292. Up to 1522 conditions per place. [2024-06-27 22:33:16,846 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 210 selfloop transitions, 23 changer transitions 0/240 dead transitions. [2024-06-27 22:33:16,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 240 transitions, 3297 flow [2024-06-27 22:33:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 22:33:16,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-06-27 22:33:16,848 INFO L175 Difference]: Start difference. First operand has 129 places, 209 transitions, 2652 flow. Second operand 9 states and 142 transitions. [2024-06-27 22:33:16,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 240 transitions, 3297 flow [2024-06-27 22:33:16,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 240 transitions, 3212 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:16,895 INFO L231 Difference]: Finished difference. Result has 136 places, 217 transitions, 2723 flow [2024-06-27 22:33:16,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2723, PETRI_PLACES=136, PETRI_TRANSITIONS=217} [2024-06-27 22:33:16,896 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-06-27 22:33:16,896 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 217 transitions, 2723 flow [2024-06-27 22:33:16,897 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-06-27 22:33:16,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:16,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:16,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:33:16,897 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-06-27 22:33:16,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1333400159, now seen corresponding path program 4 times [2024-06-27 22:33:16,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:16,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177477767] [2024-06-27 22:33:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177477767] [2024-06-27 22:33:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177477767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906483867] [2024-06-27 22:33:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:18,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:18,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 217 transitions, 2723 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-06-27 22:33:18,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:18,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:18,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:18,679 INFO L124 PetriNetUnfolderBase]: 1023/1936 cut-off events. [2024-06-27 22:33:18,679 INFO L125 PetriNetUnfolderBase]: For 21650/21650 co-relation queries the response was YES. [2024-06-27 22:33:18,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10805 conditions, 1936 events. 1023/1936 cut-off events. For 21650/21650 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11740 event pairs, 316 based on Foata normal form. 2/1870 useless extension candidates. Maximal degree in co-relation 10739. Up to 1484 conditions per place. [2024-06-27 22:33:18,691 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 216 selfloop transitions, 38 changer transitions 0/261 dead transitions. [2024-06-27 22:33:18,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 261 transitions, 3612 flow [2024-06-27 22:33:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 22:33:18,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2024-06-27 22:33:18,693 INFO L175 Difference]: Start difference. First operand has 136 places, 217 transitions, 2723 flow. Second operand 9 states and 149 transitions. [2024-06-27 22:33:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 261 transitions, 3612 flow [2024-06-27 22:33:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 261 transitions, 3478 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-27 22:33:18,746 INFO L231 Difference]: Finished difference. Result has 138 places, 226 transitions, 2831 flow [2024-06-27 22:33:18,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2608, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2831, PETRI_PLACES=138, PETRI_TRANSITIONS=226} [2024-06-27 22:33:18,747 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-06-27 22:33:18,747 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 226 transitions, 2831 flow [2024-06-27 22:33:18,747 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-06-27 22:33:18,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:18,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:18,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:33:18,748 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-06-27 22:33:18,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 472741474, now seen corresponding path program 5 times [2024-06-27 22:33:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898447914] [2024-06-27 22:33:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:19,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-06-27 22:33:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898447914] [2024-06-27 22:33:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898447914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:19,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681226737] [2024-06-27 22:33:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:19,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:19,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:19,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 226 transitions, 2831 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-06-27 22:33:19,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:19,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:19,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:20,448 INFO L124 PetriNetUnfolderBase]: 1042/1966 cut-off events. [2024-06-27 22:33:20,449 INFO L125 PetriNetUnfolderBase]: For 22095/22095 co-relation queries the response was YES. [2024-06-27 22:33:20,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 1966 events. 1042/1966 cut-off events. For 22095/22095 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11948 event pairs, 316 based on Foata normal form. 1/1899 useless extension candidates. Maximal degree in co-relation 10895. Up to 1592 conditions per place. [2024-06-27 22:33:20,464 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 222 selfloop transitions, 35 changer transitions 0/264 dead transitions. [2024-06-27 22:33:20,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 264 transitions, 3632 flow [2024-06-27 22:33:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 22:33:20,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-27 22:33:20,466 INFO L175 Difference]: Start difference. First operand has 138 places, 226 transitions, 2831 flow. Second operand 8 states and 135 transitions. [2024-06-27 22:33:20,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 264 transitions, 3632 flow [2024-06-27 22:33:20,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 264 transitions, 3571 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:20,525 INFO L231 Difference]: Finished difference. Result has 141 places, 234 transitions, 2969 flow [2024-06-27 22:33:20,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2969, PETRI_PLACES=141, PETRI_TRANSITIONS=234} [2024-06-27 22:33:20,526 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-06-27 22:33:20,526 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 234 transitions, 2969 flow [2024-06-27 22:33:20,526 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-06-27 22:33:20,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:20,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:20,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:33:20,527 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-06-27 22:33:20,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -186491772, now seen corresponding path program 6 times [2024-06-27 22:33:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:20,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893034700] [2024-06-27 22:33:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893034700] [2024-06-27 22:33:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893034700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:21,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404416593] [2024-06-27 22:33:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:21,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:21,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:21,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:21,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 234 transitions, 2969 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-06-27 22:33:21,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:21,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:21,943 INFO L124 PetriNetUnfolderBase]: 1040/1960 cut-off events. [2024-06-27 22:33:21,943 INFO L125 PetriNetUnfolderBase]: For 21434/21434 co-relation queries the response was YES. [2024-06-27 22:33:21,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10878 conditions, 1960 events. 1040/1960 cut-off events. For 21434/21434 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11904 event pairs, 320 based on Foata normal form. 1/1893 useless extension candidates. Maximal degree in co-relation 10811. Up to 1615 conditions per place. [2024-06-27 22:33:21,956 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 225 selfloop transitions, 26 changer transitions 0/258 dead transitions. [2024-06-27 22:33:21,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 258 transitions, 3593 flow [2024-06-27 22:33:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 22:33:21,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:33:21,958 INFO L175 Difference]: Start difference. First operand has 141 places, 234 transitions, 2969 flow. Second operand 8 states and 132 transitions. [2024-06-27 22:33:21,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 258 transitions, 3593 flow [2024-06-27 22:33:21,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 258 transitions, 3501 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:21,999 INFO L231 Difference]: Finished difference. Result has 143 places, 234 transitions, 2941 flow [2024-06-27 22:33:22,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2941, PETRI_PLACES=143, PETRI_TRANSITIONS=234} [2024-06-27 22:33:22,000 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-06-27 22:33:22,000 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 234 transitions, 2941 flow [2024-06-27 22:33:22,001 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-06-27 22:33:22,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:22,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:22,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:33:22,001 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-06-27 22:33:22,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1097100287, now seen corresponding path program 5 times [2024-06-27 22:33:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:22,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866558156] [2024-06-27 22:33:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866558156] [2024-06-27 22:33:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866558156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210482307] [2024-06-27 22:33:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:23,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:23,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:23,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:23,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 234 transitions, 2941 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-06-27 22:33:23,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:23,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:23,702 INFO L124 PetriNetUnfolderBase]: 1036/1958 cut-off events. [2024-06-27 22:33:23,702 INFO L125 PetriNetUnfolderBase]: For 21757/21757 co-relation queries the response was YES. [2024-06-27 22:33:23,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10777 conditions, 1958 events. 1036/1958 cut-off events. For 21757/21757 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11929 event pairs, 319 based on Foata normal form. 2/1891 useless extension candidates. Maximal degree in co-relation 10709. Up to 1563 conditions per place. [2024-06-27 22:33:23,715 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 227 selfloop transitions, 28 changer transitions 0/262 dead transitions. [2024-06-27 22:33:23,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 262 transitions, 3591 flow [2024-06-27 22:33:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-27 22:33:23,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44753086419753085 [2024-06-27 22:33:23,716 INFO L175 Difference]: Start difference. First operand has 143 places, 234 transitions, 2941 flow. Second operand 9 states and 145 transitions. [2024-06-27 22:33:23,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 262 transitions, 3591 flow [2024-06-27 22:33:23,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 262 transitions, 3462 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:23,764 INFO L231 Difference]: Finished difference. Result has 145 places, 234 transitions, 2877 flow [2024-06-27 22:33:23,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2812, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2877, PETRI_PLACES=145, PETRI_TRANSITIONS=234} [2024-06-27 22:33:23,765 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2024-06-27 22:33:23,765 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 234 transitions, 2877 flow [2024-06-27 22:33:23,765 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-06-27 22:33:23,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:23,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:23,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:33:23,766 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-06-27 22:33:23,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -186184934, now seen corresponding path program 1 times [2024-06-27 22:33:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204222487] [2024-06-27 22:33:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204222487] [2024-06-27 22:33:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204222487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878267387] [2024-06-27 22:33:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:25,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:25,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:25,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:25,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:25,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 234 transitions, 2877 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-06-27 22:33:25,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:25,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:25,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:26,463 INFO L124 PetriNetUnfolderBase]: 1033/1948 cut-off events. [2024-06-27 22:33:26,464 INFO L125 PetriNetUnfolderBase]: For 20716/20716 co-relation queries the response was YES. [2024-06-27 22:33:26,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10637 conditions, 1948 events. 1033/1948 cut-off events. For 20716/20716 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11807 event pairs, 312 based on Foata normal form. 2/1882 useless extension candidates. Maximal degree in co-relation 10568. Up to 1578 conditions per place. [2024-06-27 22:33:26,477 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 232 selfloop transitions, 22 changer transitions 0/261 dead transitions. [2024-06-27 22:33:26,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 261 transitions, 3489 flow [2024-06-27 22:33:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-27 22:33:26,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:33:26,478 INFO L175 Difference]: Start difference. First operand has 145 places, 234 transitions, 2877 flow. Second operand 9 states and 144 transitions. [2024-06-27 22:33:26,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 261 transitions, 3489 flow [2024-06-27 22:33:26,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 261 transitions, 3407 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:26,519 INFO L231 Difference]: Finished difference. Result has 148 places, 236 transitions, 2870 flow [2024-06-27 22:33:26,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2870, PETRI_PLACES=148, PETRI_TRANSITIONS=236} [2024-06-27 22:33:26,520 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 108 predicate places. [2024-06-27 22:33:26,520 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 236 transitions, 2870 flow [2024-06-27 22:33:26,520 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-06-27 22:33:26,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:26,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:26,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:33:26,521 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-06-27 22:33:26,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1231122250, now seen corresponding path program 1 times [2024-06-27 22:33:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591750236] [2024-06-27 22:33:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:27,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:27,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591750236] [2024-06-27 22:33:27,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591750236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210435808] [2024-06-27 22:33:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:27,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:27,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:27,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 236 transitions, 2870 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:27,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:27,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:27,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:28,337 INFO L124 PetriNetUnfolderBase]: 994/1842 cut-off events. [2024-06-27 22:33:28,337 INFO L125 PetriNetUnfolderBase]: For 20449/20451 co-relation queries the response was YES. [2024-06-27 22:33:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10067 conditions, 1842 events. 994/1842 cut-off events. For 20449/20451 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11120 event pairs, 78 based on Foata normal form. 2/1785 useless extension candidates. Maximal degree in co-relation 9996. Up to 1162 conditions per place. [2024-06-27 22:33:28,350 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 201 selfloop transitions, 57 changer transitions 0/269 dead transitions. [2024-06-27 22:33:28,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 269 transitions, 3610 flow [2024-06-27 22:33:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:33:28,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:33:28,351 INFO L175 Difference]: Start difference. First operand has 148 places, 236 transitions, 2870 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:33:28,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 269 transitions, 3610 flow [2024-06-27 22:33:28,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 269 transitions, 3555 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:28,395 INFO L231 Difference]: Finished difference. Result has 152 places, 240 transitions, 3015 flow [2024-06-27 22:33:28,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3015, PETRI_PLACES=152, PETRI_TRANSITIONS=240} [2024-06-27 22:33:28,395 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-06-27 22:33:28,395 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 240 transitions, 3015 flow [2024-06-27 22:33:28,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:28,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:28,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:28,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:33:28,396 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-06-27 22:33:28,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -506312568, now seen corresponding path program 1 times [2024-06-27 22:33:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241030372] [2024-06-27 22:33:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241030372] [2024-06-27 22:33:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241030372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270883911] [2024-06-27 22:33:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:29,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:29,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:29,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:29,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 240 transitions, 3015 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:29,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:29,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:29,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:30,226 INFO L124 PetriNetUnfolderBase]: 1008/1864 cut-off events. [2024-06-27 22:33:30,226 INFO L125 PetriNetUnfolderBase]: For 21970/21972 co-relation queries the response was YES. [2024-06-27 22:33:30,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 1864 events. 1008/1864 cut-off events. For 21970/21972 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11270 event pairs, 135 based on Foata normal form. 1/1803 useless extension candidates. Maximal degree in co-relation 10434. Up to 1031 conditions per place. [2024-06-27 22:33:30,239 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 168 selfloop transitions, 96 changer transitions 0/275 dead transitions. [2024-06-27 22:33:30,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 275 transitions, 3804 flow [2024-06-27 22:33:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 22:33:30,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:33:30,241 INFO L175 Difference]: Start difference. First operand has 152 places, 240 transitions, 3015 flow. Second operand 7 states and 140 transitions. [2024-06-27 22:33:30,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 275 transitions, 3804 flow [2024-06-27 22:33:30,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 275 transitions, 3713 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:30,287 INFO L231 Difference]: Finished difference. Result has 157 places, 248 transitions, 3296 flow [2024-06-27 22:33:30,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2925, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3296, PETRI_PLACES=157, PETRI_TRANSITIONS=248} [2024-06-27 22:33:30,288 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-06-27 22:33:30,288 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 248 transitions, 3296 flow [2024-06-27 22:33:30,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:30,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:30,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:30,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:33:30,288 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-06-27 22:33:30,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -506312692, now seen corresponding path program 2 times [2024-06-27 22:33:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:30,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460345723] [2024-06-27 22:33:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460345723] [2024-06-27 22:33:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460345723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533845958] [2024-06-27 22:33:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:31,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:31,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:31,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 248 transitions, 3296 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:31,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:31,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:31,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:32,155 INFO L124 PetriNetUnfolderBase]: 1024/1892 cut-off events. [2024-06-27 22:33:32,156 INFO L125 PetriNetUnfolderBase]: For 24116/24118 co-relation queries the response was YES. [2024-06-27 22:33:32,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11045 conditions, 1892 events. 1024/1892 cut-off events. For 24116/24118 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11514 event pairs, 113 based on Foata normal form. 2/1835 useless extension candidates. Maximal degree in co-relation 10970. Up to 1316 conditions per place. [2024-06-27 22:33:32,168 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 208 selfloop transitions, 57 changer transitions 0/276 dead transitions. [2024-06-27 22:33:32,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 276 transitions, 3956 flow [2024-06-27 22:33:32,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:33:32,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:33:32,169 INFO L175 Difference]: Start difference. First operand has 157 places, 248 transitions, 3296 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:33:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 276 transitions, 3956 flow [2024-06-27 22:33:32,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 276 transitions, 3850 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:32,227 INFO L231 Difference]: Finished difference. Result has 161 places, 249 transitions, 3319 flow [2024-06-27 22:33:32,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3191, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3319, PETRI_PLACES=161, PETRI_TRANSITIONS=249} [2024-06-27 22:33:32,227 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2024-06-27 22:33:32,227 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 249 transitions, 3319 flow [2024-06-27 22:33:32,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:32,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:32,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:32,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:33:32,228 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:32,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -102226638, now seen corresponding path program 2 times [2024-06-27 22:33:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101378021] [2024-06-27 22:33:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101378021] [2024-06-27 22:33:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101378021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:33,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365076682] [2024-06-27 22:33:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:33,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:33,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:33,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 249 transitions, 3319 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:33,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:33,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:33,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:34,017 INFO L124 PetriNetUnfolderBase]: 1041/1998 cut-off events. [2024-06-27 22:33:34,017 INFO L125 PetriNetUnfolderBase]: For 25009/25011 co-relation queries the response was YES. [2024-06-27 22:33:34,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 1998 events. 1041/1998 cut-off events. For 25009/25011 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12547 event pairs, 164 based on Foata normal form. 1/1917 useless extension candidates. Maximal degree in co-relation 11167. Up to 1254 conditions per place. [2024-06-27 22:33:34,031 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 153 selfloop transitions, 115 changer transitions 0/279 dead transitions. [2024-06-27 22:33:34,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 279 transitions, 4043 flow [2024-06-27 22:33:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 22:33:34,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-27 22:33:34,033 INFO L175 Difference]: Start difference. First operand has 161 places, 249 transitions, 3319 flow. Second operand 7 states and 136 transitions. [2024-06-27 22:33:34,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 279 transitions, 4043 flow [2024-06-27 22:33:34,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 279 transitions, 3908 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:34,089 INFO L231 Difference]: Finished difference. Result has 162 places, 254 transitions, 3520 flow [2024-06-27 22:33:34,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3184, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3520, PETRI_PLACES=162, PETRI_TRANSITIONS=254} [2024-06-27 22:33:34,089 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 122 predicate places. [2024-06-27 22:33:34,089 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 254 transitions, 3520 flow [2024-06-27 22:33:34,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:34,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:34,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:34,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:33:34,090 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-06-27 22:33:34,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash -115637362, now seen corresponding path program 3 times [2024-06-27 22:33:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354014955] [2024-06-27 22:33:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354014955] [2024-06-27 22:33:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354014955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459560875] [2024-06-27 22:33:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:35,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:35,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:35,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 254 transitions, 3520 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:35,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:35,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:35,973 INFO L124 PetriNetUnfolderBase]: 1042/1992 cut-off events. [2024-06-27 22:33:35,973 INFO L125 PetriNetUnfolderBase]: For 26098/26100 co-relation queries the response was YES. [2024-06-27 22:33:35,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11413 conditions, 1992 events. 1042/1992 cut-off events. For 26098/26100 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12475 event pairs, 150 based on Foata normal form. 2/1915 useless extension candidates. Maximal degree in co-relation 11338. Up to 1417 conditions per place. [2024-06-27 22:33:35,988 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 206 selfloop transitions, 63 changer transitions 0/280 dead transitions. [2024-06-27 22:33:35,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 280 transitions, 4187 flow [2024-06-27 22:33:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 22:33:35,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:33:35,991 INFO L175 Difference]: Start difference. First operand has 162 places, 254 transitions, 3520 flow. Second operand 7 states and 133 transitions. [2024-06-27 22:33:35,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 280 transitions, 4187 flow [2024-06-27 22:33:36,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 280 transitions, 3952 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:36,050 INFO L231 Difference]: Finished difference. Result has 165 places, 255 transitions, 3427 flow [2024-06-27 22:33:36,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3427, PETRI_PLACES=165, PETRI_TRANSITIONS=255} [2024-06-27 22:33:36,051 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 125 predicate places. [2024-06-27 22:33:36,051 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 255 transitions, 3427 flow [2024-06-27 22:33:36,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:36,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:36,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:36,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:33:36,051 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-06-27 22:33:36,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -503516058, now seen corresponding path program 3 times [2024-06-27 22:33:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029783665] [2024-06-27 22:33:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029783665] [2024-06-27 22:33:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029783665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480856046] [2024-06-27 22:33:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:37,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:37,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:37,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 255 transitions, 3427 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:37,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:37,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:37,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:37,908 INFO L124 PetriNetUnfolderBase]: 1053/2018 cut-off events. [2024-06-27 22:33:37,908 INFO L125 PetriNetUnfolderBase]: For 25890/25892 co-relation queries the response was YES. [2024-06-27 22:33:37,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 2018 events. 1053/2018 cut-off events. For 25890/25892 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12690 event pairs, 163 based on Foata normal form. 1/1937 useless extension candidates. Maximal degree in co-relation 11347. Up to 1238 conditions per place. [2024-06-27 22:33:37,924 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 157 selfloop transitions, 115 changer transitions 0/283 dead transitions. [2024-06-27 22:33:37,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 283 transitions, 4131 flow [2024-06-27 22:33:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 22:33:37,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:33:37,925 INFO L175 Difference]: Start difference. First operand has 165 places, 255 transitions, 3427 flow. Second operand 8 states and 147 transitions. [2024-06-27 22:33:37,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 283 transitions, 4131 flow [2024-06-27 22:33:37,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 283 transitions, 4004 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:37,986 INFO L231 Difference]: Finished difference. Result has 168 places, 257 transitions, 3562 flow [2024-06-27 22:33:37,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3300, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3562, PETRI_PLACES=168, PETRI_TRANSITIONS=257} [2024-06-27 22:33:37,986 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-06-27 22:33:37,987 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 257 transitions, 3562 flow [2024-06-27 22:33:37,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:37,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:37,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:33:37,987 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-06-27 22:33:37,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1505070514, now seen corresponding path program 4 times [2024-06-27 22:33:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536575027] [2024-06-27 22:33:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:39,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-06-27 22:33:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536575027] [2024-06-27 22:33:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536575027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125160388] [2024-06-27 22:33:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:39,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:39,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 257 transitions, 3562 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:39,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:39,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:39,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:39,964 INFO L124 PetriNetUnfolderBase]: 1048/1880 cut-off events. [2024-06-27 22:33:39,964 INFO L125 PetriNetUnfolderBase]: For 26508/26510 co-relation queries the response was YES. [2024-06-27 22:33:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11485 conditions, 1880 events. 1048/1880 cut-off events. For 26508/26510 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11129 event pairs, 128 based on Foata normal form. 1/1831 useless extension candidates. Maximal degree in co-relation 11407. Up to 1162 conditions per place. [2024-06-27 22:33:39,977 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 160 selfloop transitions, 124 changer transitions 0/295 dead transitions. [2024-06-27 22:33:39,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 295 transitions, 4427 flow [2024-06-27 22:33:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:33:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:33:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-27 22:33:39,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2024-06-27 22:33:39,979 INFO L175 Difference]: Start difference. First operand has 168 places, 257 transitions, 3562 flow. Second operand 7 states and 145 transitions. [2024-06-27 22:33:39,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 295 transitions, 4427 flow [2024-06-27 22:33:40,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 295 transitions, 4185 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:40,050 INFO L231 Difference]: Finished difference. Result has 171 places, 262 transitions, 3793 flow [2024-06-27 22:33:40,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3324, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3793, PETRI_PLACES=171, PETRI_TRANSITIONS=262} [2024-06-27 22:33:40,051 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 131 predicate places. [2024-06-27 22:33:40,051 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 262 transitions, 3793 flow [2024-06-27 22:33:40,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:40,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:40,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:40,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:33:40,052 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-06-27 22:33:40,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1740901500, now seen corresponding path program 1 times [2024-06-27 22:33:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658277668] [2024-06-27 22:33:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658277668] [2024-06-27 22:33:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658277668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668541574] [2024-06-27 22:33:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:41,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:41,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 262 transitions, 3793 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-06-27 22:33:41,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:41,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:41,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:42,304 INFO L124 PetriNetUnfolderBase]: 1171/2206 cut-off events. [2024-06-27 22:33:42,304 INFO L125 PetriNetUnfolderBase]: For 32027/32027 co-relation queries the response was YES. [2024-06-27 22:33:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13190 conditions, 2206 events. 1171/2206 cut-off events. For 32027/32027 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13833 event pairs, 176 based on Foata normal form. 2/2130 useless extension candidates. Maximal degree in co-relation 13110. Up to 1299 conditions per place. [2024-06-27 22:33:42,321 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 211 selfloop transitions, 104 changer transitions 0/322 dead transitions. [2024-06-27 22:33:42,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 322 transitions, 5065 flow [2024-06-27 22:33:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-27 22:33:42,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-27 22:33:42,323 INFO L175 Difference]: Start difference. First operand has 171 places, 262 transitions, 3793 flow. Second operand 10 states and 186 transitions. [2024-06-27 22:33:42,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 322 transitions, 5065 flow [2024-06-27 22:33:42,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 322 transitions, 4910 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:42,402 INFO L231 Difference]: Finished difference. Result has 178 places, 272 transitions, 3959 flow [2024-06-27 22:33:42,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3638, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3959, PETRI_PLACES=178, PETRI_TRANSITIONS=272} [2024-06-27 22:33:42,402 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2024-06-27 22:33:42,403 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 272 transitions, 3959 flow [2024-06-27 22:33:42,403 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-06-27 22:33:42,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:42,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:42,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:33:42,403 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-06-27 22:33:42,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1749665820, now seen corresponding path program 2 times [2024-06-27 22:33:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:42,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115728434] [2024-06-27 22:33:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115728434] [2024-06-27 22:33:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115728434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379632974] [2024-06-27 22:33:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:43,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:43,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 272 transitions, 3959 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-06-27 22:33:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:43,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:43,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:44,485 INFO L124 PetriNetUnfolderBase]: 1183/2222 cut-off events. [2024-06-27 22:33:44,485 INFO L125 PetriNetUnfolderBase]: For 32060/32060 co-relation queries the response was YES. [2024-06-27 22:33:44,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13273 conditions, 2222 events. 1183/2222 cut-off events. For 32060/32060 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13927 event pairs, 187 based on Foata normal form. 2/2146 useless extension candidates. Maximal degree in co-relation 13191. Up to 1312 conditions per place. [2024-06-27 22:33:44,502 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 200 selfloop transitions, 117 changer transitions 0/324 dead transitions. [2024-06-27 22:33:44,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 324 transitions, 5129 flow [2024-06-27 22:33:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 22:33:44,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2024-06-27 22:33:44,504 INFO L175 Difference]: Start difference. First operand has 178 places, 272 transitions, 3959 flow. Second operand 9 states and 169 transitions. [2024-06-27 22:33:44,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 324 transitions, 5129 flow [2024-06-27 22:33:44,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 324 transitions, 4886 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:44,598 INFO L231 Difference]: Finished difference. Result has 182 places, 282 transitions, 4120 flow [2024-06-27 22:33:44,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3732, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4120, PETRI_PLACES=182, PETRI_TRANSITIONS=282} [2024-06-27 22:33:44,598 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 142 predicate places. [2024-06-27 22:33:44,598 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 282 transitions, 4120 flow [2024-06-27 22:33:44,599 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-06-27 22:33:44,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:44,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:44,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:33:44,599 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-06-27 22:33:44,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1740901314, now seen corresponding path program 5 times [2024-06-27 22:33:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003264470] [2024-06-27 22:33:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003264470] [2024-06-27 22:33:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003264470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587014316] [2024-06-27 22:33:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:45,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:46,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:46,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 282 transitions, 4120 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:46,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:46,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:46,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:46,685 INFO L124 PetriNetUnfolderBase]: 1236/2342 cut-off events. [2024-06-27 22:33:46,685 INFO L125 PetriNetUnfolderBase]: For 35567/35569 co-relation queries the response was YES. [2024-06-27 22:33:46,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13934 conditions, 2342 events. 1236/2342 cut-off events. For 35567/35569 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15151 event pairs, 201 based on Foata normal form. 3/2251 useless extension candidates. Maximal degree in co-relation 13850. Up to 1096 conditions per place. [2024-06-27 22:33:46,705 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 196 selfloop transitions, 141 changer transitions 0/348 dead transitions. [2024-06-27 22:33:46,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 348 transitions, 5509 flow [2024-06-27 22:33:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 22:33:46,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2024-06-27 22:33:46,706 INFO L175 Difference]: Start difference. First operand has 182 places, 282 transitions, 4120 flow. Second operand 9 states and 172 transitions. [2024-06-27 22:33:46,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 348 transitions, 5509 flow [2024-06-27 22:33:46,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 348 transitions, 5329 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:46,790 INFO L231 Difference]: Finished difference. Result has 187 places, 305 transitions, 4623 flow [2024-06-27 22:33:46,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3967, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4623, PETRI_PLACES=187, PETRI_TRANSITIONS=305} [2024-06-27 22:33:46,790 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-06-27 22:33:46,790 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 305 transitions, 4623 flow [2024-06-27 22:33:46,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:46,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:46,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:46,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:33:46,791 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-06-27 22:33:46,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1929407938, now seen corresponding path program 3 times [2024-06-27 22:33:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072252804] [2024-06-27 22:33:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072252804] [2024-06-27 22:33:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072252804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467080376] [2024-06-27 22:33:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:48,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:48,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:48,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 305 transitions, 4623 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-06-27 22:33:48,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:48,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:48,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:49,334 INFO L124 PetriNetUnfolderBase]: 1292/2441 cut-off events. [2024-06-27 22:33:49,334 INFO L125 PetriNetUnfolderBase]: For 38058/38058 co-relation queries the response was YES. [2024-06-27 22:33:49,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14944 conditions, 2441 events. 1292/2441 cut-off events. For 38058/38058 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15723 event pairs, 194 based on Foata normal form. 2/2354 useless extension candidates. Maximal degree in co-relation 14858. Up to 1467 conditions per place. [2024-06-27 22:33:49,355 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 230 selfloop transitions, 118 changer transitions 0/355 dead transitions. [2024-06-27 22:33:49,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 355 transitions, 5734 flow [2024-06-27 22:33:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:33:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:33:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-06-27 22:33:49,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:33:49,356 INFO L175 Difference]: Start difference. First operand has 187 places, 305 transitions, 4623 flow. Second operand 12 states and 213 transitions. [2024-06-27 22:33:49,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 355 transitions, 5734 flow [2024-06-27 22:33:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 355 transitions, 5611 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:49,452 INFO L231 Difference]: Finished difference. Result has 196 places, 305 transitions, 4750 flow [2024-06-27 22:33:49,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4505, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4750, PETRI_PLACES=196, PETRI_TRANSITIONS=305} [2024-06-27 22:33:49,453 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2024-06-27 22:33:49,453 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 305 transitions, 4750 flow [2024-06-27 22:33:49,453 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-06-27 22:33:49,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:49,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:49,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:33:49,453 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-06-27 22:33:49,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1749665634, now seen corresponding path program 6 times [2024-06-27 22:33:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530122508] [2024-06-27 22:33:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:50,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530122508] [2024-06-27 22:33:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530122508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81782260] [2024-06-27 22:33:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:50,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:50,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:33:50,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 305 transitions, 4750 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:50,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:50,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:33:50,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:51,389 INFO L124 PetriNetUnfolderBase]: 1283/2379 cut-off events. [2024-06-27 22:33:51,389 INFO L125 PetriNetUnfolderBase]: For 41176/41178 co-relation queries the response was YES. [2024-06-27 22:33:51,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15103 conditions, 2379 events. 1283/2379 cut-off events. For 41176/41178 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15216 event pairs, 235 based on Foata normal form. 3/2294 useless extension candidates. Maximal degree in co-relation 15015. Up to 1166 conditions per place. [2024-06-27 22:33:51,408 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 186 selfloop transitions, 159 changer transitions 0/356 dead transitions. [2024-06-27 22:33:51,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 356 transitions, 6002 flow [2024-06-27 22:33:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-27 22:33:51,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2024-06-27 22:33:51,409 INFO L175 Difference]: Start difference. First operand has 196 places, 305 transitions, 4750 flow. Second operand 8 states and 159 transitions. [2024-06-27 22:33:51,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 356 transitions, 6002 flow [2024-06-27 22:33:51,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 356 transitions, 5726 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-27 22:33:51,506 INFO L231 Difference]: Finished difference. Result has 194 places, 315 transitions, 4988 flow [2024-06-27 22:33:51,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4504, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4988, PETRI_PLACES=194, PETRI_TRANSITIONS=315} [2024-06-27 22:33:51,507 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2024-06-27 22:33:51,507 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 315 transitions, 4988 flow [2024-06-27 22:33:51,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:51,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:51,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:33:51,507 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-06-27 22:33:51,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1880936402, now seen corresponding path program 4 times [2024-06-27 22:33:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971204887] [2024-06-27 22:33:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971204887] [2024-06-27 22:33:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971204887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:52,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:33:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651981343] [2024-06-27 22:33:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:52,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:33:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:33:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:33:52,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:52,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 315 transitions, 4988 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-06-27 22:33:52,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:52,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:52,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:53,534 INFO L124 PetriNetUnfolderBase]: 1355/2556 cut-off events. [2024-06-27 22:33:53,534 INFO L125 PetriNetUnfolderBase]: For 42942/42942 co-relation queries the response was YES. [2024-06-27 22:33:53,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16092 conditions, 2556 events. 1355/2556 cut-off events. For 42942/42942 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16550 event pairs, 398 based on Foata normal form. 2/2465 useless extension candidates. Maximal degree in co-relation 16003. Up to 1515 conditions per place. [2024-06-27 22:33:53,559 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 235 selfloop transitions, 121 changer transitions 0/363 dead transitions. [2024-06-27 22:33:53,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 363 transitions, 6104 flow [2024-06-27 22:33:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 22:33:53,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:33:53,560 INFO L175 Difference]: Start difference. First operand has 194 places, 315 transitions, 4988 flow. Second operand 8 states and 150 transitions. [2024-06-27 22:33:53,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 363 transitions, 6104 flow [2024-06-27 22:33:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 363 transitions, 5848 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:53,681 INFO L231 Difference]: Finished difference. Result has 198 places, 315 transitions, 4988 flow [2024-06-27 22:33:53,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4732, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4988, PETRI_PLACES=198, PETRI_TRANSITIONS=315} [2024-06-27 22:33:53,682 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-06-27 22:33:53,682 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 315 transitions, 4988 flow [2024-06-27 22:33:53,682 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-06-27 22:33:53,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:53,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:33:53,683 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-06-27 22:33:53,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1880763422, now seen corresponding path program 5 times [2024-06-27 22:33:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:53,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364520939] [2024-06-27 22:33:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:54,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364520939] [2024-06-27 22:33:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364520939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:54,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:54,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117806003] [2024-06-27 22:33:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:54,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:54,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:54,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 315 transitions, 4988 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-06-27 22:33:54,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:54,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:54,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:55,817 INFO L124 PetriNetUnfolderBase]: 1393/2618 cut-off events. [2024-06-27 22:33:55,817 INFO L125 PetriNetUnfolderBase]: For 44529/44529 co-relation queries the response was YES. [2024-06-27 22:33:55,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 2618 events. 1393/2618 cut-off events. For 44529/44529 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16969 event pairs, 411 based on Foata normal form. 2/2529 useless extension candidates. Maximal degree in co-relation 16268. Up to 1545 conditions per place. [2024-06-27 22:33:55,837 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 256 selfloop transitions, 118 changer transitions 0/381 dead transitions. [2024-06-27 22:33:55,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 381 transitions, 6417 flow [2024-06-27 22:33:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:33:55,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:33:55,839 INFO L175 Difference]: Start difference. First operand has 198 places, 315 transitions, 4988 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:33:55,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 381 transitions, 6417 flow [2024-06-27 22:33:55,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 381 transitions, 6056 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:55,961 INFO L231 Difference]: Finished difference. Result has 200 places, 323 transitions, 5006 flow [2024-06-27 22:33:55,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4651, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5006, PETRI_PLACES=200, PETRI_TRANSITIONS=323} [2024-06-27 22:33:55,962 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2024-06-27 22:33:55,962 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 323 transitions, 5006 flow [2024-06-27 22:33:55,962 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-06-27 22:33:55,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:55,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:55,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:33:55,963 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-06-27 22:33:55,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1880756912, now seen corresponding path program 6 times [2024-06-27 22:33:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414770691] [2024-06-27 22:33:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414770691] [2024-06-27 22:33:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414770691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:57,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:57,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815902629] [2024-06-27 22:33:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:57,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:57,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:57,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 323 transitions, 5006 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-06-27 22:33:57,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:57,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:57,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:58,464 INFO L124 PetriNetUnfolderBase]: 1387/2608 cut-off events. [2024-06-27 22:33:58,465 INFO L125 PetriNetUnfolderBase]: For 41941/41941 co-relation queries the response was YES. [2024-06-27 22:33:58,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16126 conditions, 2608 events. 1387/2608 cut-off events. For 41941/41941 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16881 event pairs, 411 based on Foata normal form. 2/2519 useless extension candidates. Maximal degree in co-relation 16035. Up to 1538 conditions per place. [2024-06-27 22:33:58,488 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 257 selfloop transitions, 122 changer transitions 0/386 dead transitions. [2024-06-27 22:33:58,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 386 transitions, 6249 flow [2024-06-27 22:33:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:33:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:33:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-06-27 22:33:58,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:33:58,489 INFO L175 Difference]: Start difference. First operand has 200 places, 323 transitions, 5006 flow. Second operand 12 states and 207 transitions. [2024-06-27 22:33:58,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 386 transitions, 6249 flow [2024-06-27 22:33:58,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 386 transitions, 6020 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:58,588 INFO L231 Difference]: Finished difference. Result has 207 places, 323 transitions, 5036 flow [2024-06-27 22:33:58,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4777, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5036, PETRI_PLACES=207, PETRI_TRANSITIONS=323} [2024-06-27 22:33:58,588 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 167 predicate places. [2024-06-27 22:33:58,589 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 323 transitions, 5036 flow [2024-06-27 22:33:58,589 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-06-27 22:33:58,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:58,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:58,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:33:58,589 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-06-27 22:33:58,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 294321724, now seen corresponding path program 7 times [2024-06-27 22:33:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908027898] [2024-06-27 22:33:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:59,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908027898] [2024-06-27 22:33:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908027898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914625557] [2024-06-27 22:33:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:59,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:59,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:59,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:59,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:59,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:33:59,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 323 transitions, 5036 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-06-27 22:33:59,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:59,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:33:59,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:00,626 INFO L124 PetriNetUnfolderBase]: 1467/2751 cut-off events. [2024-06-27 22:34:00,626 INFO L125 PetriNetUnfolderBase]: For 45955/45955 co-relation queries the response was YES. [2024-06-27 22:34:00,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17088 conditions, 2751 events. 1467/2751 cut-off events. For 45955/45955 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18020 event pairs, 452 based on Foata normal form. 2/2656 useless extension candidates. Maximal degree in co-relation 16996. Up to 2118 conditions per place. [2024-06-27 22:34:00,651 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 323 selfloop transitions, 51 changer transitions 0/381 dead transitions. [2024-06-27 22:34:00,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 381 transitions, 6373 flow [2024-06-27 22:34:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:34:00,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:34:00,652 INFO L175 Difference]: Start difference. First operand has 207 places, 323 transitions, 5036 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:34:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 381 transitions, 6373 flow [2024-06-27 22:34:00,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 381 transitions, 6076 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-27 22:34:00,772 INFO L231 Difference]: Finished difference. Result has 206 places, 339 transitions, 5115 flow [2024-06-27 22:34:00,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4771, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5115, PETRI_PLACES=206, PETRI_TRANSITIONS=339} [2024-06-27 22:34:00,773 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2024-06-27 22:34:00,773 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 339 transitions, 5115 flow [2024-06-27 22:34:00,773 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-06-27 22:34:00,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:00,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:00,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:34:00,773 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-06-27 22:34:00,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1741876848, now seen corresponding path program 8 times [2024-06-27 22:34:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:00,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472351185] [2024-06-27 22:34:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:02,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:02,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472351185] [2024-06-27 22:34:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472351185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522732047] [2024-06-27 22:34:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:02,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:02,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:02,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:02,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:02,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 339 transitions, 5115 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-06-27 22:34:02,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:02,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:02,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:03,369 INFO L124 PetriNetUnfolderBase]: 1505/2823 cut-off events. [2024-06-27 22:34:03,369 INFO L125 PetriNetUnfolderBase]: For 46568/46568 co-relation queries the response was YES. [2024-06-27 22:34:03,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17222 conditions, 2823 events. 1505/2823 cut-off events. For 46568/46568 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18590 event pairs, 446 based on Foata normal form. 2/2725 useless extension candidates. Maximal degree in co-relation 17129. Up to 2136 conditions per place. [2024-06-27 22:34:03,403 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 333 selfloop transitions, 65 changer transitions 0/405 dead transitions. [2024-06-27 22:34:03,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 405 transitions, 6498 flow [2024-06-27 22:34:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:34:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:34:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-27 22:34:03,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2024-06-27 22:34:03,405 INFO L175 Difference]: Start difference. First operand has 206 places, 339 transitions, 5115 flow. Second operand 11 states and 190 transitions. [2024-06-27 22:34:03,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 405 transitions, 6498 flow [2024-06-27 22:34:03,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 405 transitions, 6435 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:03,523 INFO L231 Difference]: Finished difference. Result has 212 places, 347 transitions, 5316 flow [2024-06-27 22:34:03,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5052, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5316, PETRI_PLACES=212, PETRI_TRANSITIONS=347} [2024-06-27 22:34:03,523 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-06-27 22:34:03,523 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 347 transitions, 5316 flow [2024-06-27 22:34:03,524 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-06-27 22:34:03,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:03,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:03,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:34:03,524 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-06-27 22:34:03,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1741883544, now seen corresponding path program 7 times [2024-06-27 22:34:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:03,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582841120] [2024-06-27 22:34:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582841120] [2024-06-27 22:34:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582841120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:04,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:04,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:04,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313045341] [2024-06-27 22:34:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:04,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:04,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:04,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:04,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:04,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 347 transitions, 5316 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-06-27 22:34:04,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:04,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:04,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:05,744 INFO L124 PetriNetUnfolderBase]: 1516/2849 cut-off events. [2024-06-27 22:34:05,744 INFO L125 PetriNetUnfolderBase]: For 47356/47356 co-relation queries the response was YES. [2024-06-27 22:34:05,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17554 conditions, 2849 events. 1516/2849 cut-off events. For 47356/47356 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18836 event pairs, 460 based on Foata normal form. 1/2748 useless extension candidates. Maximal degree in co-relation 17459. Up to 2320 conditions per place. [2024-06-27 22:34:05,767 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 335 selfloop transitions, 48 changer transitions 0/390 dead transitions. [2024-06-27 22:34:05,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 390 transitions, 6462 flow [2024-06-27 22:34:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:34:05,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:34:05,773 INFO L175 Difference]: Start difference. First operand has 212 places, 347 transitions, 5316 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:34:05,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 390 transitions, 6462 flow [2024-06-27 22:34:05,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 390 transitions, 6054 flow, removed 37 selfloop flow, removed 11 redundant places. [2024-06-27 22:34:05,896 INFO L231 Difference]: Finished difference. Result has 213 places, 366 transitions, 5327 flow [2024-06-27 22:34:05,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4923, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5327, PETRI_PLACES=213, PETRI_TRANSITIONS=366} [2024-06-27 22:34:05,897 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 173 predicate places. [2024-06-27 22:34:05,897 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 366 transitions, 5327 flow [2024-06-27 22:34:05,897 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-06-27 22:34:05,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:05,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:34:05,898 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-06-27 22:34:05,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1477102128, now seen corresponding path program 9 times [2024-06-27 22:34:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186383479] [2024-06-27 22:34:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:05,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:07,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-06-27 22:34:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186383479] [2024-06-27 22:34:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186383479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390372170] [2024-06-27 22:34:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:07,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:07,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:07,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 366 transitions, 5327 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-06-27 22:34:07,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:07,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:07,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:07,910 INFO L124 PetriNetUnfolderBase]: 1555/2914 cut-off events. [2024-06-27 22:34:07,911 INFO L125 PetriNetUnfolderBase]: For 47199/47199 co-relation queries the response was YES. [2024-06-27 22:34:07,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17760 conditions, 2914 events. 1555/2914 cut-off events. For 47199/47199 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19311 event pairs, 479 based on Foata normal form. 3/2813 useless extension candidates. Maximal degree in co-relation 17662. Up to 2341 conditions per place. [2024-06-27 22:34:07,938 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 365 selfloop transitions, 37 changer transitions 0/409 dead transitions. [2024-06-27 22:34:07,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 409 transitions, 6438 flow [2024-06-27 22:34:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:34:07,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:34:07,940 INFO L175 Difference]: Start difference. First operand has 213 places, 366 transitions, 5327 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:34:07,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 409 transitions, 6438 flow [2024-06-27 22:34:08,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 409 transitions, 6378 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 22:34:08,073 INFO L231 Difference]: Finished difference. Result has 219 places, 376 transitions, 5498 flow [2024-06-27 22:34:08,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5267, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5498, PETRI_PLACES=219, PETRI_TRANSITIONS=376} [2024-06-27 22:34:08,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 179 predicate places. [2024-06-27 22:34:08,074 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 376 transitions, 5498 flow [2024-06-27 22:34:08,074 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-06-27 22:34:08,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:08,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:08,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:34:08,074 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-06-27 22:34:08,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1486270068, now seen corresponding path program 10 times [2024-06-27 22:34:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775555737] [2024-06-27 22:34:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:09,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775555737] [2024-06-27 22:34:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775555737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:09,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321942816] [2024-06-27 22:34:09,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:09,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:09,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:09,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:09,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:09,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 376 transitions, 5498 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-06-27 22:34:09,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:10,296 INFO L124 PetriNetUnfolderBase]: 1551/2900 cut-off events. [2024-06-27 22:34:10,297 INFO L125 PetriNetUnfolderBase]: For 45096/45096 co-relation queries the response was YES. [2024-06-27 22:34:10,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17795 conditions, 2900 events. 1551/2900 cut-off events. For 45096/45096 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19168 event pairs, 461 based on Foata normal form. 2/2800 useless extension candidates. Maximal degree in co-relation 17695. Up to 2222 conditions per place. [2024-06-27 22:34:10,325 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 350 selfloop transitions, 58 changer transitions 0/415 dead transitions. [2024-06-27 22:34:10,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 415 transitions, 6568 flow [2024-06-27 22:34:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:34:10,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:34:10,326 INFO L175 Difference]: Start difference. First operand has 219 places, 376 transitions, 5498 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:34:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 415 transitions, 6568 flow [2024-06-27 22:34:10,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 415 transitions, 6473 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:10,463 INFO L231 Difference]: Finished difference. Result has 221 places, 376 transitions, 5531 flow [2024-06-27 22:34:10,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5403, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5531, PETRI_PLACES=221, PETRI_TRANSITIONS=376} [2024-06-27 22:34:10,464 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 181 predicate places. [2024-06-27 22:34:10,464 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 376 transitions, 5531 flow [2024-06-27 22:34:10,464 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-06-27 22:34:10,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:10,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:34:10,465 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-06-27 22:34:10,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1614273700, now seen corresponding path program 11 times [2024-06-27 22:34:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869909590] [2024-06-27 22:34:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869909590] [2024-06-27 22:34:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869909590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:11,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:11,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:11,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105809134] [2024-06-27 22:34:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:11,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:11,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:11,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:11,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:11,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 376 transitions, 5531 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-06-27 22:34:11,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:11,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:11,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:12,692 INFO L124 PetriNetUnfolderBase]: 1547/2903 cut-off events. [2024-06-27 22:34:12,693 INFO L125 PetriNetUnfolderBase]: For 44483/44483 co-relation queries the response was YES. [2024-06-27 22:34:12,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17735 conditions, 2903 events. 1547/2903 cut-off events. For 44483/44483 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19248 event pairs, 448 based on Foata normal form. 2/2802 useless extension candidates. Maximal degree in co-relation 17634. Up to 2204 conditions per place. [2024-06-27 22:34:12,721 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 344 selfloop transitions, 67 changer transitions 0/418 dead transitions. [2024-06-27 22:34:12,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 418 transitions, 6639 flow [2024-06-27 22:34:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 22:34:12,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 22:34:12,723 INFO L175 Difference]: Start difference. First operand has 221 places, 376 transitions, 5531 flow. Second operand 10 states and 168 transitions. [2024-06-27 22:34:12,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 418 transitions, 6639 flow [2024-06-27 22:34:12,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 418 transitions, 6527 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:12,855 INFO L231 Difference]: Finished difference. Result has 226 places, 376 transitions, 5567 flow [2024-06-27 22:34:12,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5419, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5567, PETRI_PLACES=226, PETRI_TRANSITIONS=376} [2024-06-27 22:34:12,856 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 186 predicate places. [2024-06-27 22:34:12,856 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 376 transitions, 5567 flow [2024-06-27 22:34:12,856 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-06-27 22:34:12,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:12,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:12,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:34:12,857 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-06-27 22:34:12,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash 349623616, now seen corresponding path program 8 times [2024-06-27 22:34:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096910977] [2024-06-27 22:34:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096910977] [2024-06-27 22:34:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096910977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249574004] [2024-06-27 22:34:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:14,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:14,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:14,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 376 transitions, 5567 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-06-27 22:34:14,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:14,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:14,902 INFO L124 PetriNetUnfolderBase]: 1554/2919 cut-off events. [2024-06-27 22:34:14,902 INFO L125 PetriNetUnfolderBase]: For 43382/43382 co-relation queries the response was YES. [2024-06-27 22:34:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17835 conditions, 2919 events. 1554/2919 cut-off events. For 43382/43382 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19385 event pairs, 471 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 17733. Up to 2395 conditions per place. [2024-06-27 22:34:14,929 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 368 selfloop transitions, 37 changer transitions 0/412 dead transitions. [2024-06-27 22:34:14,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 412 transitions, 6627 flow [2024-06-27 22:34:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 22:34:14,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-06-27 22:34:14,930 INFO L175 Difference]: Start difference. First operand has 226 places, 376 transitions, 5567 flow. Second operand 9 states and 151 transitions. [2024-06-27 22:34:14,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 412 transitions, 6627 flow [2024-06-27 22:34:15,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 412 transitions, 6471 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 22:34:15,074 INFO L231 Difference]: Finished difference. Result has 228 places, 385 transitions, 5677 flow [2024-06-27 22:34:15,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5421, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5677, PETRI_PLACES=228, PETRI_TRANSITIONS=385} [2024-06-27 22:34:15,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2024-06-27 22:34:15,074 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 385 transitions, 5677 flow [2024-06-27 22:34:15,074 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-06-27 22:34:15,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:15,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:15,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:34:15,075 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:15,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1900519642, now seen corresponding path program 1 times [2024-06-27 22:34:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505199082] [2024-06-27 22:34:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505199082] [2024-06-27 22:34:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505199082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:34:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647368700] [2024-06-27 22:34:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:34:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:34:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:34:15,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:34:15,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 385 transitions, 5677 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:15,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:15,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:34:15,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:15,469 INFO L124 PetriNetUnfolderBase]: 812/1516 cut-off events. [2024-06-27 22:34:15,470 INFO L125 PetriNetUnfolderBase]: For 20343/20419 co-relation queries the response was YES. [2024-06-27 22:34:15,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9757 conditions, 1516 events. 812/1516 cut-off events. For 20343/20419 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8706 event pairs, 163 based on Foata normal form. 150/1522 useless extension candidates. Maximal degree in co-relation 9653. Up to 674 conditions per place. [2024-06-27 22:34:15,480 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 135 selfloop transitions, 61 changer transitions 0/269 dead transitions. [2024-06-27 22:34:15,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 269 transitions, 4403 flow [2024-06-27 22:34:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:34:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:34:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-27 22:34:15,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 22:34:15,481 INFO L175 Difference]: Start difference. First operand has 228 places, 385 transitions, 5677 flow. Second operand 4 states and 99 transitions. [2024-06-27 22:34:15,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 269 transitions, 4403 flow [2024-06-27 22:34:15,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 269 transitions, 3548 flow, removed 62 selfloop flow, removed 42 redundant places. [2024-06-27 22:34:15,548 INFO L231 Difference]: Finished difference. Result has 191 places, 256 transitions, 3328 flow [2024-06-27 22:34:15,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3328, PETRI_PLACES=191, PETRI_TRANSITIONS=256} [2024-06-27 22:34:15,549 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 151 predicate places. [2024-06-27 22:34:15,549 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 256 transitions, 3328 flow [2024-06-27 22:34:15,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:15,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:15,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:15,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:34:15,550 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-06-27 22:34:15,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2081426927, now seen corresponding path program 1 times [2024-06-27 22:34:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:15,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370661396] [2024-06-27 22:34:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370661396] [2024-06-27 22:34:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370661396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:17,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434672570] [2024-06-27 22:34:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:17,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:17,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:17,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 256 transitions, 3328 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:17,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:17,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:17,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:17,598 INFO L124 PetriNetUnfolderBase]: 767/1434 cut-off events. [2024-06-27 22:34:17,598 INFO L125 PetriNetUnfolderBase]: For 31320/31331 co-relation queries the response was YES. [2024-06-27 22:34:17,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8938 conditions, 1434 events. 767/1434 cut-off events. For 31320/31331 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7898 event pairs, 83 based on Foata normal form. 4/1329 useless extension candidates. Maximal degree in co-relation 8848. Up to 810 conditions per place. [2024-06-27 22:34:17,609 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 190 selfloop transitions, 81 changer transitions 0/283 dead transitions. [2024-06-27 22:34:17,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 283 transitions, 4068 flow [2024-06-27 22:34:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:34:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:34:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:34:17,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:34:17,610 INFO L175 Difference]: Start difference. First operand has 191 places, 256 transitions, 3328 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:34:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 283 transitions, 4068 flow [2024-06-27 22:34:17,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 283 transitions, 4058 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:34:17,696 INFO L231 Difference]: Finished difference. Result has 196 places, 257 transitions, 3490 flow [2024-06-27 22:34:17,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3318, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3490, PETRI_PLACES=196, PETRI_TRANSITIONS=257} [2024-06-27 22:34:17,696 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2024-06-27 22:34:17,696 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 257 transitions, 3490 flow [2024-06-27 22:34:17,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:17,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:17,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:17,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:34:17,697 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-06-27 22:34:17,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1484176759, now seen corresponding path program 2 times [2024-06-27 22:34:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070876823] [2024-06-27 22:34:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070876823] [2024-06-27 22:34:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070876823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:19,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264346861] [2024-06-27 22:34:19,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:19,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:19,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 257 transitions, 3490 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:19,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:19,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:19,787 INFO L124 PetriNetUnfolderBase]: 802/1541 cut-off events. [2024-06-27 22:34:19,787 INFO L125 PetriNetUnfolderBase]: For 35714/35725 co-relation queries the response was YES. [2024-06-27 22:34:19,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9600 conditions, 1541 events. 802/1541 cut-off events. For 35714/35725 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8793 event pairs, 159 based on Foata normal form. 4/1422 useless extension candidates. Maximal degree in co-relation 9508. Up to 1048 conditions per place. [2024-06-27 22:34:19,800 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 188 selfloop transitions, 81 changer transitions 0/281 dead transitions. [2024-06-27 22:34:19,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 281 transitions, 4220 flow [2024-06-27 22:34:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:34:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:34:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:34:19,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:34:19,801 INFO L175 Difference]: Start difference. First operand has 196 places, 257 transitions, 3490 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:34:19,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 281 transitions, 4220 flow [2024-06-27 22:34:19,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 281 transitions, 4063 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:19,915 INFO L231 Difference]: Finished difference. Result has 199 places, 259 transitions, 3517 flow [2024-06-27 22:34:19,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3339, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3517, PETRI_PLACES=199, PETRI_TRANSITIONS=259} [2024-06-27 22:34:19,916 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2024-06-27 22:34:19,916 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 259 transitions, 3517 flow [2024-06-27 22:34:19,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:19,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:19,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:34:19,917 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-06-27 22:34:19,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1484180634, now seen corresponding path program 1 times [2024-06-27 22:34:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:19,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101621537] [2024-06-27 22:34:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101621537] [2024-06-27 22:34:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101621537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841782772] [2024-06-27 22:34:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:21,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:21,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:21,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 259 transitions, 3517 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:21,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:21,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:21,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:22,130 INFO L124 PetriNetUnfolderBase]: 816/1569 cut-off events. [2024-06-27 22:34:22,130 INFO L125 PetriNetUnfolderBase]: For 37000/37011 co-relation queries the response was YES. [2024-06-27 22:34:22,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9788 conditions, 1569 events. 816/1569 cut-off events. For 37000/37011 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8991 event pairs, 176 based on Foata normal form. 4/1441 useless extension candidates. Maximal degree in co-relation 9695. Up to 778 conditions per place. [2024-06-27 22:34:22,143 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 131 selfloop transitions, 135 changer transitions 0/278 dead transitions. [2024-06-27 22:34:22,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 278 transitions, 4243 flow [2024-06-27 22:34:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:34:22,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:34:22,144 INFO L175 Difference]: Start difference. First operand has 199 places, 259 transitions, 3517 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:34:22,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 278 transitions, 4243 flow [2024-06-27 22:34:22,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 278 transitions, 4129 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 22:34:22,253 INFO L231 Difference]: Finished difference. Result has 204 places, 261 transitions, 3712 flow [2024-06-27 22:34:22,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3403, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3712, PETRI_PLACES=204, PETRI_TRANSITIONS=261} [2024-06-27 22:34:22,254 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 164 predicate places. [2024-06-27 22:34:22,254 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 261 transitions, 3712 flow [2024-06-27 22:34:22,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:22,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:22,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:34:22,254 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-06-27 22:34:22,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1484180479, now seen corresponding path program 3 times [2024-06-27 22:34:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964475646] [2024-06-27 22:34:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:23,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-06-27 22:34:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964475646] [2024-06-27 22:34:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964475646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:23,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375871288] [2024-06-27 22:34:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:23,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:23,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:23,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 261 transitions, 3712 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:23,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:23,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:23,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:24,314 INFO L124 PetriNetUnfolderBase]: 813/1564 cut-off events. [2024-06-27 22:34:24,315 INFO L125 PetriNetUnfolderBase]: For 36045/36056 co-relation queries the response was YES. [2024-06-27 22:34:24,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10062 conditions, 1564 events. 813/1564 cut-off events. For 36045/36056 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8941 event pairs, 173 based on Foata normal form. 4/1436 useless extension candidates. Maximal degree in co-relation 9966. Up to 1115 conditions per place. [2024-06-27 22:34:24,326 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 185 selfloop transitions, 81 changer transitions 0/278 dead transitions. [2024-06-27 22:34:24,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 278 transitions, 4298 flow [2024-06-27 22:34:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:34:24,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:34:24,327 INFO L175 Difference]: Start difference. First operand has 204 places, 261 transitions, 3712 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:34:24,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 278 transitions, 4298 flow [2024-06-27 22:34:24,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 278 transitions, 4024 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:24,482 INFO L231 Difference]: Finished difference. Result has 206 places, 261 transitions, 3604 flow [2024-06-27 22:34:24,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3438, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3604, PETRI_PLACES=206, PETRI_TRANSITIONS=261} [2024-06-27 22:34:24,483 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2024-06-27 22:34:24,483 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 261 transitions, 3604 flow [2024-06-27 22:34:24,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:24,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:24,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:24,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:34:24,484 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-06-27 22:34:24,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1125948156, now seen corresponding path program 2 times [2024-06-27 22:34:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694771324] [2024-06-27 22:34:24,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:26,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694771324] [2024-06-27 22:34:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694771324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502377289] [2024-06-27 22:34:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:26,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:26,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 261 transitions, 3604 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:26,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:26,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:26,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:26,654 INFO L124 PetriNetUnfolderBase]: 827/1588 cut-off events. [2024-06-27 22:34:26,655 INFO L125 PetriNetUnfolderBase]: For 36006/36026 co-relation queries the response was YES. [2024-06-27 22:34:26,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10121 conditions, 1588 events. 827/1588 cut-off events. For 36006/36026 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9105 event pairs, 160 based on Foata normal form. 10/1462 useless extension candidates. Maximal degree in co-relation 10025. Up to 1028 conditions per place. [2024-06-27 22:34:26,669 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 125 selfloop transitions, 139 changer transitions 0/276 dead transitions. [2024-06-27 22:34:26,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 276 transitions, 4206 flow [2024-06-27 22:34:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:34:26,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:34:26,670 INFO L175 Difference]: Start difference. First operand has 206 places, 261 transitions, 3604 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:34:26,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 276 transitions, 4206 flow [2024-06-27 22:34:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 276 transitions, 4042 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:26,779 INFO L231 Difference]: Finished difference. Result has 207 places, 263 transitions, 3762 flow [2024-06-27 22:34:26,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3440, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3762, PETRI_PLACES=207, PETRI_TRANSITIONS=263} [2024-06-27 22:34:26,779 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 167 predicate places. [2024-06-27 22:34:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 263 transitions, 3762 flow [2024-06-27 22:34:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:26,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:26,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:26,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:34:26,780 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-06-27 22:34:26,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1571016594, now seen corresponding path program 3 times [2024-06-27 22:34:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253128571] [2024-06-27 22:34:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:28,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-06-27 22:34:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253128571] [2024-06-27 22:34:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253128571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:28,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523174925] [2024-06-27 22:34:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:28,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:28,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:28,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 263 transitions, 3762 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:28,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:28,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:28,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:28,877 INFO L124 PetriNetUnfolderBase]: 841/1608 cut-off events. [2024-06-27 22:34:28,877 INFO L125 PetriNetUnfolderBase]: For 38292/38321 co-relation queries the response was YES. [2024-06-27 22:34:28,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10500 conditions, 1608 events. 841/1608 cut-off events. For 38292/38321 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9230 event pairs, 161 based on Foata normal form. 18/1487 useless extension candidates. Maximal degree in co-relation 10403. Up to 1023 conditions per place. [2024-06-27 22:34:28,889 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 124 selfloop transitions, 143 changer transitions 0/279 dead transitions. [2024-06-27 22:34:28,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 279 transitions, 4380 flow [2024-06-27 22:34:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:34:28,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:34:28,890 INFO L175 Difference]: Start difference. First operand has 207 places, 263 transitions, 3762 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:34:28,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 279 transitions, 4380 flow [2024-06-27 22:34:29,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 279 transitions, 4088 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:29,011 INFO L231 Difference]: Finished difference. Result has 209 places, 265 transitions, 3801 flow [2024-06-27 22:34:29,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3801, PETRI_PLACES=209, PETRI_TRANSITIONS=265} [2024-06-27 22:34:29,012 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 169 predicate places. [2024-06-27 22:34:29,012 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 265 transitions, 3801 flow [2024-06-27 22:34:29,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:29,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:29,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:29,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:34:29,013 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-06-27 22:34:29,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1571016439, now seen corresponding path program 4 times [2024-06-27 22:34:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765605301] [2024-06-27 22:34:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:30,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765605301] [2024-06-27 22:34:30,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765605301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:30,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010008326] [2024-06-27 22:34:30,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:30,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:30,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:30,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 265 transitions, 3801 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:30,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:30,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:31,250 INFO L124 PetriNetUnfolderBase]: 920/1822 cut-off events. [2024-06-27 22:34:31,250 INFO L125 PetriNetUnfolderBase]: For 55482/55514 co-relation queries the response was YES. [2024-06-27 22:34:31,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11175 conditions, 1822 events. 920/1822 cut-off events. For 55482/55514 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10964 event pairs, 208 based on Foata normal form. 28/1694 useless extension candidates. Maximal degree in co-relation 11077. Up to 1034 conditions per place. [2024-06-27 22:34:31,265 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 137 selfloop transitions, 138 changer transitions 0/287 dead transitions. [2024-06-27 22:34:31,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 287 transitions, 4454 flow [2024-06-27 22:34:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 22:34:31,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-06-27 22:34:31,266 INFO L175 Difference]: Start difference. First operand has 209 places, 265 transitions, 3801 flow. Second operand 9 states and 158 transitions. [2024-06-27 22:34:31,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 287 transitions, 4454 flow [2024-06-27 22:34:31,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 287 transitions, 4147 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:31,388 INFO L231 Difference]: Finished difference. Result has 211 places, 266 transitions, 3785 flow [2024-06-27 22:34:31,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3785, PETRI_PLACES=211, PETRI_TRANSITIONS=266} [2024-06-27 22:34:31,389 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2024-06-27 22:34:31,389 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 266 transitions, 3785 flow [2024-06-27 22:34:31,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:31,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:31,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:31,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:34:31,390 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-06-27 22:34:31,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1570868569, now seen corresponding path program 5 times [2024-06-27 22:34:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586271284] [2024-06-27 22:34:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:32,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-06-27 22:34:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586271284] [2024-06-27 22:34:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586271284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550063103] [2024-06-27 22:34:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:32,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:33,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:33,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 266 transitions, 3785 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:33,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:33,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:33,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:33,532 INFO L124 PetriNetUnfolderBase]: 954/1883 cut-off events. [2024-06-27 22:34:33,532 INFO L125 PetriNetUnfolderBase]: For 44184/44207 co-relation queries the response was YES. [2024-06-27 22:34:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11469 conditions, 1883 events. 954/1883 cut-off events. For 44184/44207 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11499 event pairs, 235 based on Foata normal form. 10/1730 useless extension candidates. Maximal degree in co-relation 11370. Up to 1373 conditions per place. [2024-06-27 22:34:33,548 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 192 selfloop transitions, 83 changer transitions 0/287 dead transitions. [2024-06-27 22:34:33,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 287 transitions, 4529 flow [2024-06-27 22:34:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:34:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:34:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:34:33,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-27 22:34:33,549 INFO L175 Difference]: Start difference. First operand has 211 places, 266 transitions, 3785 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:34:33,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 287 transitions, 4529 flow [2024-06-27 22:34:33,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 287 transitions, 4255 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:33,766 INFO L231 Difference]: Finished difference. Result has 212 places, 268 transitions, 3701 flow [2024-06-27 22:34:33,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3511, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3701, PETRI_PLACES=212, PETRI_TRANSITIONS=268} [2024-06-27 22:34:33,769 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-06-27 22:34:33,769 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 268 transitions, 3701 flow [2024-06-27 22:34:33,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:33,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:33,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:33,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:34:33,770 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-06-27 22:34:33,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1570872289, now seen corresponding path program 6 times [2024-06-27 22:34:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447699321] [2024-06-27 22:34:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447699321] [2024-06-27 22:34:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447699321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896460945] [2024-06-27 22:34:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:35,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:35,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:35,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 268 transitions, 3701 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:35,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:35,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:35,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:36,065 INFO L124 PetriNetUnfolderBase]: 951/1882 cut-off events. [2024-06-27 22:34:36,065 INFO L125 PetriNetUnfolderBase]: For 41809/41832 co-relation queries the response was YES. [2024-06-27 22:34:36,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 1882 events. 951/1882 cut-off events. For 41809/41832 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11585 event pairs, 224 based on Foata normal form. 10/1729 useless extension candidates. Maximal degree in co-relation 11133. Up to 1226 conditions per place. [2024-06-27 22:34:36,081 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 136 selfloop transitions, 137 changer transitions 0/285 dead transitions. [2024-06-27 22:34:36,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 285 transitions, 4307 flow [2024-06-27 22:34:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:34:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:34:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 22:34:36,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:34:36,085 INFO L175 Difference]: Start difference. First operand has 212 places, 268 transitions, 3701 flow. Second operand 8 states and 145 transitions. [2024-06-27 22:34:36,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 285 transitions, 4307 flow [2024-06-27 22:34:36,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 285 transitions, 4194 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 22:34:36,228 INFO L231 Difference]: Finished difference. Result has 216 places, 268 transitions, 3866 flow [2024-06-27 22:34:36,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3588, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3866, PETRI_PLACES=216, PETRI_TRANSITIONS=268} [2024-06-27 22:34:36,229 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2024-06-27 22:34:36,229 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 268 transitions, 3866 flow [2024-06-27 22:34:36,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:36,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:36,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:36,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:34:36,230 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-06-27 22:34:36,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1570872444, now seen corresponding path program 4 times [2024-06-27 22:34:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313877872] [2024-06-27 22:34:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:36,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313877872] [2024-06-27 22:34:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313877872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645370386] [2024-06-27 22:34:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:37,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:37,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 268 transitions, 3866 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:38,515 INFO L124 PetriNetUnfolderBase]: 965/1902 cut-off events. [2024-06-27 22:34:38,516 INFO L125 PetriNetUnfolderBase]: For 44094/44126 co-relation queries the response was YES. [2024-06-27 22:34:38,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11750 conditions, 1902 events. 965/1902 cut-off events. For 44094/44126 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11669 event pairs, 225 based on Foata normal form. 18/1754 useless extension candidates. Maximal degree in co-relation 11649. Up to 1241 conditions per place. [2024-06-27 22:34:38,532 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 128 selfloop transitions, 144 changer transitions 0/284 dead transitions. [2024-06-27 22:34:38,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 284 transitions, 4498 flow [2024-06-27 22:34:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:34:38,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-27 22:34:38,534 INFO L175 Difference]: Start difference. First operand has 216 places, 268 transitions, 3866 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:34:38,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 284 transitions, 4498 flow [2024-06-27 22:34:38,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 284 transitions, 4224 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 22:34:38,675 INFO L231 Difference]: Finished difference. Result has 219 places, 270 transitions, 3929 flow [2024-06-27 22:34:38,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3929, PETRI_PLACES=219, PETRI_TRANSITIONS=270} [2024-06-27 22:34:38,676 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 179 predicate places. [2024-06-27 22:34:38,676 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 270 transitions, 3929 flow [2024-06-27 22:34:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:38,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:38,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:34:38,676 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-06-27 22:34:38,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash 587451505, now seen corresponding path program 7 times [2024-06-27 22:34:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138653954] [2024-06-27 22:34:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138653954] [2024-06-27 22:34:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138653954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913505326] [2024-06-27 22:34:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:40,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:40,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:40,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 270 transitions, 3929 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:40,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:40,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:40,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:40,681 INFO L124 PetriNetUnfolderBase]: 964/1930 cut-off events. [2024-06-27 22:34:40,682 INFO L125 PetriNetUnfolderBase]: For 45550/45565 co-relation queries the response was YES. [2024-06-27 22:34:40,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11819 conditions, 1930 events. 964/1930 cut-off events. For 45550/45565 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11851 event pairs, 187 based on Foata normal form. 5/1768 useless extension candidates. Maximal degree in co-relation 11716. Up to 1322 conditions per place. [2024-06-27 22:34:40,699 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 187 selfloop transitions, 97 changer transitions 0/296 dead transitions. [2024-06-27 22:34:40,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 296 transitions, 4724 flow [2024-06-27 22:34:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:34:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:34:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 22:34:40,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:34:40,705 INFO L175 Difference]: Start difference. First operand has 219 places, 270 transitions, 3929 flow. Second operand 8 states and 150 transitions. [2024-06-27 22:34:40,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 296 transitions, 4724 flow [2024-06-27 22:34:40,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 296 transitions, 4411 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:40,840 INFO L231 Difference]: Finished difference. Result has 220 places, 271 transitions, 3825 flow [2024-06-27 22:34:40,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3825, PETRI_PLACES=220, PETRI_TRANSITIONS=271} [2024-06-27 22:34:40,840 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-06-27 22:34:40,840 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 271 transitions, 3825 flow [2024-06-27 22:34:40,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:40,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:40,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:34:40,841 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-06-27 22:34:40,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 310398925, now seen corresponding path program 8 times [2024-06-27 22:34:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334091415] [2024-06-27 22:34:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:42,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:42,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334091415] [2024-06-27 22:34:42,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334091415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:42,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:42,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826808412] [2024-06-27 22:34:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:42,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:42,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:42,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 271 transitions, 3825 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:42,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:42,797 INFO L124 PetriNetUnfolderBase]: 980/1945 cut-off events. [2024-06-27 22:34:42,797 INFO L125 PetriNetUnfolderBase]: For 45910/45925 co-relation queries the response was YES. [2024-06-27 22:34:42,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11722 conditions, 1945 events. 980/1945 cut-off events. For 45910/45925 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12059 event pairs, 249 based on Foata normal form. 5/1778 useless extension candidates. Maximal degree in co-relation 11619. Up to 1449 conditions per place. [2024-06-27 22:34:42,814 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 184 selfloop transitions, 96 changer transitions 0/292 dead transitions. [2024-06-27 22:34:42,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 292 transitions, 4474 flow [2024-06-27 22:34:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:34:42,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:34:42,815 INFO L175 Difference]: Start difference. First operand has 220 places, 271 transitions, 3825 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:34:42,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 292 transitions, 4474 flow [2024-06-27 22:34:42,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 292 transitions, 4161 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:42,961 INFO L231 Difference]: Finished difference. Result has 221 places, 272 transitions, 3723 flow [2024-06-27 22:34:42,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3518, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3723, PETRI_PLACES=221, PETRI_TRANSITIONS=272} [2024-06-27 22:34:42,961 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 181 predicate places. [2024-06-27 22:34:42,961 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 272 transitions, 3723 flow [2024-06-27 22:34:42,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:42,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:42,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:34:42,962 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-06-27 22:34:42,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 310399080, now seen corresponding path program 5 times [2024-06-27 22:34:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014137853] [2024-06-27 22:34:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014137853] [2024-06-27 22:34:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014137853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:44,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098145045] [2024-06-27 22:34:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:44,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:44,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:44,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 272 transitions, 3723 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:44,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:44,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:44,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:45,197 INFO L124 PetriNetUnfolderBase]: 994/1965 cut-off events. [2024-06-27 22:34:45,197 INFO L125 PetriNetUnfolderBase]: For 47119/47134 co-relation queries the response was YES. [2024-06-27 22:34:45,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11518 conditions, 1965 events. 994/1965 cut-off events. For 47119/47134 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12171 event pairs, 217 based on Foata normal form. 5/1792 useless extension candidates. Maximal degree in co-relation 11415. Up to 1150 conditions per place. [2024-06-27 22:34:45,214 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 117 selfloop transitions, 166 changer transitions 0/295 dead transitions. [2024-06-27 22:34:45,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 295 transitions, 4541 flow [2024-06-27 22:34:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 22:34:45,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:34:45,216 INFO L175 Difference]: Start difference. First operand has 221 places, 272 transitions, 3723 flow. Second operand 9 states and 162 transitions. [2024-06-27 22:34:45,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 295 transitions, 4541 flow [2024-06-27 22:34:45,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 295 transitions, 4349 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:45,371 INFO L231 Difference]: Finished difference. Result has 223 places, 274 transitions, 3912 flow [2024-06-27 22:34:45,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3531, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3912, PETRI_PLACES=223, PETRI_TRANSITIONS=274} [2024-06-27 22:34:45,372 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2024-06-27 22:34:45,372 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 274 transitions, 3912 flow [2024-06-27 22:34:45,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:45,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:45,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:45,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:34:45,372 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-06-27 22:34:45,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash 315905610, now seen corresponding path program 6 times [2024-06-27 22:34:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484569030] [2024-06-27 22:34:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:47,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484569030] [2024-06-27 22:34:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484569030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:34:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367100618] [2024-06-27 22:34:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:47,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:34:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:47,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:34:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:34:47,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:47,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 274 transitions, 3912 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:47,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:47,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:47,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:47,868 INFO L124 PetriNetUnfolderBase]: 1025/2014 cut-off events. [2024-06-27 22:34:47,868 INFO L125 PetriNetUnfolderBase]: For 50092/50107 co-relation queries the response was YES. [2024-06-27 22:34:47,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12162 conditions, 2014 events. 1025/2014 cut-off events. For 50092/50107 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12486 event pairs, 226 based on Foata normal form. 5/1830 useless extension candidates. Maximal degree in co-relation 12058. Up to 1340 conditions per place. [2024-06-27 22:34:47,886 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 137 selfloop transitions, 143 changer transitions 0/292 dead transitions. [2024-06-27 22:34:47,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 292 transitions, 4576 flow [2024-06-27 22:34:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 22:34:47,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 22:34:47,888 INFO L175 Difference]: Start difference. First operand has 223 places, 274 transitions, 3912 flow. Second operand 10 states and 168 transitions. [2024-06-27 22:34:47,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 292 transitions, 4576 flow [2024-06-27 22:34:48,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 292 transitions, 4188 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:48,042 INFO L231 Difference]: Finished difference. Result has 226 places, 276 transitions, 3867 flow [2024-06-27 22:34:48,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3867, PETRI_PLACES=226, PETRI_TRANSITIONS=276} [2024-06-27 22:34:48,042 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 186 predicate places. [2024-06-27 22:34:48,042 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 276 transitions, 3867 flow [2024-06-27 22:34:48,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:48,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:48,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:34:48,043 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-06-27 22:34:48,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1228513606, now seen corresponding path program 1 times [2024-06-27 22:34:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507119827] [2024-06-27 22:34:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507119827] [2024-06-27 22:34:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507119827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:49,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819564663] [2024-06-27 22:34:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:49,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:50,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:34:50,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 276 transitions, 3867 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-06-27 22:34:50,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:50,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:34:50,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:50,817 INFO L124 PetriNetUnfolderBase]: 1155/2221 cut-off events. [2024-06-27 22:34:50,817 INFO L125 PetriNetUnfolderBase]: For 56142/56144 co-relation queries the response was YES. [2024-06-27 22:34:50,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13050 conditions, 2221 events. 1155/2221 cut-off events. For 56142/56144 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13638 event pairs, 250 based on Foata normal form. 6/2078 useless extension candidates. Maximal degree in co-relation 12945. Up to 1501 conditions per place. [2024-06-27 22:34:50,837 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 165 selfloop transitions, 131 changer transitions 0/304 dead transitions. [2024-06-27 22:34:50,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 304 transitions, 4601 flow [2024-06-27 22:34:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:34:50,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:34:50,841 INFO L175 Difference]: Start difference. First operand has 226 places, 276 transitions, 3867 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:34:50,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 304 transitions, 4601 flow [2024-06-27 22:34:51,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 304 transitions, 4286 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:51,008 INFO L231 Difference]: Finished difference. Result has 228 places, 278 transitions, 3860 flow [2024-06-27 22:34:51,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3552, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3860, PETRI_PLACES=228, PETRI_TRANSITIONS=278} [2024-06-27 22:34:51,009 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2024-06-27 22:34:51,009 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 278 transitions, 3860 flow [2024-06-27 22:34:51,009 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-06-27 22:34:51,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:51,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:51,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:34:51,010 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-06-27 22:34:51,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 768132835, now seen corresponding path program 9 times [2024-06-27 22:34:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287807275] [2024-06-27 22:34:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:52,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287807275] [2024-06-27 22:34:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287807275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:52,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:52,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532877753] [2024-06-27 22:34:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:52,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:52,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:52,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 278 transitions, 3860 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:52,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:52,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:53,360 INFO L124 PetriNetUnfolderBase]: 1135/2305 cut-off events. [2024-06-27 22:34:53,360 INFO L125 PetriNetUnfolderBase]: For 73909/73927 co-relation queries the response was YES. [2024-06-27 22:34:53,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12943 conditions, 2305 events. 1135/2305 cut-off events. For 73909/73927 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15156 event pairs, 270 based on Foata normal form. 15/2108 useless extension candidates. Maximal degree in co-relation 12837. Up to 1406 conditions per place. [2024-06-27 22:34:53,381 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 152 selfloop transitions, 138 changer transitions 0/302 dead transitions. [2024-06-27 22:34:53,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 302 transitions, 4553 flow [2024-06-27 22:34:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:34:53,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-06-27 22:34:53,382 INFO L175 Difference]: Start difference. First operand has 228 places, 278 transitions, 3860 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:34:53,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 302 transitions, 4553 flow [2024-06-27 22:34:53,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 302 transitions, 4267 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:53,549 INFO L231 Difference]: Finished difference. Result has 230 places, 279 transitions, 3867 flow [2024-06-27 22:34:53,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3574, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3867, PETRI_PLACES=230, PETRI_TRANSITIONS=279} [2024-06-27 22:34:53,550 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 190 predicate places. [2024-06-27 22:34:53,550 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 279 transitions, 3867 flow [2024-06-27 22:34:53,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:53,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:53,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:34:53,551 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-06-27 22:34:53,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 587599375, now seen corresponding path program 10 times [2024-06-27 22:34:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089231775] [2024-06-27 22:34:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:54,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-06-27 22:34:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089231775] [2024-06-27 22:34:54,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089231775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:54,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:54,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982782966] [2024-06-27 22:34:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:54,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:55,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:55,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 279 transitions, 3867 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:55,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:55,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:55,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:55,749 INFO L124 PetriNetUnfolderBase]: 1197/2486 cut-off events. [2024-06-27 22:34:55,750 INFO L125 PetriNetUnfolderBase]: For 75630/75651 co-relation queries the response was YES. [2024-06-27 22:34:55,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13377 conditions, 2486 events. 1197/2486 cut-off events. For 75630/75651 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16932 event pairs, 329 based on Foata normal form. 13/2278 useless extension candidates. Maximal degree in co-relation 13270. Up to 1555 conditions per place. [2024-06-27 22:34:55,774 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 140 selfloop transitions, 153 changer transitions 0/305 dead transitions. [2024-06-27 22:34:55,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 305 transitions, 4588 flow [2024-06-27 22:34:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:34:55,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-06-27 22:34:55,775 INFO L175 Difference]: Start difference. First operand has 230 places, 279 transitions, 3867 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:34:55,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 305 transitions, 4588 flow [2024-06-27 22:34:55,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 305 transitions, 4312 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:55,956 INFO L231 Difference]: Finished difference. Result has 231 places, 280 transitions, 3916 flow [2024-06-27 22:34:55,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3591, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3916, PETRI_PLACES=231, PETRI_TRANSITIONS=280} [2024-06-27 22:34:55,957 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 191 predicate places. [2024-06-27 22:34:55,957 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 280 transitions, 3916 flow [2024-06-27 22:34:55,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:55,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:55,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:55,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:34:55,957 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-06-27 22:34:55,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 310543230, now seen corresponding path program 7 times [2024-06-27 22:34:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956403032] [2024-06-27 22:34:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:57,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956403032] [2024-06-27 22:34:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956403032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275825116] [2024-06-27 22:34:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:57,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:57,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:34:57,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 280 transitions, 3916 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:57,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:57,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:34:57,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:58,305 INFO L124 PetriNetUnfolderBase]: 1210/2490 cut-off events. [2024-06-27 22:34:58,305 INFO L125 PetriNetUnfolderBase]: For 56023/56044 co-relation queries the response was YES. [2024-06-27 22:34:58,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13623 conditions, 2490 events. 1210/2490 cut-off events. For 56023/56044 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16967 event pairs, 330 based on Foata normal form. 3/2270 useless extension candidates. Maximal degree in co-relation 13515. Up to 1721 conditions per place. [2024-06-27 22:34:58,327 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 129 selfloop transitions, 159 changer transitions 0/300 dead transitions. [2024-06-27 22:34:58,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 300 transitions, 4616 flow [2024-06-27 22:34:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 22:34:58,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-06-27 22:34:58,328 INFO L175 Difference]: Start difference. First operand has 231 places, 280 transitions, 3916 flow. Second operand 9 states and 158 transitions. [2024-06-27 22:34:58,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 300 transitions, 4616 flow [2024-06-27 22:34:58,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 300 transitions, 4308 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:58,492 INFO L231 Difference]: Finished difference. Result has 233 places, 282 transitions, 3983 flow [2024-06-27 22:34:58,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3608, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3983, PETRI_PLACES=233, PETRI_TRANSITIONS=282} [2024-06-27 22:34:58,493 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 193 predicate places. [2024-06-27 22:34:58,493 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 282 transitions, 3983 flow [2024-06-27 22:34:58,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:58,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:58,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:58,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:34:58,494 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-06-27 22:34:58,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1545464468, now seen corresponding path program 2 times [2024-06-27 22:34:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120427638] [2024-06-27 22:34:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120427638] [2024-06-27 22:35:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120427638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:00,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:00,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:35:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470281985] [2024-06-27 22:35:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:00,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:35:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:35:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:35:00,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:00,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 282 transitions, 3983 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:00,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:00,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:00,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:01,200 INFO L124 PetriNetUnfolderBase]: 1521/3110 cut-off events. [2024-06-27 22:35:01,200 INFO L125 PetriNetUnfolderBase]: For 78728/78728 co-relation queries the response was YES. [2024-06-27 22:35:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 3110 events. 1521/3110 cut-off events. For 78728/78728 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21698 event pairs, 698 based on Foata normal form. 10/2913 useless extension candidates. Maximal degree in co-relation 16078. Up to 2020 conditions per place. [2024-06-27 22:35:01,226 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 188 selfloop transitions, 119 changer transitions 0/315 dead transitions. [2024-06-27 22:35:01,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 315 transitions, 4822 flow [2024-06-27 22:35:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:35:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:35:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:35:01,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-27 22:35:01,227 INFO L175 Difference]: Start difference. First operand has 233 places, 282 transitions, 3983 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:35:01,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 315 transitions, 4822 flow [2024-06-27 22:35:01,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 315 transitions, 4471 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 22:35:01,426 INFO L231 Difference]: Finished difference. Result has 238 places, 286 transitions, 3940 flow [2024-06-27 22:35:01,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3632, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3940, PETRI_PLACES=238, PETRI_TRANSITIONS=286} [2024-06-27 22:35:01,429 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 198 predicate places. [2024-06-27 22:35:01,429 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 286 transitions, 3940 flow [2024-06-27 22:35:01,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:01,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:01,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:01,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:35:01,430 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-06-27 22:35:01,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 534249470, now seen corresponding path program 3 times [2024-06-27 22:35:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604500910] [2024-06-27 22:35:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604500910] [2024-06-27 22:35:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604500910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385655687] [2024-06-27 22:35:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:03,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:03,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:03,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 286 transitions, 3940 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-06-27 22:35:03,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:03,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:03,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:04,027 INFO L124 PetriNetUnfolderBase]: 1538/3101 cut-off events. [2024-06-27 22:35:04,027 INFO L125 PetriNetUnfolderBase]: For 62704/62704 co-relation queries the response was YES. [2024-06-27 22:35:04,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 3101 events. 1538/3101 cut-off events. For 62704/62704 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21592 event pairs, 714 based on Foata normal form. 2/2890 useless extension candidates. Maximal degree in co-relation 16149. Up to 2632 conditions per place. [2024-06-27 22:35:04,054 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 273 selfloop transitions, 26 changer transitions 0/307 dead transitions. [2024-06-27 22:35:04,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 307 transitions, 4668 flow [2024-06-27 22:35:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-27 22:35:04,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 22:35:04,056 INFO L175 Difference]: Start difference. First operand has 238 places, 286 transitions, 3940 flow. Second operand 10 states and 149 transitions. [2024-06-27 22:35:04,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 307 transitions, 4668 flow [2024-06-27 22:35:04,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 307 transitions, 4422 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:04,254 INFO L231 Difference]: Finished difference. Result has 240 places, 287 transitions, 3781 flow [2024-06-27 22:35:04,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3694, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3781, PETRI_PLACES=240, PETRI_TRANSITIONS=287} [2024-06-27 22:35:04,254 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-06-27 22:35:04,254 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 287 transitions, 3781 flow [2024-06-27 22:35:04,255 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-06-27 22:35:04,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:04,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:35:04,255 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-06-27 22:35:04,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash -705618610, now seen corresponding path program 4 times [2024-06-27 22:35:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026303761] [2024-06-27 22:35:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026303761] [2024-06-27 22:35:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026303761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904513231] [2024-06-27 22:35:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:06,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:06,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 287 transitions, 3781 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-06-27 22:35:06,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:06,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:06,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:06,727 INFO L124 PetriNetUnfolderBase]: 1555/3143 cut-off events. [2024-06-27 22:35:06,727 INFO L125 PetriNetUnfolderBase]: For 63938/63938 co-relation queries the response was YES. [2024-06-27 22:35:06,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16226 conditions, 3143 events. 1555/3143 cut-off events. For 63938/63938 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22040 event pairs, 720 based on Foata normal form. 2/2931 useless extension candidates. Maximal degree in co-relation 16114. Up to 2640 conditions per place. [2024-06-27 22:35:06,754 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 267 selfloop transitions, 35 changer transitions 0/310 dead transitions. [2024-06-27 22:35:06,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 310 transitions, 4547 flow [2024-06-27 22:35:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:35:06,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 22:35:06,756 INFO L175 Difference]: Start difference. First operand has 240 places, 287 transitions, 3781 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:35:06,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 310 transitions, 4547 flow [2024-06-27 22:35:06,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 310 transitions, 4472 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:06,970 INFO L231 Difference]: Finished difference. Result has 242 places, 288 transitions, 3813 flow [2024-06-27 22:35:06,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3813, PETRI_PLACES=242, PETRI_TRANSITIONS=288} [2024-06-27 22:35:06,971 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 202 predicate places. [2024-06-27 22:35:06,971 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 288 transitions, 3813 flow [2024-06-27 22:35:06,971 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-06-27 22:35:06,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:06,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:35:06,971 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-06-27 22:35:06,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1464928856, now seen corresponding path program 5 times [2024-06-27 22:35:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290074621] [2024-06-27 22:35:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290074621] [2024-06-27 22:35:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290074621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273156482] [2024-06-27 22:35:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:08,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:08,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:08,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:08,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 288 transitions, 3813 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-06-27 22:35:08,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:09,114 INFO L124 PetriNetUnfolderBase]: 1572/3172 cut-off events. [2024-06-27 22:35:09,114 INFO L125 PetriNetUnfolderBase]: For 66009/66009 co-relation queries the response was YES. [2024-06-27 22:35:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16404 conditions, 3172 events. 1572/3172 cut-off events. For 66009/66009 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22183 event pairs, 719 based on Foata normal form. 2/2972 useless extension candidates. Maximal degree in co-relation 16291. Up to 2698 conditions per place. [2024-06-27 22:35:09,143 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 287 selfloop transitions, 16 changer transitions 0/311 dead transitions. [2024-06-27 22:35:09,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 311 transitions, 4545 flow [2024-06-27 22:35:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-27 22:35:09,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-27 22:35:09,145 INFO L175 Difference]: Start difference. First operand has 242 places, 288 transitions, 3813 flow. Second operand 10 states and 148 transitions. [2024-06-27 22:35:09,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 311 transitions, 4545 flow [2024-06-27 22:35:09,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 311 transitions, 4447 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 22:35:09,349 INFO L231 Difference]: Finished difference. Result has 244 places, 291 transitions, 3806 flow [2024-06-27 22:35:09,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3715, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3806, PETRI_PLACES=244, PETRI_TRANSITIONS=291} [2024-06-27 22:35:09,349 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 204 predicate places. [2024-06-27 22:35:09,349 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 291 transitions, 3806 flow [2024-06-27 22:35:09,350 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-06-27 22:35:09,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:09,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:09,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:35:09,350 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-06-27 22:35:09,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -961741382, now seen corresponding path program 8 times [2024-06-27 22:35:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701486687] [2024-06-27 22:35:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701486687] [2024-06-27 22:35:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701486687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:10,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:10,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913877430] [2024-06-27 22:35:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:10,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:11,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:11,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 291 transitions, 3806 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-06-27 22:35:11,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:11,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:11,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:12,110 INFO L124 PetriNetUnfolderBase]: 1585/3204 cut-off events. [2024-06-27 22:35:12,110 INFO L125 PetriNetUnfolderBase]: For 67017/67017 co-relation queries the response was YES. [2024-06-27 22:35:12,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16559 conditions, 3204 events. 1585/3204 cut-off events. For 67017/67017 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22514 event pairs, 719 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 16444. Up to 2659 conditions per place. [2024-06-27 22:35:12,139 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 258 selfloop transitions, 54 changer transitions 0/320 dead transitions. [2024-06-27 22:35:12,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 320 transitions, 4656 flow [2024-06-27 22:35:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:35:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:35:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2024-06-27 22:35:12,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-06-27 22:35:12,140 INFO L175 Difference]: Start difference. First operand has 244 places, 291 transitions, 3806 flow. Second operand 13 states and 190 transitions. [2024-06-27 22:35:12,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 320 transitions, 4656 flow [2024-06-27 22:35:12,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 320 transitions, 4591 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-27 22:35:12,399 INFO L231 Difference]: Finished difference. Result has 250 places, 293 transitions, 3912 flow [2024-06-27 22:35:12,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3912, PETRI_PLACES=250, PETRI_TRANSITIONS=293} [2024-06-27 22:35:12,400 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 210 predicate places. [2024-06-27 22:35:12,400 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 293 transitions, 3912 flow [2024-06-27 22:35:12,400 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-06-27 22:35:12,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:12,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:35:12,400 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-06-27 22:35:12,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1761887798, now seen corresponding path program 6 times [2024-06-27 22:35:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117008942] [2024-06-27 22:35:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:13,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117008942] [2024-06-27 22:35:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117008942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064821844] [2024-06-27 22:35:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:13,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:13,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:13,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 293 transitions, 3912 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-06-27 22:35:13,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:13,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:13,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:14,827 INFO L124 PetriNetUnfolderBase]: 1586/3202 cut-off events. [2024-06-27 22:35:14,827 INFO L125 PetriNetUnfolderBase]: For 62657/62657 co-relation queries the response was YES. [2024-06-27 22:35:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16359 conditions, 3202 events. 1586/3202 cut-off events. For 62657/62657 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22523 event pairs, 733 based on Foata normal form. 2/2983 useless extension candidates. Maximal degree in co-relation 16243. Up to 2719 conditions per place. [2024-06-27 22:35:14,873 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 283 selfloop transitions, 22 changer transitions 0/313 dead transitions. [2024-06-27 22:35:14,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 313 transitions, 4641 flow [2024-06-27 22:35:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-27 22:35:14,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-27 22:35:14,875 INFO L175 Difference]: Start difference. First operand has 250 places, 293 transitions, 3912 flow. Second operand 10 states and 147 transitions. [2024-06-27 22:35:14,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 313 transitions, 4641 flow [2024-06-27 22:35:15,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 313 transitions, 4487 flow, removed 23 selfloop flow, removed 12 redundant places. [2024-06-27 22:35:15,121 INFO L231 Difference]: Finished difference. Result has 248 places, 294 transitions, 3846 flow [2024-06-27 22:35:15,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3846, PETRI_PLACES=248, PETRI_TRANSITIONS=294} [2024-06-27 22:35:15,122 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 208 predicate places. [2024-06-27 22:35:15,122 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 294 transitions, 3846 flow [2024-06-27 22:35:15,122 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-06-27 22:35:15,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:15,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:15,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:35:15,123 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-06-27 22:35:15,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1836185887, now seen corresponding path program 11 times [2024-06-27 22:35:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:15,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350055812] [2024-06-27 22:35:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:16,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-06-27 22:35:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350055812] [2024-06-27 22:35:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350055812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797776446] [2024-06-27 22:35:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:16,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:16,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:16,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 294 transitions, 3846 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-06-27 22:35:16,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:16,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:16,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:17,500 INFO L124 PetriNetUnfolderBase]: 1603/3247 cut-off events. [2024-06-27 22:35:17,501 INFO L125 PetriNetUnfolderBase]: For 63306/63306 co-relation queries the response was YES. [2024-06-27 22:35:17,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16248 conditions, 3247 events. 1603/3247 cut-off events. For 63306/63306 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22968 event pairs, 738 based on Foata normal form. 2/3027 useless extension candidates. Maximal degree in co-relation 16132. Up to 2753 conditions per place. [2024-06-27 22:35:17,533 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 278 selfloop transitions, 30 changer transitions 0/316 dead transitions. [2024-06-27 22:35:17,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 316 transitions, 4595 flow [2024-06-27 22:35:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:35:17,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 22:35:17,535 INFO L175 Difference]: Start difference. First operand has 248 places, 294 transitions, 3846 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:35:17,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 316 transitions, 4595 flow [2024-06-27 22:35:17,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 316 transitions, 4523 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:17,759 INFO L231 Difference]: Finished difference. Result has 250 places, 295 transitions, 3853 flow [2024-06-27 22:35:17,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3774, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3853, PETRI_PLACES=250, PETRI_TRANSITIONS=295} [2024-06-27 22:35:17,760 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 210 predicate places. [2024-06-27 22:35:17,760 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 295 transitions, 3853 flow [2024-06-27 22:35:17,760 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-06-27 22:35:17,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:17,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:17,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:35:17,760 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-06-27 22:35:17,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1836186042, now seen corresponding path program 9 times [2024-06-27 22:35:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019498978] [2024-06-27 22:35:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:19,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-06-27 22:35:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019498978] [2024-06-27 22:35:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019498978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:19,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449180226] [2024-06-27 22:35:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:19,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:19,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 295 transitions, 3853 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-06-27 22:35:19,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:19,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:19,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:20,404 INFO L124 PetriNetUnfolderBase]: 1616/3266 cut-off events. [2024-06-27 22:35:20,405 INFO L125 PetriNetUnfolderBase]: For 63417/63417 co-relation queries the response was YES. [2024-06-27 22:35:20,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16292 conditions, 3266 events. 1616/3266 cut-off events. For 63417/63417 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23036 event pairs, 740 based on Foata normal form. 2/3042 useless extension candidates. Maximal degree in co-relation 16175. Up to 2773 conditions per place. [2024-06-27 22:35:20,511 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 273 selfloop transitions, 35 changer transitions 0/316 dead transitions. [2024-06-27 22:35:20,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 316 transitions, 4644 flow [2024-06-27 22:35:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:35:20,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 22:35:20,512 INFO L175 Difference]: Start difference. First operand has 250 places, 295 transitions, 3853 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:35:20,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 316 transitions, 4644 flow [2024-06-27 22:35:20,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 316 transitions, 4578 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:20,720 INFO L231 Difference]: Finished difference. Result has 252 places, 297 transitions, 3922 flow [2024-06-27 22:35:20,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3787, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3922, PETRI_PLACES=252, PETRI_TRANSITIONS=297} [2024-06-27 22:35:20,720 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 212 predicate places. [2024-06-27 22:35:20,720 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 297 transitions, 3922 flow [2024-06-27 22:35:20,720 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-06-27 22:35:20,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:20,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:20,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:35:20,721 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-06-27 22:35:20,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1177418860, now seen corresponding path program 10 times [2024-06-27 22:35:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086751831] [2024-06-27 22:35:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086751831] [2024-06-27 22:35:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086751831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664033508] [2024-06-27 22:35:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:22,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:22,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:22,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 297 transitions, 3922 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-06-27 22:35:22,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:22,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:22,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:23,314 INFO L124 PetriNetUnfolderBase]: 1629/3280 cut-off events. [2024-06-27 22:35:23,315 INFO L125 PetriNetUnfolderBase]: For 65439/65439 co-relation queries the response was YES. [2024-06-27 22:35:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16499 conditions, 3280 events. 1629/3280 cut-off events. For 65439/65439 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23093 event pairs, 739 based on Foata normal form. 2/3051 useless extension candidates. Maximal degree in co-relation 16381. Up to 2773 conditions per place. [2024-06-27 22:35:23,343 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 281 selfloop transitions, 32 changer transitions 0/321 dead transitions. [2024-06-27 22:35:23,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 321 transitions, 4712 flow [2024-06-27 22:35:23,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:35:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:35:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2024-06-27 22:35:23,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-27 22:35:23,344 INFO L175 Difference]: Start difference. First operand has 252 places, 297 transitions, 3922 flow. Second operand 12 states and 171 transitions. [2024-06-27 22:35:23,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 321 transitions, 4712 flow [2024-06-27 22:35:23,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 321 transitions, 4601 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:23,579 INFO L231 Difference]: Finished difference. Result has 256 places, 299 transitions, 3947 flow [2024-06-27 22:35:23,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3811, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3947, PETRI_PLACES=256, PETRI_TRANSITIONS=299} [2024-06-27 22:35:23,579 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 216 predicate places. [2024-06-27 22:35:23,579 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 299 transitions, 3947 flow [2024-06-27 22:35:23,579 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-06-27 22:35:23,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:23,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:35:23,580 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-06-27 22:35:23,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1380438742, now seen corresponding path program 11 times [2024-06-27 22:35:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172748324] [2024-06-27 22:35:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172748324] [2024-06-27 22:35:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172748324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193040042] [2024-06-27 22:35:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:25,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:25,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:25,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:25,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 299 transitions, 3947 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-06-27 22:35:25,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:25,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:25,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:26,219 INFO L124 PetriNetUnfolderBase]: 1642/3304 cut-off events. [2024-06-27 22:35:26,219 INFO L125 PetriNetUnfolderBase]: For 67174/67174 co-relation queries the response was YES. [2024-06-27 22:35:26,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16662 conditions, 3304 events. 1642/3304 cut-off events. For 67174/67174 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23314 event pairs, 729 based on Foata normal form. 2/3074 useless extension candidates. Maximal degree in co-relation 16543. Up to 2750 conditions per place. [2024-06-27 22:35:26,249 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 266 selfloop transitions, 52 changer transitions 0/326 dead transitions. [2024-06-27 22:35:26,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 326 transitions, 4817 flow [2024-06-27 22:35:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:35:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:35:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:35:26,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-27 22:35:26,250 INFO L175 Difference]: Start difference. First operand has 256 places, 299 transitions, 3947 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:35:26,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 326 transitions, 4817 flow [2024-06-27 22:35:26,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 326 transitions, 4707 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-06-27 22:35:26,502 INFO L231 Difference]: Finished difference. Result has 257 places, 301 transitions, 4016 flow [2024-06-27 22:35:26,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3837, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4016, PETRI_PLACES=257, PETRI_TRANSITIONS=301} [2024-06-27 22:35:26,502 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 217 predicate places. [2024-06-27 22:35:26,503 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 301 transitions, 4016 flow [2024-06-27 22:35:26,503 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-06-27 22:35:26,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:26,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:26,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:35:26,503 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-06-27 22:35:26,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2046361344, now seen corresponding path program 12 times [2024-06-27 22:35:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:26,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914170157] [2024-06-27 22:35:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:28,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-06-27 22:35:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914170157] [2024-06-27 22:35:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914170157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488589700] [2024-06-27 22:35:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:28,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:28,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:28,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:28,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:28,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 301 transitions, 4016 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-06-27 22:35:28,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:28,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:28,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:29,254 INFO L124 PetriNetUnfolderBase]: 1655/3317 cut-off events. [2024-06-27 22:35:29,254 INFO L125 PetriNetUnfolderBase]: For 69441/69441 co-relation queries the response was YES. [2024-06-27 22:35:29,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16845 conditions, 3317 events. 1655/3317 cut-off events. For 69441/69441 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23296 event pairs, 734 based on Foata normal form. 2/3081 useless extension candidates. Maximal degree in co-relation 16725. Up to 2775 conditions per place. [2024-06-27 22:35:29,285 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 271 selfloop transitions, 45 changer transitions 0/324 dead transitions. [2024-06-27 22:35:29,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 324 transitions, 4831 flow [2024-06-27 22:35:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:35:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:35:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2024-06-27 22:35:29,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116161616161616 [2024-06-27 22:35:29,286 INFO L175 Difference]: Start difference. First operand has 257 places, 301 transitions, 4016 flow. Second operand 11 states and 163 transitions. [2024-06-27 22:35:29,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 324 transitions, 4831 flow [2024-06-27 22:35:29,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 324 transitions, 4680 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-27 22:35:29,527 INFO L231 Difference]: Finished difference. Result has 259 places, 303 transitions, 4034 flow [2024-06-27 22:35:29,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4034, PETRI_PLACES=259, PETRI_TRANSITIONS=303} [2024-06-27 22:35:29,527 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 219 predicate places. [2024-06-27 22:35:29,527 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 303 transitions, 4034 flow [2024-06-27 22:35:29,528 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-06-27 22:35:29,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:29,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:29,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:35:29,528 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-06-27 22:35:29,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1170061475, now seen corresponding path program 12 times [2024-06-27 22:35:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708496978] [2024-06-27 22:35:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708496978] [2024-06-27 22:35:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708496978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690228795] [2024-06-27 22:35:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:31,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:31,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 303 transitions, 4034 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-06-27 22:35:31,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:31,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:31,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:31,994 INFO L124 PetriNetUnfolderBase]: 1652/3315 cut-off events. [2024-06-27 22:35:31,994 INFO L125 PetriNetUnfolderBase]: For 63949/63949 co-relation queries the response was YES. [2024-06-27 22:35:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 3315 events. 1652/3315 cut-off events. For 63949/63949 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23299 event pairs, 745 based on Foata normal form. 2/3082 useless extension candidates. Maximal degree in co-relation 16435. Up to 2835 conditions per place. [2024-06-27 22:35:32,021 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 292 selfloop transitions, 23 changer transitions 0/323 dead transitions. [2024-06-27 22:35:32,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 323 transitions, 4760 flow [2024-06-27 22:35:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-27 22:35:32,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 22:35:32,022 INFO L175 Difference]: Start difference. First operand has 259 places, 303 transitions, 4034 flow. Second operand 10 states and 149 transitions. [2024-06-27 22:35:32,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 323 transitions, 4760 flow [2024-06-27 22:35:32,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 323 transitions, 4617 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-27 22:35:32,260 INFO L231 Difference]: Finished difference. Result has 260 places, 303 transitions, 3941 flow [2024-06-27 22:35:32,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3941, PETRI_PLACES=260, PETRI_TRANSITIONS=303} [2024-06-27 22:35:32,261 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 220 predicate places. [2024-06-27 22:35:32,261 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 303 transitions, 3941 flow [2024-06-27 22:35:32,261 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-06-27 22:35:32,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:32,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:32,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:35:32,261 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-06-27 22:35:32,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1170061630, now seen corresponding path program 13 times [2024-06-27 22:35:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544665682] [2024-06-27 22:35:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544665682] [2024-06-27 22:35:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544665682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:33,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422875051] [2024-06-27 22:35:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:33,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:33,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:33,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 303 transitions, 3941 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-06-27 22:35:33,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:33,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:33,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:34,869 INFO L124 PetriNetUnfolderBase]: 1672/3344 cut-off events. [2024-06-27 22:35:34,869 INFO L125 PetriNetUnfolderBase]: For 64981/64981 co-relation queries the response was YES. [2024-06-27 22:35:34,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16647 conditions, 3344 events. 1672/3344 cut-off events. For 64981/64981 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23485 event pairs, 743 based on Foata normal form. 2/3105 useless extension candidates. Maximal degree in co-relation 16525. Up to 2829 conditions per place. [2024-06-27 22:35:34,898 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 286 selfloop transitions, 39 changer transitions 0/333 dead transitions. [2024-06-27 22:35:34,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 333 transitions, 4852 flow [2024-06-27 22:35:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 22:35:34,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-27 22:35:34,899 INFO L175 Difference]: Start difference. First operand has 260 places, 303 transitions, 3941 flow. Second operand 10 states and 155 transitions. [2024-06-27 22:35:34,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 333 transitions, 4852 flow [2024-06-27 22:35:35,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 333 transitions, 4800 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:35,153 INFO L231 Difference]: Finished difference. Result has 264 places, 311 transitions, 4153 flow [2024-06-27 22:35:35,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3889, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4153, PETRI_PLACES=264, PETRI_TRANSITIONS=311} [2024-06-27 22:35:35,153 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 224 predicate places. [2024-06-27 22:35:35,154 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 311 transitions, 4153 flow [2024-06-27 22:35:35,154 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-06-27 22:35:35,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:35,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:35,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:35:35,154 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-06-27 22:35:35,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2046563154, now seen corresponding path program 14 times [2024-06-27 22:35:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259718500] [2024-06-27 22:35:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:36,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259718500] [2024-06-27 22:35:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259718500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287848127] [2024-06-27 22:35:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:36,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:36,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:35:36,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 311 transitions, 4153 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-06-27 22:35:36,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:36,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:35:36,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:37,916 INFO L124 PetriNetUnfolderBase]: 1668/3338 cut-off events. [2024-06-27 22:35:37,917 INFO L125 PetriNetUnfolderBase]: For 60335/60335 co-relation queries the response was YES. [2024-06-27 22:35:38,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 3338 events. 1668/3338 cut-off events. For 60335/60335 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 23467 event pairs, 732 based on Foata normal form. 2/3099 useless extension candidates. Maximal degree in co-relation 16585. Up to 2793 conditions per place. [2024-06-27 22:35:38,035 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 273 selfloop transitions, 52 changer transitions 0/333 dead transitions. [2024-06-27 22:35:38,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 333 transitions, 4940 flow [2024-06-27 22:35:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:35:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:35:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2024-06-27 22:35:38,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-27 22:35:38,036 INFO L175 Difference]: Start difference. First operand has 264 places, 311 transitions, 4153 flow. Second operand 11 states and 162 transitions. [2024-06-27 22:35:38,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 333 transitions, 4940 flow [2024-06-27 22:35:38,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 333 transitions, 4821 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-27 22:35:38,297 INFO L231 Difference]: Finished difference. Result has 270 places, 311 transitions, 4145 flow [2024-06-27 22:35:38,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4034, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4145, PETRI_PLACES=270, PETRI_TRANSITIONS=311} [2024-06-27 22:35:38,297 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 230 predicate places. [2024-06-27 22:35:38,297 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 311 transitions, 4145 flow [2024-06-27 22:35:38,297 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-06-27 22:35:38,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:38,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:38,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:35:38,298 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-06-27 22:35:38,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1241746251, now seen corresponding path program 1 times [2024-06-27 22:35:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097530418] [2024-06-27 22:35:38,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:39,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:39,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097530418] [2024-06-27 22:35:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097530418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521227111] [2024-06-27 22:35:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:39,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:40,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:40,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 311 transitions, 4145 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-06-27 22:35:40,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:40,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:40,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:41,022 INFO L124 PetriNetUnfolderBase]: 1589/3341 cut-off events. [2024-06-27 22:35:41,022 INFO L125 PetriNetUnfolderBase]: For 105663/105688 co-relation queries the response was YES. [2024-06-27 22:35:41,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16770 conditions, 3341 events. 1589/3341 cut-off events. For 105663/105688 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 24854 event pairs, 468 based on Foata normal form. 10/3071 useless extension candidates. Maximal degree in co-relation 16644. Up to 1355 conditions per place. [2024-06-27 22:35:41,060 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 178 selfloop transitions, 162 changer transitions 0/352 dead transitions. [2024-06-27 22:35:41,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 352 transitions, 5193 flow [2024-06-27 22:35:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 22:35:41,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-06-27 22:35:41,061 INFO L175 Difference]: Start difference. First operand has 270 places, 311 transitions, 4145 flow. Second operand 10 states and 182 transitions. [2024-06-27 22:35:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 352 transitions, 5193 flow [2024-06-27 22:35:41,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 352 transitions, 4963 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-27 22:35:41,399 INFO L231 Difference]: Finished difference. Result has 271 places, 313 transitions, 4378 flow [2024-06-27 22:35:41,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3917, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4378, PETRI_PLACES=271, PETRI_TRANSITIONS=313} [2024-06-27 22:35:41,400 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 231 predicate places. [2024-06-27 22:35:41,400 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 313 transitions, 4378 flow [2024-06-27 22:35:41,400 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-06-27 22:35:41,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:41,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:41,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:35:41,401 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-06-27 22:35:41,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash -174381579, now seen corresponding path program 2 times [2024-06-27 22:35:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065806342] [2024-06-27 22:35:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:41,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065806342] [2024-06-27 22:35:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065806342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283561168] [2024-06-27 22:35:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:43,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:43,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 313 transitions, 4378 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-06-27 22:35:43,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:43,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:44,288 INFO L124 PetriNetUnfolderBase]: 1716/3664 cut-off events. [2024-06-27 22:35:44,288 INFO L125 PetriNetUnfolderBase]: For 144265/144295 co-relation queries the response was YES. [2024-06-27 22:35:44,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19232 conditions, 3664 events. 1716/3664 cut-off events. For 144265/144295 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 28493 event pairs, 554 based on Foata normal form. 10/3373 useless extension candidates. Maximal degree in co-relation 19104. Up to 2082 conditions per place. [2024-06-27 22:35:44,327 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 176 selfloop transitions, 162 changer transitions 0/350 dead transitions. [2024-06-27 22:35:44,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 350 transitions, 5402 flow [2024-06-27 22:35:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 22:35:44,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:35:44,328 INFO L175 Difference]: Start difference. First operand has 271 places, 313 transitions, 4378 flow. Second operand 10 states and 185 transitions. [2024-06-27 22:35:44,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 350 transitions, 5402 flow [2024-06-27 22:35:44,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 350 transitions, 5191 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:35:44,842 INFO L231 Difference]: Finished difference. Result has 274 places, 313 transitions, 4494 flow [2024-06-27 22:35:44,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4167, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4494, PETRI_PLACES=274, PETRI_TRANSITIONS=313} [2024-06-27 22:35:44,842 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 234 predicate places. [2024-06-27 22:35:44,842 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 313 transitions, 4494 flow [2024-06-27 22:35:44,843 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-06-27 22:35:44,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:44,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:44,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:35:44,843 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-06-27 22:35:44,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1235039699, now seen corresponding path program 3 times [2024-06-27 22:35:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654079878] [2024-06-27 22:35:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:46,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:46,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654079878] [2024-06-27 22:35:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654079878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821618584] [2024-06-27 22:35:46,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:46,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:46,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:46,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:46,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:46,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:46,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 313 transitions, 4494 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-06-27 22:35:46,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:46,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:46,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:47,971 INFO L124 PetriNetUnfolderBase]: 1703/3657 cut-off events. [2024-06-27 22:35:47,971 INFO L125 PetriNetUnfolderBase]: For 120132/120159 co-relation queries the response was YES. [2024-06-27 22:35:47,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18521 conditions, 3657 events. 1703/3657 cut-off events. For 120132/120159 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 28512 event pairs, 633 based on Foata normal form. 12/3363 useless extension candidates. Maximal degree in co-relation 18392. Up to 2271 conditions per place. [2024-06-27 22:35:48,004 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 158 selfloop transitions, 168 changer transitions 0/338 dead transitions. [2024-06-27 22:35:48,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 338 transitions, 5264 flow [2024-06-27 22:35:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:35:48,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-06-27 22:35:48,005 INFO L175 Difference]: Start difference. First operand has 274 places, 313 transitions, 4494 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:35:48,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 338 transitions, 5264 flow [2024-06-27 22:35:48,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 338 transitions, 4938 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:48,427 INFO L231 Difference]: Finished difference. Result has 276 places, 313 transitions, 4508 flow [2024-06-27 22:35:48,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4168, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4508, PETRI_PLACES=276, PETRI_TRANSITIONS=313} [2024-06-27 22:35:48,427 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 236 predicate places. [2024-06-27 22:35:48,427 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 313 transitions, 4508 flow [2024-06-27 22:35:48,428 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-06-27 22:35:48,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:48,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:48,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:35:48,428 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-06-27 22:35:48,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1235044349, now seen corresponding path program 4 times [2024-06-27 22:35:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110768325] [2024-06-27 22:35:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:50,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-06-27 22:35:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110768325] [2024-06-27 22:35:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110768325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113400894] [2024-06-27 22:35:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:50,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:50,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 313 transitions, 4508 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-06-27 22:35:50,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:50,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:50,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:51,110 INFO L124 PetriNetUnfolderBase]: 1693/3622 cut-off events. [2024-06-27 22:35:51,111 INFO L125 PetriNetUnfolderBase]: For 86836/86863 co-relation queries the response was YES. [2024-06-27 22:35:51,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17798 conditions, 3622 events. 1693/3622 cut-off events. For 86836/86863 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 28167 event pairs, 592 based on Foata normal form. 10/3334 useless extension candidates. Maximal degree in co-relation 17668. Up to 2120 conditions per place. [2024-06-27 22:35:51,152 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 165 selfloop transitions, 168 changer transitions 0/345 dead transitions. [2024-06-27 22:35:51,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 345 transitions, 5336 flow [2024-06-27 22:35:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:35:51,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:35:51,153 INFO L175 Difference]: Start difference. First operand has 276 places, 313 transitions, 4508 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:35:51,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 345 transitions, 5336 flow [2024-06-27 22:35:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 345 transitions, 5002 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:51,463 INFO L231 Difference]: Finished difference. Result has 278 places, 313 transitions, 4513 flow [2024-06-27 22:35:51,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4174, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4513, PETRI_PLACES=278, PETRI_TRANSITIONS=313} [2024-06-27 22:35:51,464 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 238 predicate places. [2024-06-27 22:35:51,464 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 313 transitions, 4513 flow [2024-06-27 22:35:51,464 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-06-27 22:35:51,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:51,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:35:51,465 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-06-27 22:35:51,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 544477741, now seen corresponding path program 5 times [2024-06-27 22:35:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156837707] [2024-06-27 22:35:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156837707] [2024-06-27 22:35:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156837707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596286280] [2024-06-27 22:35:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:53,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:53,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:53,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 313 transitions, 4513 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-06-27 22:35:53,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:53,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:53,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:54,251 INFO L124 PetriNetUnfolderBase]: 1815/3958 cut-off events. [2024-06-27 22:35:54,251 INFO L125 PetriNetUnfolderBase]: For 126274/126312 co-relation queries the response was YES. [2024-06-27 22:35:54,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19769 conditions, 3958 events. 1815/3958 cut-off events. For 126274/126312 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 31675 event pairs, 687 based on Foata normal form. 18/3662 useless extension candidates. Maximal degree in co-relation 19638. Up to 2364 conditions per place. [2024-06-27 22:35:54,294 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 183 selfloop transitions, 148 changer transitions 0/343 dead transitions. [2024-06-27 22:35:54,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 343 transitions, 5499 flow [2024-06-27 22:35:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-27 22:35:54,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-27 22:35:54,296 INFO L175 Difference]: Start difference. First operand has 278 places, 313 transitions, 4513 flow. Second operand 10 states and 178 transitions. [2024-06-27 22:35:54,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 343 transitions, 5499 flow [2024-06-27 22:35:54,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 343 transitions, 5164 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:54,839 INFO L231 Difference]: Finished difference. Result has 280 places, 313 transitions, 4477 flow [2024-06-27 22:35:54,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4178, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4477, PETRI_PLACES=280, PETRI_TRANSITIONS=313} [2024-06-27 22:35:54,839 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 240 predicate places. [2024-06-27 22:35:54,839 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 313 transitions, 4477 flow [2024-06-27 22:35:54,840 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-06-27 22:35:54,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:54,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:35:54,840 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-06-27 22:35:54,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1456875061, now seen corresponding path program 6 times [2024-06-27 22:35:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524954810] [2024-06-27 22:35:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524954810] [2024-06-27 22:35:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524954810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246296021] [2024-06-27 22:35:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:56,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:56,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:56,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 313 transitions, 4477 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-06-27 22:35:56,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:56,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:56,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:57,595 INFO L124 PetriNetUnfolderBase]: 1803/3922 cut-off events. [2024-06-27 22:35:57,595 INFO L125 PetriNetUnfolderBase]: For 98821/98862 co-relation queries the response was YES. [2024-06-27 22:35:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18656 conditions, 3922 events. 1803/3922 cut-off events. For 98821/98862 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31526 event pairs, 725 based on Foata normal form. 20/3622 useless extension candidates. Maximal degree in co-relation 18524. Up to 2751 conditions per place. [2024-06-27 22:35:57,637 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 176 selfloop transitions, 148 changer transitions 0/336 dead transitions. [2024-06-27 22:35:57,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 336 transitions, 5239 flow [2024-06-27 22:35:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:35:57,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:35:57,638 INFO L175 Difference]: Start difference. First operand has 280 places, 313 transitions, 4477 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:35:57,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 336 transitions, 5239 flow [2024-06-27 22:35:57,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 336 transitions, 4944 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:57,971 INFO L231 Difference]: Finished difference. Result has 282 places, 313 transitions, 4482 flow [2024-06-27 22:35:57,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4482, PETRI_PLACES=282, PETRI_TRANSITIONS=313} [2024-06-27 22:35:57,971 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 242 predicate places. [2024-06-27 22:35:57,971 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 313 transitions, 4482 flow [2024-06-27 22:35:57,971 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-06-27 22:35:57,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:57,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:35:57,972 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-06-27 22:35:57,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1452406411, now seen corresponding path program 7 times [2024-06-27 22:35:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909745368] [2024-06-27 22:35:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909745368] [2024-06-27 22:35:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909745368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97304148] [2024-06-27 22:35:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:59,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:59,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:35:59,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 313 transitions, 4482 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-06-27 22:35:59,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:59,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:35:59,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:00,853 INFO L124 PetriNetUnfolderBase]: 1866/4080 cut-off events. [2024-06-27 22:36:00,853 INFO L125 PetriNetUnfolderBase]: For 101224/101265 co-relation queries the response was YES. [2024-06-27 22:36:00,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19225 conditions, 4080 events. 1866/4080 cut-off events. For 101224/101265 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 33228 event pairs, 775 based on Foata normal form. 20/3770 useless extension candidates. Maximal degree in co-relation 19092. Up to 2865 conditions per place. [2024-06-27 22:36:00,902 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 176 selfloop transitions, 148 changer transitions 0/336 dead transitions. [2024-06-27 22:36:00,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 336 transitions, 5244 flow [2024-06-27 22:36:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:36:00,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-06-27 22:36:00,903 INFO L175 Difference]: Start difference. First operand has 282 places, 313 transitions, 4482 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:36:00,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 336 transitions, 5244 flow [2024-06-27 22:36:01,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 336 transitions, 4950 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:01,248 INFO L231 Difference]: Finished difference. Result has 283 places, 313 transitions, 4488 flow [2024-06-27 22:36:01,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4188, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4488, PETRI_PLACES=283, PETRI_TRANSITIONS=313} [2024-06-27 22:36:01,249 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 243 predicate places. [2024-06-27 22:36:01,249 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 313 transitions, 4488 flow [2024-06-27 22:36:01,249 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-06-27 22:36:01,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:01,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:01,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:36:01,249 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-06-27 22:36:01,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1452401761, now seen corresponding path program 8 times [2024-06-27 22:36:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459193801] [2024-06-27 22:36:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459193801] [2024-06-27 22:36:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459193801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:02,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:02,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133694411] [2024-06-27 22:36:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:02,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:03,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:03,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 313 transitions, 4488 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-06-27 22:36:03,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:03,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:03,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:04,143 INFO L124 PetriNetUnfolderBase]: 1912/4214 cut-off events. [2024-06-27 22:36:04,143 INFO L125 PetriNetUnfolderBase]: For 95829/95870 co-relation queries the response was YES. [2024-06-27 22:36:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19682 conditions, 4214 events. 1912/4214 cut-off events. For 95829/95870 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 34648 event pairs, 793 based on Foata normal form. 18/3895 useless extension candidates. Maximal degree in co-relation 19549. Up to 2831 conditions per place. [2024-06-27 22:36:04,189 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 182 selfloop transitions, 149 changer transitions 0/343 dead transitions. [2024-06-27 22:36:04,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 343 transitions, 5308 flow [2024-06-27 22:36:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:36:04,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:36:04,190 INFO L175 Difference]: Start difference. First operand has 283 places, 313 transitions, 4488 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:36:04,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 343 transitions, 5308 flow [2024-06-27 22:36:04,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 343 transitions, 5014 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:36:04,582 INFO L231 Difference]: Finished difference. Result has 286 places, 313 transitions, 4495 flow [2024-06-27 22:36:04,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4495, PETRI_PLACES=286, PETRI_TRANSITIONS=313} [2024-06-27 22:36:04,583 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 246 predicate places. [2024-06-27 22:36:04,583 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 313 transitions, 4495 flow [2024-06-27 22:36:04,583 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-06-27 22:36:04,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:04,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:04,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:36:04,583 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-06-27 22:36:04,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1452286441, now seen corresponding path program 9 times [2024-06-27 22:36:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741559229] [2024-06-27 22:36:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:06,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741559229] [2024-06-27 22:36:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741559229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19939358] [2024-06-27 22:36:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:06,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:06,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 313 transitions, 4495 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-06-27 22:36:06,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:06,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:06,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:07,681 INFO L124 PetriNetUnfolderBase]: 2212/4686 cut-off events. [2024-06-27 22:36:07,681 INFO L125 PetriNetUnfolderBase]: For 99487/99489 co-relation queries the response was YES. [2024-06-27 22:36:07,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21759 conditions, 4686 events. 2212/4686 cut-off events. For 99487/99489 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 37242 event pairs, 813 based on Foata normal form. 10/4389 useless extension candidates. Maximal degree in co-relation 21624. Up to 2418 conditions per place. [2024-06-27 22:36:07,726 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 199 selfloop transitions, 149 changer transitions 0/356 dead transitions. [2024-06-27 22:36:07,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 356 transitions, 5442 flow [2024-06-27 22:36:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:36:07,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:36:07,727 INFO L175 Difference]: Start difference. First operand has 286 places, 313 transitions, 4495 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:36:07,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 356 transitions, 5442 flow [2024-06-27 22:36:08,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 356 transitions, 5145 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:08,101 INFO L231 Difference]: Finished difference. Result has 288 places, 313 transitions, 4499 flow [2024-06-27 22:36:08,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4198, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4499, PETRI_PLACES=288, PETRI_TRANSITIONS=313} [2024-06-27 22:36:08,101 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 248 predicate places. [2024-06-27 22:36:08,102 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 313 transitions, 4499 flow [2024-06-27 22:36:08,102 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-06-27 22:36:08,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:08,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:36:08,103 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-06-27 22:36:08,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1031128529, now seen corresponding path program 10 times [2024-06-27 22:36:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333183914] [2024-06-27 22:36:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333183914] [2024-06-27 22:36:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333183914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213975632] [2024-06-27 22:36:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:09,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:10,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:10,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 313 transitions, 4499 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-06-27 22:36:10,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:10,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:10,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:11,307 INFO L124 PetriNetUnfolderBase]: 2029/4651 cut-off events. [2024-06-27 22:36:11,308 INFO L125 PetriNetUnfolderBase]: For 133135/133172 co-relation queries the response was YES. [2024-06-27 22:36:11,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21539 conditions, 4651 events. 2029/4651 cut-off events. For 133135/133172 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 39709 event pairs, 829 based on Foata normal form. 11/4297 useless extension candidates. Maximal degree in co-relation 21403. Up to 2269 conditions per place. [2024-06-27 22:36:11,353 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 158 selfloop transitions, 183 changer transitions 0/353 dead transitions. [2024-06-27 22:36:11,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 353 transitions, 5567 flow [2024-06-27 22:36:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 22:36:11,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:36:11,354 INFO L175 Difference]: Start difference. First operand has 288 places, 313 transitions, 4499 flow. Second operand 10 states and 189 transitions. [2024-06-27 22:36:11,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 353 transitions, 5567 flow [2024-06-27 22:36:11,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 353 transitions, 5270 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:11,814 INFO L231 Difference]: Finished difference. Result has 290 places, 313 transitions, 4571 flow [2024-06-27 22:36:11,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4202, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4571, PETRI_PLACES=290, PETRI_TRANSITIONS=313} [2024-06-27 22:36:11,815 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 250 predicate places. [2024-06-27 22:36:11,815 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 313 transitions, 4571 flow [2024-06-27 22:36:11,815 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-06-27 22:36:11,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:11,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:11,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:36:11,816 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-06-27 22:36:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1032437791, now seen corresponding path program 11 times [2024-06-27 22:36:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759895577] [2024-06-27 22:36:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759895577] [2024-06-27 22:36:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759895577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709033984] [2024-06-27 22:36:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:13,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:13,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:13,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 313 transitions, 4571 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-06-27 22:36:13,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:13,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:13,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:14,653 INFO L124 PetriNetUnfolderBase]: 2091/4634 cut-off events. [2024-06-27 22:36:14,653 INFO L125 PetriNetUnfolderBase]: For 144846/144884 co-relation queries the response was YES. [2024-06-27 22:36:14,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22110 conditions, 4634 events. 2091/4634 cut-off events. For 144846/144884 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 39336 event pairs, 994 based on Foata normal form. 13/4281 useless extension candidates. Maximal degree in co-relation 21973. Up to 3169 conditions per place. [2024-06-27 22:36:14,705 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 141 selfloop transitions, 189 changer transitions 0/342 dead transitions. [2024-06-27 22:36:14,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 342 transitions, 5379 flow [2024-06-27 22:36:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:36:14,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:36:14,706 INFO L175 Difference]: Start difference. First operand has 290 places, 313 transitions, 4571 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:36:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 342 transitions, 5379 flow [2024-06-27 22:36:15,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 342 transitions, 4991 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:15,261 INFO L231 Difference]: Finished difference. Result has 292 places, 313 transitions, 4565 flow [2024-06-27 22:36:15,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4183, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4565, PETRI_PLACES=292, PETRI_TRANSITIONS=313} [2024-06-27 22:36:15,262 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 252 predicate places. [2024-06-27 22:36:15,262 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 313 transitions, 4565 flow [2024-06-27 22:36:15,262 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-06-27 22:36:15,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:15,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:15,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:36:15,262 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-06-27 22:36:15,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1032433141, now seen corresponding path program 12 times [2024-06-27 22:36:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490658006] [2024-06-27 22:36:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:16,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-06-27 22:36:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490658006] [2024-06-27 22:36:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490658006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:16,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:16,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965113108] [2024-06-27 22:36:16,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:16,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:16,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:16,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 313 transitions, 4565 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-06-27 22:36:16,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:16,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:16,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:18,063 INFO L124 PetriNetUnfolderBase]: 2081/4600 cut-off events. [2024-06-27 22:36:18,063 INFO L125 PetriNetUnfolderBase]: For 104669/104707 co-relation queries the response was YES. [2024-06-27 22:36:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21268 conditions, 4600 events. 2081/4600 cut-off events. For 104669/104707 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 38941 event pairs, 954 based on Foata normal form. 11/4253 useless extension candidates. Maximal degree in co-relation 21130. Up to 3018 conditions per place. [2024-06-27 22:36:18,115 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 148 selfloop transitions, 189 changer transitions 0/349 dead transitions. [2024-06-27 22:36:18,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 349 transitions, 5431 flow [2024-06-27 22:36:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 22:36:18,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2024-06-27 22:36:18,116 INFO L175 Difference]: Start difference. First operand has 292 places, 313 transitions, 4565 flow. Second operand 10 states and 187 transitions. [2024-06-27 22:36:18,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 349 transitions, 5431 flow [2024-06-27 22:36:18,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 349 transitions, 5055 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:18,542 INFO L231 Difference]: Finished difference. Result has 294 places, 313 transitions, 4570 flow [2024-06-27 22:36:18,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4189, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4570, PETRI_PLACES=294, PETRI_TRANSITIONS=313} [2024-06-27 22:36:18,542 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 254 predicate places. [2024-06-27 22:36:18,542 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 313 transitions, 4570 flow [2024-06-27 22:36:18,543 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-06-27 22:36:18,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:18,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:18,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:36:18,543 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:18,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1209806895, now seen corresponding path program 1 times [2024-06-27 22:36:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120971124] [2024-06-27 22:36:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120971124] [2024-06-27 22:36:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120971124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480718353] [2024-06-27 22:36:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:20,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:20,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:20,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:20,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 313 transitions, 4570 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-06-27 22:36:20,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:20,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:20,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:22,537 INFO L124 PetriNetUnfolderBase]: 2404/5042 cut-off events. [2024-06-27 22:36:22,537 INFO L125 PetriNetUnfolderBase]: For 82374/82376 co-relation queries the response was YES. [2024-06-27 22:36:22,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23488 conditions, 5042 events. 2404/5042 cut-off events. For 82374/82376 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 40943 event pairs, 1049 based on Foata normal form. 4/4712 useless extension candidates. Maximal degree in co-relation 23349. Up to 3953 conditions per place. [2024-06-27 22:36:22,588 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 204 selfloop transitions, 136 changer transitions 0/348 dead transitions. [2024-06-27 22:36:22,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 348 transitions, 5419 flow [2024-06-27 22:36:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:36:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:36:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 209 transitions. [2024-06-27 22:36:22,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4465811965811966 [2024-06-27 22:36:22,590 INFO L175 Difference]: Start difference. First operand has 294 places, 313 transitions, 4570 flow. Second operand 13 states and 209 transitions. [2024-06-27 22:36:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 348 transitions, 5419 flow [2024-06-27 22:36:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 348 transitions, 5042 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:23,131 INFO L231 Difference]: Finished difference. Result has 299 places, 315 transitions, 4497 flow [2024-06-27 22:36:23,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4193, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4497, PETRI_PLACES=299, PETRI_TRANSITIONS=315} [2024-06-27 22:36:23,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 259 predicate places. [2024-06-27 22:36:23,132 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 315 transitions, 4497 flow [2024-06-27 22:36:23,132 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-06-27 22:36:23,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:23,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:23,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:36:23,132 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:23,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117343, now seen corresponding path program 2 times [2024-06-27 22:36:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292709438] [2024-06-27 22:36:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:25,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292709438] [2024-06-27 22:36:25,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292709438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:25,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:25,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:25,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537511563] [2024-06-27 22:36:25,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:25,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:25,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:25,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:25,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:25,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 315 transitions, 4497 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-06-27 22:36:25,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:25,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:25,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:26,932 INFO L124 PetriNetUnfolderBase]: 2433/5085 cut-off events. [2024-06-27 22:36:26,932 INFO L125 PetriNetUnfolderBase]: For 93979/93981 co-relation queries the response was YES. [2024-06-27 22:36:26,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24030 conditions, 5085 events. 2433/5085 cut-off events. For 93979/93981 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41315 event pairs, 1026 based on Foata normal form. 4/4756 useless extension candidates. Maximal degree in co-relation 23890. Up to 3913 conditions per place. [2024-06-27 22:36:26,985 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 206 selfloop transitions, 143 changer transitions 0/357 dead transitions. [2024-06-27 22:36:26,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 357 transitions, 5606 flow [2024-06-27 22:36:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:36:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:36:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2024-06-27 22:36:26,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452991452991453 [2024-06-27 22:36:26,986 INFO L175 Difference]: Start difference. First operand has 299 places, 315 transitions, 4497 flow. Second operand 13 states and 212 transitions. [2024-06-27 22:36:26,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 357 transitions, 5606 flow [2024-06-27 22:36:27,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 357 transitions, 5320 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-27 22:36:27,496 INFO L231 Difference]: Finished difference. Result has 302 places, 322 transitions, 4598 flow [2024-06-27 22:36:27,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4211, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4598, PETRI_PLACES=302, PETRI_TRANSITIONS=322} [2024-06-27 22:36:27,496 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 262 predicate places. [2024-06-27 22:36:27,496 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 322 transitions, 4598 flow [2024-06-27 22:36:27,497 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-06-27 22:36:27,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:27,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:27,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:36:27,497 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:27,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1035717149, now seen corresponding path program 13 times [2024-06-27 22:36:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37218747] [2024-06-27 22:36:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37218747] [2024-06-27 22:36:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37218747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586171667] [2024-06-27 22:36:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:29,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:29,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:29,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 322 transitions, 4598 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:29,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:29,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:30,924 INFO L124 PetriNetUnfolderBase]: 2183/4869 cut-off events. [2024-06-27 22:36:30,924 INFO L125 PetriNetUnfolderBase]: For 131929/131969 co-relation queries the response was YES. [2024-06-27 22:36:30,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22925 conditions, 4869 events. 2183/4869 cut-off events. For 131929/131969 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 41982 event pairs, 1115 based on Foata normal form. 11/4496 useless extension candidates. Maximal degree in co-relation 22783. Up to 3555 conditions per place. [2024-06-27 22:36:30,978 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 180 selfloop transitions, 157 changer transitions 0/349 dead transitions. [2024-06-27 22:36:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 349 transitions, 5422 flow [2024-06-27 22:36:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 22:36:30,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:36:30,979 INFO L175 Difference]: Start difference. First operand has 302 places, 322 transitions, 4598 flow. Second operand 10 states and 176 transitions. [2024-06-27 22:36:30,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 349 transitions, 5422 flow [2024-06-27 22:36:31,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 349 transitions, 5218 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-27 22:36:31,559 INFO L231 Difference]: Finished difference. Result has 303 places, 322 transitions, 4714 flow [2024-06-27 22:36:31,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4396, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4714, PETRI_PLACES=303, PETRI_TRANSITIONS=322} [2024-06-27 22:36:31,559 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 263 predicate places. [2024-06-27 22:36:31,559 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 322 transitions, 4714 flow [2024-06-27 22:36:31,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:31,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:31,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:31,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:36:31,560 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:31,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2097679881, now seen corresponding path program 14 times [2024-06-27 22:36:31,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:31,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664834808] [2024-06-27 22:36:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:31,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:33,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-06-27 22:36:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664834808] [2024-06-27 22:36:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664834808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315897691] [2024-06-27 22:36:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:33,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:33,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:33,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 322 transitions, 4714 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-06-27 22:36:33,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:34,836 INFO L124 PetriNetUnfolderBase]: 2229/5017 cut-off events. [2024-06-27 22:36:34,836 INFO L125 PetriNetUnfolderBase]: For 124918/124959 co-relation queries the response was YES. [2024-06-27 22:36:34,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23545 conditions, 5017 events. 2229/5017 cut-off events. For 124918/124959 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 43664 event pairs, 1133 based on Foata normal form. 9/4632 useless extension candidates. Maximal degree in co-relation 23401. Up to 3375 conditions per place. [2024-06-27 22:36:34,896 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 186 selfloop transitions, 157 changer transitions 0/355 dead transitions. [2024-06-27 22:36:34,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 355 transitions, 5588 flow [2024-06-27 22:36:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 22:36:34,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2024-06-27 22:36:34,900 INFO L175 Difference]: Start difference. First operand has 303 places, 322 transitions, 4714 flow. Second operand 10 states and 181 transitions. [2024-06-27 22:36:34,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 355 transitions, 5588 flow [2024-06-27 22:36:35,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 355 transitions, 5272 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:35,571 INFO L231 Difference]: Finished difference. Result has 305 places, 322 transitions, 4715 flow [2024-06-27 22:36:35,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4398, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4715, PETRI_PLACES=305, PETRI_TRANSITIONS=322} [2024-06-27 22:36:35,572 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 265 predicate places. [2024-06-27 22:36:35,572 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 322 transitions, 4715 flow [2024-06-27 22:36:35,572 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-06-27 22:36:35,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:35,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:36:35,573 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:35,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2031053635, now seen corresponding path program 15 times [2024-06-27 22:36:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:35,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227036374] [2024-06-27 22:36:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:37,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:37,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227036374] [2024-06-27 22:36:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227036374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:37,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:37,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871483404] [2024-06-27 22:36:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:37,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:37,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:37,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 322 transitions, 4715 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:37,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:37,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:37,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:38,878 INFO L124 PetriNetUnfolderBase]: 2387/5361 cut-off events. [2024-06-27 22:36:38,878 INFO L125 PetriNetUnfolderBase]: For 176227/176271 co-relation queries the response was YES. [2024-06-27 22:36:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25935 conditions, 5361 events. 2387/5361 cut-off events. For 176227/176271 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 47578 event pairs, 1176 based on Foata normal form. 11/4961 useless extension candidates. Maximal degree in co-relation 25790. Up to 3668 conditions per place. [2024-06-27 22:36:38,944 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 200 selfloop transitions, 142 changer transitions 0/354 dead transitions. [2024-06-27 22:36:38,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 354 transitions, 5765 flow [2024-06-27 22:36:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:36:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:36:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-06-27 22:36:38,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-27 22:36:38,945 INFO L175 Difference]: Start difference. First operand has 305 places, 322 transitions, 4715 flow. Second operand 11 states and 192 transitions. [2024-06-27 22:36:38,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 354 transitions, 5765 flow [2024-06-27 22:36:39,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 354 transitions, 5452 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:39,821 INFO L231 Difference]: Finished difference. Result has 308 places, 322 transitions, 4689 flow [2024-06-27 22:36:39,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4402, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4689, PETRI_PLACES=308, PETRI_TRANSITIONS=322} [2024-06-27 22:36:39,821 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 268 predicate places. [2024-06-27 22:36:39,822 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 322 transitions, 4689 flow [2024-06-27 22:36:39,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:39,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:39,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:39,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:36:39,822 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:39,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -577278157, now seen corresponding path program 3 times [2024-06-27 22:36:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605520425] [2024-06-27 22:36:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605520425] [2024-06-27 22:36:41,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605520425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:41,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:41,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079215143] [2024-06-27 22:36:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:41,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:41,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:41,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 322 transitions, 4689 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-06-27 22:36:41,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:41,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:43,313 INFO L124 PetriNetUnfolderBase]: 2697/5723 cut-off events. [2024-06-27 22:36:43,313 INFO L125 PetriNetUnfolderBase]: For 142498/142500 co-relation queries the response was YES. [2024-06-27 22:36:43,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27620 conditions, 5723 events. 2697/5723 cut-off events. For 142498/142500 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 48414 event pairs, 1241 based on Foata normal form. 4/5353 useless extension candidates. Maximal degree in co-relation 27474. Up to 4526 conditions per place. [2024-06-27 22:36:43,374 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 212 selfloop transitions, 134 changer transitions 0/354 dead transitions. [2024-06-27 22:36:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 354 transitions, 5539 flow [2024-06-27 22:36:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:36:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:36:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-27 22:36:43,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-27 22:36:43,376 INFO L175 Difference]: Start difference. First operand has 308 places, 322 transitions, 4689 flow. Second operand 11 states and 185 transitions. [2024-06-27 22:36:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 354 transitions, 5539 flow [2024-06-27 22:36:44,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 354 transitions, 5254 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 22:36:44,072 INFO L231 Difference]: Finished difference. Result has 310 places, 323 transitions, 4698 flow [2024-06-27 22:36:44,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4404, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4698, PETRI_PLACES=310, PETRI_TRANSITIONS=323} [2024-06-27 22:36:44,073 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 270 predicate places. [2024-06-27 22:36:44,073 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 323 transitions, 4698 flow [2024-06-27 22:36:44,073 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-06-27 22:36:44,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:44,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:44,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:36:44,073 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:44,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1258442299, now seen corresponding path program 16 times [2024-06-27 22:36:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918956181] [2024-06-27 22:36:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918956181] [2024-06-27 22:36:46,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918956181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:46,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:46,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:36:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135765872] [2024-06-27 22:36:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:46,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:36:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:36:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:36:46,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:36:46,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 323 transitions, 4698 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:46,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:46,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:36:46,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:47,809 INFO L124 PetriNetUnfolderBase]: 2375/5351 cut-off events. [2024-06-27 22:36:47,809 INFO L125 PetriNetUnfolderBase]: For 133354/133397 co-relation queries the response was YES. [2024-06-27 22:36:47,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24751 conditions, 5351 events. 2375/5351 cut-off events. For 133354/133397 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47633 event pairs, 1220 based on Foata normal form. 13/4946 useless extension candidates. Maximal degree in co-relation 24604. Up to 3953 conditions per place. [2024-06-27 22:36:47,863 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 194 selfloop transitions, 142 changer transitions 0/348 dead transitions. [2024-06-27 22:36:47,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 348 transitions, 5498 flow [2024-06-27 22:36:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:36:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:36:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-27 22:36:47,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-27 22:36:47,865 INFO L175 Difference]: Start difference. First operand has 310 places, 323 transitions, 4698 flow. Second operand 11 states and 186 transitions. [2024-06-27 22:36:47,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 348 transitions, 5498 flow [2024-06-27 22:36:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 348 transitions, 5220 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-27 22:36:48,547 INFO L231 Difference]: Finished difference. Result has 312 places, 323 transitions, 4708 flow [2024-06-27 22:36:48,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4420, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4708, PETRI_PLACES=312, PETRI_TRANSITIONS=323} [2024-06-27 22:36:48,547 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 272 predicate places. [2024-06-27 22:36:48,548 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 323 transitions, 4708 flow [2024-06-27 22:36:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:48,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:48,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:48,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:36:48,548 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:48,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1035897073, now seen corresponding path program 4 times [2024-06-27 22:36:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962509301] [2024-06-27 22:36:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962509301] [2024-06-27 22:36:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962509301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338523332] [2024-06-27 22:36:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:50,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:50,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:50,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 323 transitions, 4708 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-06-27 22:36:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:50,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:50,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:51,755 INFO L124 PetriNetUnfolderBase]: 2701/5736 cut-off events. [2024-06-27 22:36:51,755 INFO L125 PetriNetUnfolderBase]: For 97301/97302 co-relation queries the response was YES. [2024-06-27 22:36:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26797 conditions, 5736 events. 2701/5736 cut-off events. For 97301/97302 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 48581 event pairs, 1236 based on Foata normal form. 3/5357 useless extension candidates. Maximal degree in co-relation 26649. Up to 4534 conditions per place. [2024-06-27 22:36:51,823 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 205 selfloop transitions, 141 changer transitions 0/354 dead transitions. [2024-06-27 22:36:51,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 354 transitions, 5557 flow [2024-06-27 22:36:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:36:51,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:36:51,825 INFO L175 Difference]: Start difference. First operand has 312 places, 323 transitions, 4708 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:36:51,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 354 transitions, 5557 flow [2024-06-27 22:36:52,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 354 transitions, 5275 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:36:52,582 INFO L231 Difference]: Finished difference. Result has 313 places, 324 transitions, 4735 flow [2024-06-27 22:36:52,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4426, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4735, PETRI_PLACES=313, PETRI_TRANSITIONS=324} [2024-06-27 22:36:52,582 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 273 predicate places. [2024-06-27 22:36:52,582 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 324 transitions, 4735 flow [2024-06-27 22:36:52,583 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-06-27 22:36:52,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:52,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:36:52,583 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:52,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1958008535, now seen corresponding path program 5 times [2024-06-27 22:36:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:52,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101914256] [2024-06-27 22:36:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101914256] [2024-06-27 22:36:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101914256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718917730] [2024-06-27 22:36:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:54,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:54,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:54,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 324 transitions, 4735 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-06-27 22:36:54,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:54,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:54,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:56,257 INFO L124 PetriNetUnfolderBase]: 2725/5804 cut-off events. [2024-06-27 22:36:56,257 INFO L125 PetriNetUnfolderBase]: For 99387/99387 co-relation queries the response was YES. [2024-06-27 22:36:56,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27185 conditions, 5804 events. 2725/5804 cut-off events. For 99387/99387 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 49484 event pairs, 1836 based on Foata normal form. 2/5430 useless extension candidates. Maximal degree in co-relation 27036. Up to 4679 conditions per place. [2024-06-27 22:36:56,326 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 223 selfloop transitions, 124 changer transitions 0/355 dead transitions. [2024-06-27 22:36:56,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 355 transitions, 5648 flow [2024-06-27 22:36:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:36:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:36:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2024-06-27 22:36:56,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252136752136752 [2024-06-27 22:36:56,327 INFO L175 Difference]: Start difference. First operand has 313 places, 324 transitions, 4735 flow. Second operand 13 states and 199 transitions. [2024-06-27 22:36:56,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 355 transitions, 5648 flow [2024-06-27 22:36:57,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 355 transitions, 5347 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:57,018 INFO L231 Difference]: Finished difference. Result has 318 places, 326 transitions, 4735 flow [2024-06-27 22:36:57,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4446, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4735, PETRI_PLACES=318, PETRI_TRANSITIONS=326} [2024-06-27 22:36:57,018 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 278 predicate places. [2024-06-27 22:36:57,018 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 326 transitions, 4735 flow [2024-06-27 22:36:57,019 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-06-27 22:36:57,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:57,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:57,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:36:57,019 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:57,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1958016905, now seen corresponding path program 6 times [2024-06-27 22:36:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413946919] [2024-06-27 22:36:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413946919] [2024-06-27 22:36:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413946919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:58,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485506747] [2024-06-27 22:36:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:58,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:58,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:36:58,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 326 transitions, 4735 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-06-27 22:36:58,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:58,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:36:58,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:00,461 INFO L124 PetriNetUnfolderBase]: 2780/5933 cut-off events. [2024-06-27 22:37:00,461 INFO L125 PetriNetUnfolderBase]: For 112743/112743 co-relation queries the response was YES. [2024-06-27 22:37:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27970 conditions, 5933 events. 2780/5933 cut-off events. For 112743/112743 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50863 event pairs, 1827 based on Foata normal form. 2/5556 useless extension candidates. Maximal degree in co-relation 27820. Up to 4619 conditions per place. [2024-06-27 22:37:00,529 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 226 selfloop transitions, 134 changer transitions 0/368 dead transitions. [2024-06-27 22:37:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 368 transitions, 5945 flow [2024-06-27 22:37:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:37:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:37:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2024-06-27 22:37:00,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4337606837606838 [2024-06-27 22:37:00,530 INFO L175 Difference]: Start difference. First operand has 318 places, 326 transitions, 4735 flow. Second operand 13 states and 203 transitions. [2024-06-27 22:37:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 368 transitions, 5945 flow [2024-06-27 22:37:01,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 368 transitions, 5691 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-27 22:37:01,250 INFO L231 Difference]: Finished difference. Result has 321 places, 333 transitions, 4872 flow [2024-06-27 22:37:01,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4481, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4872, PETRI_PLACES=321, PETRI_TRANSITIONS=333} [2024-06-27 22:37:01,250 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 281 predicate places. [2024-06-27 22:37:01,250 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 333 transitions, 4872 flow [2024-06-27 22:37:01,250 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-06-27 22:37:01,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:01,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:01,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:37:01,251 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:01,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1785288005, now seen corresponding path program 7 times [2024-06-27 22:37:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855570454] [2024-06-27 22:37:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:02,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855570454] [2024-06-27 22:37:02,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855570454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315138714] [2024-06-27 22:37:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:37:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:02,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:37:02,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:37:02,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:02,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 333 transitions, 4872 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-06-27 22:37:02,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:02,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:02,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:04,258 INFO L124 PetriNetUnfolderBase]: 2808/6001 cut-off events. [2024-06-27 22:37:04,258 INFO L125 PetriNetUnfolderBase]: For 116144/116144 co-relation queries the response was YES. [2024-06-27 22:37:04,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28544 conditions, 6001 events. 2808/6001 cut-off events. For 116144/116144 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 51625 event pairs, 1867 based on Foata normal form. 2/5612 useless extension candidates. Maximal degree in co-relation 28392. Up to 4830 conditions per place. [2024-06-27 22:37:04,332 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 217 selfloop transitions, 134 changer transitions 0/359 dead transitions. [2024-06-27 22:37:04,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 359 transitions, 5762 flow [2024-06-27 22:37:04,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:37:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:37:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 22:37:04,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-06-27 22:37:04,333 INFO L175 Difference]: Start difference. First operand has 321 places, 333 transitions, 4872 flow. Second operand 9 states and 151 transitions. [2024-06-27 22:37:04,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 359 transitions, 5762 flow [2024-06-27 22:37:05,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 359 transitions, 5592 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:05,246 INFO L231 Difference]: Finished difference. Result has 321 places, 335 transitions, 5019 flow [2024-06-27 22:37:05,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4702, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5019, PETRI_PLACES=321, PETRI_TRANSITIONS=335} [2024-06-27 22:37:05,247 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 281 predicate places. [2024-06-27 22:37:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 335 transitions, 5019 flow [2024-06-27 22:37:05,247 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-06-27 22:37:05,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:05,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:05,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:37:05,247 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:05,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 767617953, now seen corresponding path program 8 times [2024-06-27 22:37:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471603370] [2024-06-27 22:37:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:07,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471603370] [2024-06-27 22:37:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471603370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:37:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382345416] [2024-06-27 22:37:07,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:07,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:37:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:07,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:37:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:37:07,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:07,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 335 transitions, 5019 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:07,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:07,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:07,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:08,678 INFO L124 PetriNetUnfolderBase]: 2805/5996 cut-off events. [2024-06-27 22:37:08,678 INFO L125 PetriNetUnfolderBase]: For 106195/106195 co-relation queries the response was YES. [2024-06-27 22:37:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28502 conditions, 5996 events. 2805/5996 cut-off events. For 106195/106195 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 51627 event pairs, 1867 based on Foata normal form. 2/5607 useless extension candidates. Maximal degree in co-relation 28348. Up to 4823 conditions per place. [2024-06-27 22:37:08,756 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 233 selfloop transitions, 122 changer transitions 0/363 dead transitions. [2024-06-27 22:37:08,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 363 transitions, 5926 flow [2024-06-27 22:37:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 22:37:08,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-27 22:37:08,757 INFO L175 Difference]: Start difference. First operand has 321 places, 335 transitions, 5019 flow. Second operand 11 states and 174 transitions. [2024-06-27 22:37:08,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 363 transitions, 5926 flow [2024-06-27 22:37:09,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 363 transitions, 5639 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:37:09,564 INFO L231 Difference]: Finished difference. Result has 325 places, 336 transitions, 5010 flow [2024-06-27 22:37:09,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4736, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5010, PETRI_PLACES=325, PETRI_TRANSITIONS=336} [2024-06-27 22:37:09,565 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 285 predicate places. [2024-06-27 22:37:09,565 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 336 transitions, 5010 flow [2024-06-27 22:37:09,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:09,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:09,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:09,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:37:09,566 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:09,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -84873525, now seen corresponding path program 9 times [2024-06-27 22:37:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275339786] [2024-06-27 22:37:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275339786] [2024-06-27 22:37:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275339786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126308880] [2024-06-27 22:37:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:11,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:11,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:11,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 336 transitions, 5010 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-06-27 22:37:11,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:11,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:12,810 INFO L124 PetriNetUnfolderBase]: 2842/6069 cut-off events. [2024-06-27 22:37:12,810 INFO L125 PetriNetUnfolderBase]: For 119794/119794 co-relation queries the response was YES. [2024-06-27 22:37:12,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29132 conditions, 6069 events. 2842/6069 cut-off events. For 119794/119794 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 52324 event pairs, 1898 based on Foata normal form. 2/5674 useless extension candidates. Maximal degree in co-relation 28977. Up to 5082 conditions per place. [2024-06-27 22:37:12,884 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 326 selfloop transitions, 30 changer transitions 0/364 dead transitions. [2024-06-27 22:37:12,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 364 transitions, 6109 flow [2024-06-27 22:37:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:37:12,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-27 22:37:12,886 INFO L175 Difference]: Start difference. First operand has 325 places, 336 transitions, 5010 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:37:12,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 364 transitions, 6109 flow [2024-06-27 22:37:13,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 364 transitions, 5868 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:13,813 INFO L231 Difference]: Finished difference. Result has 327 places, 338 transitions, 4891 flow [2024-06-27 22:37:13,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4769, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4891, PETRI_PLACES=327, PETRI_TRANSITIONS=338} [2024-06-27 22:37:13,813 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 287 predicate places. [2024-06-27 22:37:13,813 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 338 transitions, 4891 flow [2024-06-27 22:37:13,813 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-06-27 22:37:13,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:13,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:37:13,813 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:13,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 156079805, now seen corresponding path program 10 times [2024-06-27 22:37:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877370757] [2024-06-27 22:37:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877370757] [2024-06-27 22:37:15,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877370757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:15,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027632498] [2024-06-27 22:37:15,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:15,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:15,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:15,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 338 transitions, 4891 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-06-27 22:37:15,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:15,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:15,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:17,383 INFO L124 PetriNetUnfolderBase]: 2930/6302 cut-off events. [2024-06-27 22:37:17,383 INFO L125 PetriNetUnfolderBase]: For 179641/179641 co-relation queries the response was YES. [2024-06-27 22:37:17,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29874 conditions, 6302 events. 2930/6302 cut-off events. For 179641/179641 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 54976 event pairs, 1930 based on Foata normal form. 12/5903 useless extension candidates. Maximal degree in co-relation 29718. Up to 5090 conditions per place. [2024-06-27 22:37:17,455 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 314 selfloop transitions, 52 changer transitions 0/374 dead transitions. [2024-06-27 22:37:17,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 374 transitions, 5901 flow [2024-06-27 22:37:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:37:17,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-27 22:37:17,457 INFO L175 Difference]: Start difference. First operand has 327 places, 338 transitions, 4891 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:37:17,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 374 transitions, 5901 flow [2024-06-27 22:37:18,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 374 transitions, 5843 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:37:18,267 INFO L231 Difference]: Finished difference. Result has 331 places, 338 transitions, 4944 flow [2024-06-27 22:37:18,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4833, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4944, PETRI_PLACES=331, PETRI_TRANSITIONS=338} [2024-06-27 22:37:18,267 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 291 predicate places. [2024-06-27 22:37:18,267 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 338 transitions, 4944 flow [2024-06-27 22:37:18,268 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-06-27 22:37:18,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:18,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:18,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 22:37:18,268 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:18,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1918609099, now seen corresponding path program 11 times [2024-06-27 22:37:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956552400] [2024-06-27 22:37:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:20,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956552400] [2024-06-27 22:37:20,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956552400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951948245] [2024-06-27 22:37:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:20,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:37:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:37:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:37:20,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:20,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 338 transitions, 4944 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-06-27 22:37:20,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:20,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:20,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:21,851 INFO L124 PetriNetUnfolderBase]: 2947/6319 cut-off events. [2024-06-27 22:37:21,852 INFO L125 PetriNetUnfolderBase]: For 124607/124607 co-relation queries the response was YES. [2024-06-27 22:37:21,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30094 conditions, 6319 events. 2947/6319 cut-off events. For 124607/124607 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 55083 event pairs, 1940 based on Foata normal form. 2/5904 useless extension candidates. Maximal degree in co-relation 29936. Up to 5311 conditions per place. [2024-06-27 22:37:21,929 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 307 selfloop transitions, 47 changer transitions 0/362 dead transitions. [2024-06-27 22:37:21,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 362 transitions, 5811 flow [2024-06-27 22:37:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2024-06-27 22:37:21,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 22:37:21,930 INFO L175 Difference]: Start difference. First operand has 331 places, 338 transitions, 4944 flow. Second operand 11 states and 165 transitions. [2024-06-27 22:37:21,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 362 transitions, 5811 flow [2024-06-27 22:37:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 362 transitions, 5712 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:22,723 INFO L231 Difference]: Finished difference. Result has 333 places, 339 transitions, 4977 flow [2024-06-27 22:37:22,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4845, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4977, PETRI_PLACES=333, PETRI_TRANSITIONS=339} [2024-06-27 22:37:22,724 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 293 predicate places. [2024-06-27 22:37:22,724 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 339 transitions, 4977 flow [2024-06-27 22:37:22,724 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-06-27 22:37:22,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:22,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:22,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 22:37:22,724 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:22,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1842866309, now seen corresponding path program 12 times [2024-06-27 22:37:22,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:22,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621676287] [2024-06-27 22:37:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621676287] [2024-06-27 22:37:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621676287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:24,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120205459] [2024-06-27 22:37:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:24,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:24,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:24,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:24,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 339 transitions, 4977 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-06-27 22:37:24,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:24,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:24,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:25,998 INFO L124 PetriNetUnfolderBase]: 2944/6316 cut-off events. [2024-06-27 22:37:25,999 INFO L125 PetriNetUnfolderBase]: For 114925/114925 co-relation queries the response was YES. [2024-06-27 22:37:26,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29916 conditions, 6316 events. 2944/6316 cut-off events. For 114925/114925 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 55064 event pairs, 1959 based on Foata normal form. 2/5901 useless extension candidates. Maximal degree in co-relation 29757. Up to 5341 conditions per place. [2024-06-27 22:37:26,076 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 320 selfloop transitions, 33 changer transitions 0/361 dead transitions. [2024-06-27 22:37:26,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 361 transitions, 5789 flow [2024-06-27 22:37:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:37:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:37:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 22:37:26,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-27 22:37:26,077 INFO L175 Difference]: Start difference. First operand has 333 places, 339 transitions, 4977 flow. Second operand 10 states and 152 transitions. [2024-06-27 22:37:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 361 transitions, 5789 flow [2024-06-27 22:37:26,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 361 transitions, 5667 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:26,860 INFO L231 Difference]: Finished difference. Result has 334 places, 339 transitions, 4928 flow [2024-06-27 22:37:26,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4855, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4928, PETRI_PLACES=334, PETRI_TRANSITIONS=339} [2024-06-27 22:37:26,861 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 294 predicate places. [2024-06-27 22:37:26,861 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 339 transitions, 4928 flow [2024-06-27 22:37:26,861 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-06-27 22:37:26,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:26,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:26,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 22:37:26,861 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:26,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1912352989, now seen corresponding path program 13 times [2024-06-27 22:37:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337800941] [2024-06-27 22:37:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337800941] [2024-06-27 22:37:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337800941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:28,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:28,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16166089] [2024-06-27 22:37:28,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:28,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:28,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:28,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 339 transitions, 4928 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-06-27 22:37:28,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:28,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:30,285 INFO L124 PetriNetUnfolderBase]: 2961/6356 cut-off events. [2024-06-27 22:37:30,285 INFO L125 PetriNetUnfolderBase]: For 115964/115964 co-relation queries the response was YES. [2024-06-27 22:37:30,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29992 conditions, 6356 events. 2961/6356 cut-off events. For 115964/115964 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 55537 event pairs, 1958 based on Foata normal form. 2/5941 useless extension candidates. Maximal degree in co-relation 29832. Up to 5337 conditions per place. [2024-06-27 22:37:30,363 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 306 selfloop transitions, 51 changer transitions 0/365 dead transitions. [2024-06-27 22:37:30,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 365 transitions, 5825 flow [2024-06-27 22:37:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-27 22:37:30,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-27 22:37:30,364 INFO L175 Difference]: Start difference. First operand has 334 places, 339 transitions, 4928 flow. Second operand 11 states and 164 transitions. [2024-06-27 22:37:30,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 365 transitions, 5825 flow [2024-06-27 22:37:31,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 365 transitions, 5755 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:31,131 INFO L231 Difference]: Finished difference. Result has 336 places, 340 transitions, 5000 flow [2024-06-27 22:37:31,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4858, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5000, PETRI_PLACES=336, PETRI_TRANSITIONS=340} [2024-06-27 22:37:31,132 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 296 predicate places. [2024-06-27 22:37:31,132 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 340 transitions, 5000 flow [2024-06-27 22:37:31,132 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-06-27 22:37:31,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:31,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:31,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 22:37:31,133 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:31,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1032851201, now seen corresponding path program 17 times [2024-06-27 22:37:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:31,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933133292] [2024-06-27 22:37:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933133292] [2024-06-27 22:37:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933133292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:32,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:37:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318606130] [2024-06-27 22:37:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:32,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:37:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:37:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:37:33,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:33,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 340 transitions, 5000 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:33,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:33,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:33,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:34,946 INFO L124 PetriNetUnfolderBase]: 3099/6677 cut-off events. [2024-06-27 22:37:34,946 INFO L125 PetriNetUnfolderBase]: For 216803/216803 co-relation queries the response was YES. [2024-06-27 22:37:35,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32336 conditions, 6677 events. 3099/6677 cut-off events. For 216803/216803 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 59022 event pairs, 2008 based on Foata normal form. 8/6256 useless extension candidates. Maximal degree in co-relation 32175. Up to 5353 conditions per place. [2024-06-27 22:37:35,025 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 334 selfloop transitions, 35 changer transitions 0/377 dead transitions. [2024-06-27 22:37:35,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 377 transitions, 6199 flow [2024-06-27 22:37:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:37:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:37:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-27 22:37:35,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43287037037037035 [2024-06-27 22:37:35,026 INFO L175 Difference]: Start difference. First operand has 336 places, 340 transitions, 5000 flow. Second operand 12 states and 187 transitions. [2024-06-27 22:37:35,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 377 transitions, 6199 flow [2024-06-27 22:37:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 377 transitions, 6079 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:36,062 INFO L231 Difference]: Finished difference. Result has 339 places, 340 transitions, 4953 flow [2024-06-27 22:37:36,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4880, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4953, PETRI_PLACES=339, PETRI_TRANSITIONS=340} [2024-06-27 22:37:36,062 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 299 predicate places. [2024-06-27 22:37:36,062 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 340 transitions, 4953 flow [2024-06-27 22:37:36,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:36,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:36,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:36,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 22:37:36,063 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:36,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1032855851, now seen corresponding path program 18 times [2024-06-27 22:37:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871079519] [2024-06-27 22:37:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:37,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871079519] [2024-06-27 22:37:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871079519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:37,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220375282] [2024-06-27 22:37:37,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:37,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:37,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:37,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 340 transitions, 4953 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-06-27 22:37:37,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:37,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:39,528 INFO L124 PetriNetUnfolderBase]: 3086/6670 cut-off events. [2024-06-27 22:37:39,528 INFO L125 PetriNetUnfolderBase]: For 169149/169149 co-relation queries the response was YES. [2024-06-27 22:37:39,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30992 conditions, 6670 events. 3086/6670 cut-off events. For 169149/169149 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 59074 event pairs, 2051 based on Foata normal form. 10/6244 useless extension candidates. Maximal degree in co-relation 30830. Up to 5488 conditions per place. [2024-06-27 22:37:39,613 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 324 selfloop transitions, 38 changer transitions 0/370 dead transitions. [2024-06-27 22:37:39,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 370 transitions, 5872 flow [2024-06-27 22:37:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 22:37:39,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-27 22:37:39,614 INFO L175 Difference]: Start difference. First operand has 339 places, 340 transitions, 4953 flow. Second operand 11 states and 172 transitions. [2024-06-27 22:37:39,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 370 transitions, 5872 flow [2024-06-27 22:37:40,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 370 transitions, 5803 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:37:40,541 INFO L231 Difference]: Finished difference. Result has 340 places, 340 transitions, 4964 flow [2024-06-27 22:37:40,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4884, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4964, PETRI_PLACES=340, PETRI_TRANSITIONS=340} [2024-06-27 22:37:40,541 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 300 predicate places. [2024-06-27 22:37:40,541 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 340 transitions, 4964 flow [2024-06-27 22:37:40,541 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-06-27 22:37:40,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:40,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:40,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 22:37:40,542 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:40,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1039522525, now seen corresponding path program 14 times [2024-06-27 22:37:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840053212] [2024-06-27 22:37:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840053212] [2024-06-27 22:37:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840053212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062970408] [2024-06-27 22:37:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:42,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:42,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 340 transitions, 4964 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-06-27 22:37:42,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:42,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:42,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:44,392 INFO L124 PetriNetUnfolderBase]: 3103/6694 cut-off events. [2024-06-27 22:37:44,393 INFO L125 PetriNetUnfolderBase]: For 122857/122857 co-relation queries the response was YES. [2024-06-27 22:37:44,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31317 conditions, 6694 events. 3103/6694 cut-off events. For 122857/122857 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 59361 event pairs, 2043 based on Foata normal form. 2/6259 useless extension candidates. Maximal degree in co-relation 31154. Up to 5613 conditions per place. [2024-06-27 22:37:44,472 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 310 selfloop transitions, 53 changer transitions 0/371 dead transitions. [2024-06-27 22:37:44,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 371 transitions, 5922 flow [2024-06-27 22:37:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:37:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:37:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2024-06-27 22:37:44,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-06-27 22:37:44,473 INFO L175 Difference]: Start difference. First operand has 340 places, 340 transitions, 4964 flow. Second operand 13 states and 192 transitions. [2024-06-27 22:37:44,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 371 transitions, 5922 flow [2024-06-27 22:37:45,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 371 transitions, 5848 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:45,339 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 5038 flow [2024-06-27 22:37:45,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4890, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5038, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2024-06-27 22:37:45,339 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 304 predicate places. [2024-06-27 22:37:45,340 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 5038 flow [2024-06-27 22:37:45,340 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-06-27 22:37:45,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:45,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:45,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 22:37:45,340 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:45,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1831844879, now seen corresponding path program 15 times [2024-06-27 22:37:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445150736] [2024-06-27 22:37:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:46,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:46,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445150736] [2024-06-27 22:37:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445150736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825658041] [2024-06-27 22:37:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:46,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:46,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:46,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 5038 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-06-27 22:37:46,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:46,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:46,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:48,397 INFO L124 PetriNetUnfolderBase]: 3120/6720 cut-off events. [2024-06-27 22:37:48,397 INFO L125 PetriNetUnfolderBase]: For 126959/126959 co-relation queries the response was YES. [2024-06-27 22:37:48,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31744 conditions, 6720 events. 3120/6720 cut-off events. For 126959/126959 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 59497 event pairs, 2059 based on Foata normal form. 2/6317 useless extension candidates. Maximal degree in co-relation 31580. Up to 5679 conditions per place. [2024-06-27 22:37:48,480 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 343 selfloop transitions, 17 changer transitions 0/368 dead transitions. [2024-06-27 22:37:48,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 368 transitions, 5908 flow [2024-06-27 22:37:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-27 22:37:48,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-27 22:37:48,481 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 5038 flow. Second operand 11 states and 164 transitions. [2024-06-27 22:37:48,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 368 transitions, 5908 flow [2024-06-27 22:37:49,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 368 transitions, 5782 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-27 22:37:49,406 INFO L231 Difference]: Finished difference. Result has 344 places, 342 transitions, 4988 flow [2024-06-27 22:37:49,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4912, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4988, PETRI_PLACES=344, PETRI_TRANSITIONS=342} [2024-06-27 22:37:49,406 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 304 predicate places. [2024-06-27 22:37:49,406 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 342 transitions, 4988 flow [2024-06-27 22:37:49,406 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-06-27 22:37:49,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:49,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 22:37:49,407 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:49,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1039530895, now seen corresponding path program 16 times [2024-06-27 22:37:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337870929] [2024-06-27 22:37:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:51,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-06-27 22:37:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337870929] [2024-06-27 22:37:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337870929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980992784] [2024-06-27 22:37:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:51,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:51,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:51,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 342 transitions, 4988 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-06-27 22:37:51,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:51,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:53,461 INFO L124 PetriNetUnfolderBase]: 3289/7140 cut-off events. [2024-06-27 22:37:53,461 INFO L125 PetriNetUnfolderBase]: For 196531/196531 co-relation queries the response was YES. [2024-06-27 22:37:53,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34389 conditions, 7140 events. 3289/7140 cut-off events. For 196531/196531 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 64218 event pairs, 2119 based on Foata normal form. 2/6681 useless extension candidates. Maximal degree in co-relation 34224. Up to 5563 conditions per place. [2024-06-27 22:37:53,540 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 319 selfloop transitions, 62 changer transitions 0/389 dead transitions. [2024-06-27 22:37:53,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 389 transitions, 6359 flow [2024-06-27 22:37:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:37:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:37:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 214 transitions. [2024-06-27 22:37:53,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-27 22:37:53,544 INFO L175 Difference]: Start difference. First operand has 344 places, 342 transitions, 4988 flow. Second operand 14 states and 214 transitions. [2024-06-27 22:37:53,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 389 transitions, 6359 flow [2024-06-27 22:37:54,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 389 transitions, 6301 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:54,563 INFO L231 Difference]: Finished difference. Result has 351 places, 350 transitions, 5231 flow [2024-06-27 22:37:54,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4930, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5231, PETRI_PLACES=351, PETRI_TRANSITIONS=350} [2024-06-27 22:37:54,563 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 311 predicate places. [2024-06-27 22:37:54,564 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 350 transitions, 5231 flow [2024-06-27 22:37:54,564 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-06-27 22:37:54,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:54,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:54,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 22:37:54,564 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:54,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2139057903, now seen corresponding path program 19 times [2024-06-27 22:37:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600700264] [2024-06-27 22:37:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600700264] [2024-06-27 22:37:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600700264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027407390] [2024-06-27 22:37:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:56,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:37:56,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 350 transitions, 5231 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-06-27 22:37:56,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:56,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:37:56,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:58,511 INFO L124 PetriNetUnfolderBase]: 3360/7281 cut-off events. [2024-06-27 22:37:58,512 INFO L125 PetriNetUnfolderBase]: For 256016/256016 co-relation queries the response was YES. [2024-06-27 22:37:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36054 conditions, 7281 events. 3360/7281 cut-off events. For 256016/256016 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 65730 event pairs, 2184 based on Foata normal form. 10/6817 useless extension candidates. Maximal degree in co-relation 35886. Up to 5987 conditions per place. [2024-06-27 22:37:58,608 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 334 selfloop transitions, 39 changer transitions 0/381 dead transitions. [2024-06-27 22:37:58,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 381 transitions, 6153 flow [2024-06-27 22:37:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:37:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:37:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2024-06-27 22:37:58,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-06-27 22:37:58,609 INFO L175 Difference]: Start difference. First operand has 351 places, 350 transitions, 5231 flow. Second operand 13 states and 190 transitions. [2024-06-27 22:37:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 381 transitions, 6153 flow [2024-06-27 22:37:59,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 381 transitions, 6038 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:59,780 INFO L231 Difference]: Finished difference. Result has 355 places, 350 transitions, 5202 flow [2024-06-27 22:37:59,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5116, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5202, PETRI_PLACES=355, PETRI_TRANSITIONS=350} [2024-06-27 22:37:59,780 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 315 predicate places. [2024-06-27 22:37:59,781 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 350 transitions, 5202 flow [2024-06-27 22:37:59,781 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-06-27 22:37:59,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:59,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:59,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 22:37:59,781 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:59,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1093622447, now seen corresponding path program 20 times [2024-06-27 22:37:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:59,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085471407] [2024-06-27 22:37:59,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085471407] [2024-06-27 22:38:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085471407] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:01,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365158436] [2024-06-27 22:38:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:01,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:01,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 350 transitions, 5202 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-06-27 22:38:01,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:01,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:01,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:03,823 INFO L124 PetriNetUnfolderBase]: 3401/7397 cut-off events. [2024-06-27 22:38:03,823 INFO L125 PetriNetUnfolderBase]: For 243743/243743 co-relation queries the response was YES. [2024-06-27 22:38:03,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35053 conditions, 7397 events. 3401/7397 cut-off events. For 243743/243743 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 67099 event pairs, 2226 based on Foata normal form. 18/6935 useless extension candidates. Maximal degree in co-relation 34883. Up to 5932 conditions per place. [2024-06-27 22:38:03,926 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 323 selfloop transitions, 56 changer transitions 0/387 dead transitions. [2024-06-27 22:38:03,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 387 transitions, 6222 flow [2024-06-27 22:38:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:38:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:38:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-06-27 22:38:03,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146825396825397 [2024-06-27 22:38:03,927 INFO L175 Difference]: Start difference. First operand has 355 places, 350 transitions, 5202 flow. Second operand 14 states and 209 transitions. [2024-06-27 22:38:03,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 387 transitions, 6222 flow [2024-06-27 22:38:04,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 387 transitions, 6134 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-27 22:38:04,889 INFO L231 Difference]: Finished difference. Result has 358 places, 350 transitions, 5232 flow [2024-06-27 22:38:04,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5114, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5232, PETRI_PLACES=358, PETRI_TRANSITIONS=350} [2024-06-27 22:38:04,890 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 318 predicate places. [2024-06-27 22:38:04,890 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 350 transitions, 5232 flow [2024-06-27 22:38:04,890 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-06-27 22:38:04,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:04,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:04,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 22:38:04,890 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:04,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1918602155, now seen corresponding path program 21 times [2024-06-27 22:38:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756199079] [2024-06-27 22:38:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756199079] [2024-06-27 22:38:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756199079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991455881] [2024-06-27 22:38:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:06,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:06,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 350 transitions, 5232 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-06-27 22:38:06,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:06,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:06,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:08,971 INFO L124 PetriNetUnfolderBase]: 3472/7545 cut-off events. [2024-06-27 22:38:08,971 INFO L125 PetriNetUnfolderBase]: For 192055/192055 co-relation queries the response was YES. [2024-06-27 22:38:09,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35639 conditions, 7545 events. 3472/7545 cut-off events. For 192055/192055 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 68821 event pairs, 2256 based on Foata normal form. 10/7063 useless extension candidates. Maximal degree in co-relation 35468. Up to 6199 conditions per place. [2024-06-27 22:38:09,062 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 324 selfloop transitions, 48 changer transitions 0/380 dead transitions. [2024-06-27 22:38:09,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 380 transitions, 6175 flow [2024-06-27 22:38:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:38:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:38:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:38:09,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-27 22:38:09,064 INFO L175 Difference]: Start difference. First operand has 358 places, 350 transitions, 5232 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:38:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 380 transitions, 6175 flow [2024-06-27 22:38:09,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 380 transitions, 6067 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:38:09,892 INFO L231 Difference]: Finished difference. Result has 358 places, 350 transitions, 5224 flow [2024-06-27 22:38:09,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5124, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5224, PETRI_PLACES=358, PETRI_TRANSITIONS=350} [2024-06-27 22:38:09,893 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 318 predicate places. [2024-06-27 22:38:09,893 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 350 transitions, 5224 flow [2024-06-27 22:38:09,893 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-06-27 22:38:09,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:09,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:09,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 22:38:09,893 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:09,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash 987554633, now seen corresponding path program 17 times [2024-06-27 22:38:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160438938] [2024-06-27 22:38:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160438938] [2024-06-27 22:38:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160438938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472778278] [2024-06-27 22:38:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:11,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:11,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:11,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 350 transitions, 5224 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-06-27 22:38:11,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:11,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:11,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:13,700 INFO L124 PetriNetUnfolderBase]: 3473/7531 cut-off events. [2024-06-27 22:38:13,700 INFO L125 PetriNetUnfolderBase]: For 125353/125353 co-relation queries the response was YES. [2024-06-27 22:38:13,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35435 conditions, 7531 events. 3473/7531 cut-off events. For 125353/125353 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 68708 event pairs, 2282 based on Foata normal form. 2/7042 useless extension candidates. Maximal degree in co-relation 35263. Up to 6268 conditions per place. [2024-06-27 22:38:13,806 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 321 selfloop transitions, 48 changer transitions 0/377 dead transitions. [2024-06-27 22:38:13,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 377 transitions, 6144 flow [2024-06-27 22:38:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:38:13,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 22:38:13,807 INFO L175 Difference]: Start difference. First operand has 358 places, 350 transitions, 5224 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:38:13,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 377 transitions, 6144 flow [2024-06-27 22:38:14,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 377 transitions, 6050 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:38:14,969 INFO L231 Difference]: Finished difference. Result has 359 places, 351 transitions, 5272 flow [2024-06-27 22:38:14,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5130, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5272, PETRI_PLACES=359, PETRI_TRANSITIONS=351} [2024-06-27 22:38:14,970 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 319 predicate places. [2024-06-27 22:38:14,970 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 351 transitions, 5272 flow [2024-06-27 22:38:14,970 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-06-27 22:38:14,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:14,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:14,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 22:38:14,970 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:14,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1912346045, now seen corresponding path program 22 times [2024-06-27 22:38:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788365684] [2024-06-27 22:38:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788365684] [2024-06-27 22:38:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788365684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144330784] [2024-06-27 22:38:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:16,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:16,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:16,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 351 transitions, 5272 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-06-27 22:38:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:16,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:18,785 INFO L124 PetriNetUnfolderBase]: 3544/7724 cut-off events. [2024-06-27 22:38:18,786 INFO L125 PetriNetUnfolderBase]: For 184739/184739 co-relation queries the response was YES. [2024-06-27 22:38:18,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36178 conditions, 7724 events. 3544/7724 cut-off events. For 184739/184739 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 70900 event pairs, 2332 based on Foata normal form. 10/7232 useless extension candidates. Maximal degree in co-relation 36005. Up to 6343 conditions per place. [2024-06-27 22:38:18,898 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 323 selfloop transitions, 52 changer transitions 0/383 dead transitions. [2024-06-27 22:38:18,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 383 transitions, 6247 flow [2024-06-27 22:38:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:38:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:38:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-27 22:38:18,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2024-06-27 22:38:18,899 INFO L175 Difference]: Start difference. First operand has 359 places, 351 transitions, 5272 flow. Second operand 12 states and 181 transitions. [2024-06-27 22:38:18,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 383 transitions, 6247 flow [2024-06-27 22:38:20,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 383 transitions, 6123 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-27 22:38:20,032 INFO L231 Difference]: Finished difference. Result has 362 places, 351 transitions, 5256 flow [2024-06-27 22:38:20,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5148, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5256, PETRI_PLACES=362, PETRI_TRANSITIONS=351} [2024-06-27 22:38:20,033 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 322 predicate places. [2024-06-27 22:38:20,033 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 351 transitions, 5256 flow [2024-06-27 22:38:20,033 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-06-27 22:38:20,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:20,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 22:38:20,033 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:20,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1912168415, now seen corresponding path program 23 times [2024-06-27 22:38:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979372997] [2024-06-27 22:38:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:21,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979372997] [2024-06-27 22:38:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979372997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599653013] [2024-06-27 22:38:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:22,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:22,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 351 transitions, 5256 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-06-27 22:38:22,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:22,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:22,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:24,323 INFO L124 PetriNetUnfolderBase]: 3696/8113 cut-off events. [2024-06-27 22:38:24,323 INFO L125 PetriNetUnfolderBase]: For 214743/214743 co-relation queries the response was YES. [2024-06-27 22:38:24,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38011 conditions, 8113 events. 3696/8113 cut-off events. For 214743/214743 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 75308 event pairs, 2349 based on Foata normal form. 8/7608 useless extension candidates. Maximal degree in co-relation 37837. Up to 5967 conditions per place. [2024-06-27 22:38:24,423 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 323 selfloop transitions, 59 changer transitions 0/390 dead transitions. [2024-06-27 22:38:24,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 390 transitions, 6524 flow [2024-06-27 22:38:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:38:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:38:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-06-27 22:38:24,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2024-06-27 22:38:24,424 INFO L175 Difference]: Start difference. First operand has 362 places, 351 transitions, 5256 flow. Second operand 12 states and 188 transitions. [2024-06-27 22:38:24,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 390 transitions, 6524 flow [2024-06-27 22:38:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 390 transitions, 6422 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:38:25,608 INFO L231 Difference]: Finished difference. Result has 364 places, 351 transitions, 5275 flow [2024-06-27 22:38:25,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5154, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5275, PETRI_PLACES=364, PETRI_TRANSITIONS=351} [2024-06-27 22:38:25,608 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 324 predicate places. [2024-06-27 22:38:25,608 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 351 transitions, 5275 flow [2024-06-27 22:38:25,608 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-06-27 22:38:25,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:25,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:25,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 22:38:25,609 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:25,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1912173065, now seen corresponding path program 24 times [2024-06-27 22:38:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645283104] [2024-06-27 22:38:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645283104] [2024-06-27 22:38:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645283104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718707477] [2024-06-27 22:38:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:27,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:27,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 351 transitions, 5275 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-06-27 22:38:27,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:27,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:27,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:29,768 INFO L124 PetriNetUnfolderBase]: 3683/8057 cut-off events. [2024-06-27 22:38:29,768 INFO L125 PetriNetUnfolderBase]: For 159041/159041 co-relation queries the response was YES. [2024-06-27 22:38:29,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36763 conditions, 8057 events. 3683/8057 cut-off events. For 159041/159041 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 74760 event pairs, 2440 based on Foata normal form. 10/7544 useless extension candidates. Maximal degree in co-relation 36588. Up to 6680 conditions per place. [2024-06-27 22:38:29,887 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 339 selfloop transitions, 34 changer transitions 0/381 dead transitions. [2024-06-27 22:38:29,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 381 transitions, 6217 flow [2024-06-27 22:38:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-27 22:38:29,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-27 22:38:29,889 INFO L175 Difference]: Start difference. First operand has 364 places, 351 transitions, 5275 flow. Second operand 11 states and 171 transitions. [2024-06-27 22:38:29,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 381 transitions, 6217 flow [2024-06-27 22:38:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 381 transitions, 6036 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:38:30,873 INFO L231 Difference]: Finished difference. Result has 365 places, 351 transitions, 5166 flow [2024-06-27 22:38:30,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5094, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5166, PETRI_PLACES=365, PETRI_TRANSITIONS=351} [2024-06-27 22:38:30,873 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 325 predicate places. [2024-06-27 22:38:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 351 transitions, 5166 flow [2024-06-27 22:38:30,873 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-06-27 22:38:30,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:30,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:30,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 22:38:30,874 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:30,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1770954125, now seen corresponding path program 1 times [2024-06-27 22:38:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352573921] [2024-06-27 22:38:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:32,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352573921] [2024-06-27 22:38:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352573921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:32,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554051370] [2024-06-27 22:38:32,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:33,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:38:33,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 351 transitions, 5166 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:33,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:33,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:38:33,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:34,967 INFO L124 PetriNetUnfolderBase]: 3195/7420 cut-off events. [2024-06-27 22:38:34,967 INFO L125 PetriNetUnfolderBase]: For 126861/126921 co-relation queries the response was YES. [2024-06-27 22:38:35,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33428 conditions, 7420 events. 3195/7420 cut-off events. For 126861/126921 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 72182 event pairs, 1723 based on Foata normal form. 12/6875 useless extension candidates. Maximal degree in co-relation 33252. Up to 5561 conditions per place. [2024-06-27 22:38:35,074 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 213 selfloop transitions, 150 changer transitions 0/375 dead transitions. [2024-06-27 22:38:35,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 375 transitions, 6007 flow [2024-06-27 22:38:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:38:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:38:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:38:35,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:38:35,075 INFO L175 Difference]: Start difference. First operand has 365 places, 351 transitions, 5166 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:38:35,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 375 transitions, 6007 flow [2024-06-27 22:38:36,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 375 transitions, 5960 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:36,138 INFO L231 Difference]: Finished difference. Result has 368 places, 351 transitions, 5426 flow [2024-06-27 22:38:36,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5119, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5426, PETRI_PLACES=368, PETRI_TRANSITIONS=351} [2024-06-27 22:38:36,138 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 328 predicate places. [2024-06-27 22:38:36,138 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 351 transitions, 5426 flow [2024-06-27 22:38:36,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:36,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:36,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:36,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 22:38:36,139 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:36,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash -552965013, now seen corresponding path program 2 times [2024-06-27 22:38:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577910304] [2024-06-27 22:38:36,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:38,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577910304] [2024-06-27 22:38:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577910304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:38:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451814013] [2024-06-27 22:38:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:38:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:38:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:38:38,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:38,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 351 transitions, 5426 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-06-27 22:38:38,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:38,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:38,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:40,405 INFO L124 PetriNetUnfolderBase]: 3703/8115 cut-off events. [2024-06-27 22:38:40,405 INFO L125 PetriNetUnfolderBase]: For 132882/132884 co-relation queries the response was YES. [2024-06-27 22:38:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37109 conditions, 8115 events. 3703/8115 cut-off events. For 132882/132884 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 75644 event pairs, 1837 based on Foata normal form. 8/7601 useless extension candidates. Maximal degree in co-relation 36932. Up to 6357 conditions per place. [2024-06-27 22:38:40,525 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 238 selfloop transitions, 146 changer transitions 0/392 dead transitions. [2024-06-27 22:38:40,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 392 transitions, 6460 flow [2024-06-27 22:38:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-27 22:38:40,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-27 22:38:40,526 INFO L175 Difference]: Start difference. First operand has 368 places, 351 transitions, 5426 flow. Second operand 11 states and 183 transitions. [2024-06-27 22:38:40,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 392 transitions, 6460 flow [2024-06-27 22:38:41,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 392 transitions, 6173 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:41,848 INFO L231 Difference]: Finished difference. Result has 372 places, 351 transitions, 5438 flow [2024-06-27 22:38:41,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5139, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5438, PETRI_PLACES=372, PETRI_TRANSITIONS=351} [2024-06-27 22:38:41,849 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 332 predicate places. [2024-06-27 22:38:41,849 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 351 transitions, 5438 flow [2024-06-27 22:38:41,849 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-06-27 22:38:41,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:41,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:41,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 22:38:41,849 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:41,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1990281139, now seen corresponding path program 3 times [2024-06-27 22:38:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174664676] [2024-06-27 22:38:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174664676] [2024-06-27 22:38:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174664676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:38:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069982255] [2024-06-27 22:38:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:44,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:38:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:38:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:38:44,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:38:44,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 351 transitions, 5438 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:44,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:44,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:38:44,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:46,202 INFO L124 PetriNetUnfolderBase]: 3278/7605 cut-off events. [2024-06-27 22:38:46,203 INFO L125 PetriNetUnfolderBase]: For 132388/132443 co-relation queries the response was YES. [2024-06-27 22:38:46,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34515 conditions, 7605 events. 3278/7605 cut-off events. For 132388/132443 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 74383 event pairs, 1847 based on Foata normal form. 9/7040 useless extension candidates. Maximal degree in co-relation 34337. Up to 5858 conditions per place. [2024-06-27 22:38:46,311 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 219 selfloop transitions, 149 changer transitions 0/380 dead transitions. [2024-06-27 22:38:46,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 380 transitions, 6354 flow [2024-06-27 22:38:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:38:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:38:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2024-06-27 22:38:46,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-06-27 22:38:46,313 INFO L175 Difference]: Start difference. First operand has 372 places, 351 transitions, 5438 flow. Second operand 13 states and 210 transitions. [2024-06-27 22:38:46,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 380 transitions, 6354 flow [2024-06-27 22:38:47,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 6067 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:38:47,543 INFO L231 Difference]: Finished difference. Result has 377 places, 352 transitions, 5508 flow [2024-06-27 22:38:47,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5151, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5508, PETRI_PLACES=377, PETRI_TRANSITIONS=352} [2024-06-27 22:38:47,544 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 337 predicate places. [2024-06-27 22:38:47,544 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 352 transitions, 5508 flow [2024-06-27 22:38:47,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:47,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:47,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:47,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 22:38:47,545 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:47,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2048039063, now seen corresponding path program 4 times [2024-06-27 22:38:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:47,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526755481] [2024-06-27 22:38:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526755481] [2024-06-27 22:38:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526755481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124063173] [2024-06-27 22:38:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:49,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:49,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:49,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:49,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 352 transitions, 5508 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-06-27 22:38:49,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:49,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:49,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:51,923 INFO L124 PetriNetUnfolderBase]: 3781/8287 cut-off events. [2024-06-27 22:38:51,923 INFO L125 PetriNetUnfolderBase]: For 137162/137162 co-relation queries the response was YES. [2024-06-27 22:38:52,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37857 conditions, 8287 events. 3781/8287 cut-off events. For 137162/137162 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 77744 event pairs, 1984 based on Foata normal form. 6/7768 useless extension candidates. Maximal degree in co-relation 37677. Up to 6525 conditions per place. [2024-06-27 22:38:52,054 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 225 selfloop transitions, 158 changer transitions 0/391 dead transitions. [2024-06-27 22:38:52,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 391 transitions, 6524 flow [2024-06-27 22:38:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:38:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:38:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:38:52,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:38:52,055 INFO L175 Difference]: Start difference. First operand has 377 places, 352 transitions, 5508 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:38:52,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 391 transitions, 6524 flow [2024-06-27 22:38:53,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 391 transitions, 6211 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-27 22:38:53,150 INFO L231 Difference]: Finished difference. Result has 377 places, 352 transitions, 5516 flow [2024-06-27 22:38:53,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5195, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5516, PETRI_PLACES=377, PETRI_TRANSITIONS=352} [2024-06-27 22:38:53,151 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 337 predicate places. [2024-06-27 22:38:53,151 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 352 transitions, 5516 flow [2024-06-27 22:38:53,151 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-06-27 22:38:53,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:53,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:53,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 22:38:53,151 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:53,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1668918141, now seen corresponding path program 5 times [2024-06-27 22:38:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738275504] [2024-06-27 22:38:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738275504] [2024-06-27 22:38:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738275504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:38:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606600251] [2024-06-27 22:38:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:55,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:38:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:38:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:38:55,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:38:55,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 352 transitions, 5516 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-06-27 22:38:55,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:55,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:38:55,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:57,548 INFO L124 PetriNetUnfolderBase]: 3822/8383 cut-off events. [2024-06-27 22:38:57,548 INFO L125 PetriNetUnfolderBase]: For 139830/139832 co-relation queries the response was YES. [2024-06-27 22:38:57,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38262 conditions, 8383 events. 3822/8383 cut-off events. For 139830/139832 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 78782 event pairs, 1887 based on Foata normal form. 8/7868 useless extension candidates. Maximal degree in co-relation 38081. Up to 6366 conditions per place. [2024-06-27 22:38:57,674 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 223 selfloop transitions, 168 changer transitions 0/399 dead transitions. [2024-06-27 22:38:57,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 399 transitions, 6616 flow [2024-06-27 22:38:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:38:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:38:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 211 transitions. [2024-06-27 22:38:57,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45085470085470086 [2024-06-27 22:38:57,675 INFO L175 Difference]: Start difference. First operand has 377 places, 352 transitions, 5516 flow. Second operand 13 states and 211 transitions. [2024-06-27 22:38:57,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 399 transitions, 6616 flow [2024-06-27 22:38:58,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 399 transitions, 6303 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:58,760 INFO L231 Difference]: Finished difference. Result has 383 places, 353 transitions, 5600 flow [2024-06-27 22:38:58,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5203, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5600, PETRI_PLACES=383, PETRI_TRANSITIONS=353} [2024-06-27 22:38:58,760 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 343 predicate places. [2024-06-27 22:38:58,760 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 353 transitions, 5600 flow [2024-06-27 22:38:58,761 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-06-27 22:38:58,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:58,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 22:38:58,761 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:58,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1663888893, now seen corresponding path program 6 times [2024-06-27 22:38:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446769067] [2024-06-27 22:38:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446769067] [2024-06-27 22:39:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446769067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297218608] [2024-06-27 22:39:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:01,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:01,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:01,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 353 transitions, 5600 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-06-27 22:39:01,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:01,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:01,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:03,321 INFO L124 PetriNetUnfolderBase]: 3890/8494 cut-off events. [2024-06-27 22:39:03,321 INFO L125 PetriNetUnfolderBase]: For 142943/142943 co-relation queries the response was YES. [2024-06-27 22:39:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39010 conditions, 8494 events. 3890/8494 cut-off events. For 142943/142943 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 79811 event pairs, 2654 based on Foata normal form. 6/7964 useless extension candidates. Maximal degree in co-relation 38827. Up to 7173 conditions per place. [2024-06-27 22:39:03,455 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 352 selfloop transitions, 28 changer transitions 0/388 dead transitions. [2024-06-27 22:39:03,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 388 transitions, 6555 flow [2024-06-27 22:39:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:39:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:39:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-27 22:39:03,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4081196581196581 [2024-06-27 22:39:03,456 INFO L175 Difference]: Start difference. First operand has 383 places, 353 transitions, 5600 flow. Second operand 13 states and 191 transitions. [2024-06-27 22:39:03,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 388 transitions, 6555 flow [2024-06-27 22:39:04,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 6200 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-27 22:39:04,421 INFO L231 Difference]: Finished difference. Result has 388 places, 359 transitions, 5389 flow [2024-06-27 22:39:04,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5245, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5389, PETRI_PLACES=388, PETRI_TRANSITIONS=359} [2024-06-27 22:39:04,421 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 348 predicate places. [2024-06-27 22:39:04,421 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 359 transitions, 5389 flow [2024-06-27 22:39:04,421 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-06-27 22:39:04,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:04,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:04,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 22:39:04,422 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:04,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1886501689, now seen corresponding path program 7 times [2024-06-27 22:39:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609570100] [2024-06-27 22:39:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609570100] [2024-06-27 22:39:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609570100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605775791] [2024-06-27 22:39:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:06,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:06,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:06,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 359 transitions, 5389 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-06-27 22:39:06,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:06,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:06,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:09,326 INFO L124 PetriNetUnfolderBase]: 3927/8573 cut-off events. [2024-06-27 22:39:09,327 INFO L125 PetriNetUnfolderBase]: For 144057/144057 co-relation queries the response was YES. [2024-06-27 22:39:09,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39303 conditions, 8573 events. 3927/8573 cut-off events. For 144057/144057 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 80712 event pairs, 2684 based on Foata normal form. 6/8043 useless extension candidates. Maximal degree in co-relation 39117. Up to 7204 conditions per place. [2024-06-27 22:39:09,442 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 349 selfloop transitions, 35 changer transitions 0/392 dead transitions. [2024-06-27 22:39:09,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 392 transitions, 6334 flow [2024-06-27 22:39:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:39:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:39:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2024-06-27 22:39:09,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-06-27 22:39:09,444 INFO L175 Difference]: Start difference. First operand has 388 places, 359 transitions, 5389 flow. Second operand 13 states and 190 transitions. [2024-06-27 22:39:09,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 392 transitions, 6334 flow [2024-06-27 22:39:10,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 392 transitions, 6258 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-27 22:39:10,634 INFO L231 Difference]: Finished difference. Result has 394 places, 359 transitions, 5397 flow [2024-06-27 22:39:10,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5323, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5397, PETRI_PLACES=394, PETRI_TRANSITIONS=359} [2024-06-27 22:39:10,634 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 354 predicate places. [2024-06-27 22:39:10,634 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 359 transitions, 5397 flow [2024-06-27 22:39:10,634 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-06-27 22:39:10,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:10,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:10,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 22:39:10,635 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:10,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910999, now seen corresponding path program 8 times [2024-06-27 22:39:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662560456] [2024-06-27 22:39:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:12,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:12,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662560456] [2024-06-27 22:39:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662560456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105557968] [2024-06-27 22:39:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:12,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:12,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:12,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:13,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:13,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 359 transitions, 5397 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-06-27 22:39:13,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:13,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:13,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:15,335 INFO L124 PetriNetUnfolderBase]: 3964/8651 cut-off events. [2024-06-27 22:39:15,335 INFO L125 PetriNetUnfolderBase]: For 145839/145839 co-relation queries the response was YES. [2024-06-27 22:39:15,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39549 conditions, 8651 events. 3964/8651 cut-off events. For 145839/145839 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 81645 event pairs, 2672 based on Foata normal form. 6/8120 useless extension candidates. Maximal degree in co-relation 39361. Up to 7130 conditions per place. [2024-06-27 22:39:15,463 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 351 selfloop transitions, 33 changer transitions 0/392 dead transitions. [2024-06-27 22:39:15,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 392 transitions, 6332 flow [2024-06-27 22:39:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:39:15,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-27 22:39:15,464 INFO L175 Difference]: Start difference. First operand has 394 places, 359 transitions, 5397 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:39:15,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 392 transitions, 6332 flow [2024-06-27 22:39:16,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 392 transitions, 6264 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:39:16,649 INFO L231 Difference]: Finished difference. Result has 395 places, 359 transitions, 5399 flow [2024-06-27 22:39:16,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5329, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5399, PETRI_PLACES=395, PETRI_TRANSITIONS=359} [2024-06-27 22:39:16,650 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 355 predicate places. [2024-06-27 22:39:16,650 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 359 transitions, 5399 flow [2024-06-27 22:39:16,650 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-06-27 22:39:16,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:16,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:16,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 22:39:16,650 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:16,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -450076535, now seen corresponding path program 9 times [2024-06-27 22:39:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461393872] [2024-06-27 22:39:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39: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-06-27 22:39:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461393872] [2024-06-27 22:39:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461393872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:39:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315043195] [2024-06-27 22:39:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:18,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:39:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:39:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:39:19,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:19,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 359 transitions, 5399 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:19,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:19,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:19,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:21,530 INFO L124 PetriNetUnfolderBase]: 4001/8767 cut-off events. [2024-06-27 22:39:21,530 INFO L125 PetriNetUnfolderBase]: For 148074/148074 co-relation queries the response was YES. [2024-06-27 22:39:21,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39944 conditions, 8767 events. 4001/8767 cut-off events. For 148074/148074 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 83171 event pairs, 2729 based on Foata normal form. 6/8227 useless extension candidates. Maximal degree in co-relation 39755. Up to 7344 conditions per place. [2024-06-27 22:39:21,658 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 336 selfloop transitions, 53 changer transitions 0/397 dead transitions. [2024-06-27 22:39:21,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 397 transitions, 6439 flow [2024-06-27 22:39:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:39:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:39:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-06-27 22:39:21,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146825396825397 [2024-06-27 22:39:21,659 INFO L175 Difference]: Start difference. First operand has 395 places, 359 transitions, 5399 flow. Second operand 14 states and 209 transitions. [2024-06-27 22:39:21,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 397 transitions, 6439 flow [2024-06-27 22:39:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 397 transitions, 6371 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-27 22:39:23,193 INFO L231 Difference]: Finished difference. Result has 398 places, 359 transitions, 5440 flow [2024-06-27 22:39:23,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5331, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5440, PETRI_PLACES=398, PETRI_TRANSITIONS=359} [2024-06-27 22:39:23,193 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 358 predicate places. [2024-06-27 22:39:23,193 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 359 transitions, 5440 flow [2024-06-27 22:39:23,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:23,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:23,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:23,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 22:39:23,194 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:23,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -952615529, now seen corresponding path program 10 times [2024-06-27 22:39:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158225962] [2024-06-27 22:39:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158225962] [2024-06-27 22:39:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158225962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947592757] [2024-06-27 22:39:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:24,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:25,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:25,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 359 transitions, 5440 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-06-27 22:39:25,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:25,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:27,606 INFO L124 PetriNetUnfolderBase]: 4038/8866 cut-off events. [2024-06-27 22:39:27,606 INFO L125 PetriNetUnfolderBase]: For 148301/148301 co-relation queries the response was YES. [2024-06-27 22:39:27,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40271 conditions, 8866 events. 4038/8866 cut-off events. For 148301/148301 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 84241 event pairs, 2752 based on Foata normal form. 6/8359 useless extension candidates. Maximal degree in co-relation 40082. Up to 7452 conditions per place. [2024-06-27 22:39:27,727 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 368 selfloop transitions, 22 changer transitions 0/398 dead transitions. [2024-06-27 22:39:27,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 398 transitions, 6412 flow [2024-06-27 22:39:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:39:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:39:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 193 transitions. [2024-06-27 22:39:27,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41239316239316237 [2024-06-27 22:39:27,728 INFO L175 Difference]: Start difference. First operand has 398 places, 359 transitions, 5440 flow. Second operand 13 states and 193 transitions. [2024-06-27 22:39:27,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 398 transitions, 6412 flow [2024-06-27 22:39:28,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 398 transitions, 6307 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:39:28,895 INFO L231 Difference]: Finished difference. Result has 401 places, 363 transitions, 5447 flow [2024-06-27 22:39:28,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5335, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5447, PETRI_PLACES=401, PETRI_TRANSITIONS=363} [2024-06-27 22:39:28,895 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 361 predicate places. [2024-06-27 22:39:28,896 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 363 transitions, 5447 flow [2024-06-27 22:39:28,896 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-06-27 22:39:28,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:28,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:28,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 22:39:28,896 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:28,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 348074703, now seen corresponding path program 11 times [2024-06-27 22:39:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5954223] [2024-06-27 22:39:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5954223] [2024-06-27 22:39:30,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5954223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:30,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:30,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514003720] [2024-06-27 22:39:30,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:30,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:30,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:30,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:31,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:31,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 363 transitions, 5447 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-06-27 22:39:31,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:31,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:31,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:33,319 INFO L124 PetriNetUnfolderBase]: 4075/8931 cut-off events. [2024-06-27 22:39:33,319 INFO L125 PetriNetUnfolderBase]: For 156089/156089 co-relation queries the response was YES. [2024-06-27 22:39:33,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41399 conditions, 8931 events. 4075/8931 cut-off events. For 156089/156089 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 85106 event pairs, 2796 based on Foata normal form. 6/8385 useless extension candidates. Maximal degree in co-relation 41207. Up to 7508 conditions per place. [2024-06-27 22:39:33,458 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 337 selfloop transitions, 51 changer transitions 0/396 dead transitions. [2024-06-27 22:39:33,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 396 transitions, 6442 flow [2024-06-27 22:39:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-27 22:39:33,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2024-06-27 22:39:33,460 INFO L175 Difference]: Start difference. First operand has 401 places, 363 transitions, 5447 flow. Second operand 12 states and 181 transitions. [2024-06-27 22:39:33,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 396 transitions, 6442 flow [2024-06-27 22:39:34,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 396 transitions, 6132 flow, removed 53 selfloop flow, removed 17 redundant places. [2024-06-27 22:39:34,902 INFO L231 Difference]: Finished difference. Result has 396 places, 363 transitions, 5242 flow [2024-06-27 22:39:34,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5137, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5242, PETRI_PLACES=396, PETRI_TRANSITIONS=363} [2024-06-27 22:39:34,902 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 356 predicate places. [2024-06-27 22:39:34,902 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 363 transitions, 5242 flow [2024-06-27 22:39:34,903 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-06-27 22:39:34,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:34,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:34,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 22:39:34,903 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:34,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -449817065, now seen corresponding path program 12 times [2024-06-27 22:39:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45399972] [2024-06-27 22:39:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45399972] [2024-06-27 22:39:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45399972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:39:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063532050] [2024-06-27 22:39:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:37,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:39:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:39:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:39:37,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:37,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 363 transitions, 5242 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:37,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:37,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:37,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:40,090 INFO L124 PetriNetUnfolderBase]: 4112/9021 cut-off events. [2024-06-27 22:39:40,090 INFO L125 PetriNetUnfolderBase]: For 156318/156318 co-relation queries the response was YES. [2024-06-27 22:39:40,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41049 conditions, 9021 events. 4112/9021 cut-off events. For 156318/156318 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 86275 event pairs, 2798 based on Foata normal form. 6/8476 useless extension candidates. Maximal degree in co-relation 40864. Up to 7502 conditions per place. [2024-06-27 22:39:40,200 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 340 selfloop transitions, 56 changer transitions 0/404 dead transitions. [2024-06-27 22:39:40,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 404 transitions, 6315 flow [2024-06-27 22:39:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:39:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:39:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2024-06-27 22:39:40,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-27 22:39:40,201 INFO L175 Difference]: Start difference. First operand has 396 places, 363 transitions, 5242 flow. Second operand 14 states and 212 transitions. [2024-06-27 22:39:40,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 404 transitions, 6315 flow [2024-06-27 22:39:41,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 404 transitions, 6206 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-27 22:39:41,304 INFO L231 Difference]: Finished difference. Result has 400 places, 363 transitions, 5248 flow [2024-06-27 22:39:41,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5133, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5248, PETRI_PLACES=400, PETRI_TRANSITIONS=363} [2024-06-27 22:39:41,304 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 360 predicate places. [2024-06-27 22:39:41,304 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 363 transitions, 5248 flow [2024-06-27 22:39:41,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:41,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:41,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 22:39:41,305 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:41,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -652659203, now seen corresponding path program 13 times [2024-06-27 22:39:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103022744] [2024-06-27 22:39:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:43,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103022744] [2024-06-27 22:39:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103022744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510514291] [2024-06-27 22:39:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:43,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:43,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 363 transitions, 5248 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-06-27 22:39:43,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:43,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:45,848 INFO L124 PetriNetUnfolderBase]: 4149/9104 cut-off events. [2024-06-27 22:39:45,848 INFO L125 PetriNetUnfolderBase]: For 158274/158274 co-relation queries the response was YES. [2024-06-27 22:39:45,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41403 conditions, 9104 events. 4149/9104 cut-off events. For 158274/158274 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 87184 event pairs, 2871 based on Foata normal form. 6/8548 useless extension candidates. Maximal degree in co-relation 41217. Up to 7666 conditions per place. [2024-06-27 22:39:45,977 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 339 selfloop transitions, 47 changer transitions 0/394 dead transitions. [2024-06-27 22:39:45,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 394 transitions, 6213 flow [2024-06-27 22:39:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:39:45,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-27 22:39:45,979 INFO L175 Difference]: Start difference. First operand has 400 places, 363 transitions, 5248 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:39:45,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 394 transitions, 6213 flow [2024-06-27 22:39:47,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 394 transitions, 6109 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-27 22:39:47,321 INFO L231 Difference]: Finished difference. Result has 401 places, 363 transitions, 5241 flow [2024-06-27 22:39:47,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5144, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5241, PETRI_PLACES=401, PETRI_TRANSITIONS=363} [2024-06-27 22:39:47,322 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 361 predicate places. [2024-06-27 22:39:47,322 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 363 transitions, 5241 flow [2024-06-27 22:39:47,322 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-06-27 22:39:47,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:47,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 22:39:47,323 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:47,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -645249893, now seen corresponding path program 14 times [2024-06-27 22:39:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820455229] [2024-06-27 22:39:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820455229] [2024-06-27 22:39:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820455229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301804692] [2024-06-27 22:39:49,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:49,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:49,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:39:49,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 363 transitions, 5241 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-06-27 22:39:49,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:49,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:39:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:51,714 INFO L124 PetriNetUnfolderBase]: 4150/9101 cut-off events. [2024-06-27 22:39:51,714 INFO L125 PetriNetUnfolderBase]: For 106652/106652 co-relation queries the response was YES. [2024-06-27 22:39:51,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40563 conditions, 9101 events. 4150/9101 cut-off events. For 106652/106652 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 87221 event pairs, 2850 based on Foata normal form. 6/8549 useless extension candidates. Maximal degree in co-relation 40376. Up to 7594 conditions per place. [2024-06-27 22:39:51,845 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 340 selfloop transitions, 48 changer transitions 0/396 dead transitions. [2024-06-27 22:39:51,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 396 transitions, 5949 flow [2024-06-27 22:39:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2024-06-27 22:39:51,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 22:39:51,847 INFO L175 Difference]: Start difference. First operand has 401 places, 363 transitions, 5241 flow. Second operand 12 states and 184 transitions. [2024-06-27 22:39:51,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 396 transitions, 5949 flow [2024-06-27 22:39:52,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 396 transitions, 5232 flow, removed 39 selfloop flow, removed 128 redundant places. [2024-06-27 22:39:52,552 INFO L231 Difference]: Finished difference. Result has 283 places, 362 transitions, 4362 flow [2024-06-27 22:39:52,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4266, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4362, PETRI_PLACES=283, PETRI_TRANSITIONS=362} [2024-06-27 22:39:52,552 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 243 predicate places. [2024-06-27 22:39:52,552 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 362 transitions, 4362 flow [2024-06-27 22:39:52,553 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-06-27 22:39:52,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:52,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:52,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 22:39:52,553 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:52,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -607357654, now seen corresponding path program 1 times [2024-06-27 22:39:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978015358] [2024-06-27 22:39:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978015358] [2024-06-27 22:39:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978015358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787724604] [2024-06-27 22:39:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:52,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:39:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:39:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:39:52,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:39:52,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 362 transitions, 4362 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:52,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:52,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:39:52,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:53,467 INFO L124 PetriNetUnfolderBase]: 2888/6818 cut-off events. [2024-06-27 22:39:53,467 INFO L125 PetriNetUnfolderBase]: For 19764/19864 co-relation queries the response was YES. [2024-06-27 22:39:53,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25363 conditions, 6818 events. 2888/6818 cut-off events. For 19764/19864 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63902 event pairs, 604 based on Foata normal form. 485/6977 useless extension candidates. Maximal degree in co-relation 25296. Up to 2053 conditions per place. [2024-06-27 22:39:53,507 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 173 selfloop transitions, 99 changer transitions 1/352 dead transitions. [2024-06-27 22:39:53,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 352 transitions, 4781 flow [2024-06-27 22:39:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:39:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:39:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-27 22:39:53,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-06-27 22:39:53,508 INFO L175 Difference]: Start difference. First operand has 283 places, 362 transitions, 4362 flow. Second operand 5 states and 112 transitions. [2024-06-27 22:39:53,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 352 transitions, 4781 flow [2024-06-27 22:39:53,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 352 transitions, 4327 flow, removed 62 selfloop flow, removed 28 redundant places. [2024-06-27 22:39:53,569 INFO L231 Difference]: Finished difference. Result has 261 places, 341 transitions, 4043 flow [2024-06-27 22:39:53,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4043, PETRI_PLACES=261, PETRI_TRANSITIONS=341} [2024-06-27 22:39:53,570 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 221 predicate places. [2024-06-27 22:39:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 341 transitions, 4043 flow [2024-06-27 22:39:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:53,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:53,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 22:39:53,570 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:53,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1164236629, now seen corresponding path program 1 times [2024-06-27 22:39:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177636524] [2024-06-27 22:39:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177636524] [2024-06-27 22:39:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177636524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994877398] [2024-06-27 22:39:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:53,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:39:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:53,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:39:53,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:39:53,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 22:39:53,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 341 transitions, 4043 flow. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:53,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:53,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 22:39:53,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:54,845 INFO L124 PetriNetUnfolderBase]: 2294/5684 cut-off events. [2024-06-27 22:39:54,845 INFO L125 PetriNetUnfolderBase]: For 13843/13885 co-relation queries the response was YES. [2024-06-27 22:39:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20752 conditions, 5684 events. 2294/5684 cut-off events. For 13843/13885 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 53435 event pairs, 429 based on Foata normal form. 93/5430 useless extension candidates. Maximal degree in co-relation 20693. Up to 1526 conditions per place. [2024-06-27 22:39:54,876 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 56 selfloop transitions, 74 changer transitions 103/368 dead transitions. [2024-06-27 22:39:54,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 368 transitions, 4537 flow [2024-06-27 22:39:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:39:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:39:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 22:39:54,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 22:39:54,878 INFO L175 Difference]: Start difference. First operand has 261 places, 341 transitions, 4043 flow. Second operand 10 states and 192 transitions. [2024-06-27 22:39:54,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 368 transitions, 4537 flow [2024-06-27 22:39:54,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 368 transitions, 4229 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:54,967 INFO L231 Difference]: Finished difference. Result has 268 places, 255 transitions, 2970 flow [2024-06-27 22:39:54,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3739, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2970, PETRI_PLACES=268, PETRI_TRANSITIONS=255} [2024-06-27 22:39:54,968 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 228 predicate places. [2024-06-27 22:39:54,968 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 255 transitions, 2970 flow [2024-06-27 22:39:54,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:54,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:54,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-27 22:39:54,968 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:54,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1878082039, now seen corresponding path program 2 times [2024-06-27 22:39:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564526015] [2024-06-27 22:39:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:39:54,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:39:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:39:55,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:39:55,044 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:39:55,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:39:55,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:39:55,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:39:55,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:39:55,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:39:55,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:39:55,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:39:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-27 22:39:55,049 INFO L445 BasicCegarLoop]: Path program histogram: [24, 17, 14, 14, 12, 11, 8, 6, 6, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:55,054 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:39:55,054 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:39:55,110 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:39:55,110 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:39:55,111 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:39:55 BasicIcfg [2024-06-27 22:39:55,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:39:55,112 INFO L158 Benchmark]: Toolchain (without parser) took 443318.85ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 120.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 22:39:55,112 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:39:55,112 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:39:55,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.99ms. Allocated memory is still 157.3MB. Free memory was 120.6MB in the beginning and 87.7MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-27 22:39:55,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.57ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 81.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:39:55,113 INFO L158 Benchmark]: Boogie Preprocessor took 106.89ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 77.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:39:55,113 INFO L158 Benchmark]: RCFGBuilder took 875.22ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 77.1MB in the beginning and 124.6MB in the end (delta: -47.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-06-27 22:39:55,113 INFO L158 Benchmark]: TraceAbstraction took 441555.85ms. Allocated memory was 211.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 124.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-06-27 22:39:55,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.99ms. Allocated memory is still 157.3MB. Free memory was 120.6MB in the beginning and 87.7MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.57ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 81.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.89ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 77.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 875.22ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 77.1MB in the beginning and 124.6MB in the end (delta: -47.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 441555.85ms. Allocated memory was 211.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 124.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t1706; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L813] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$w_buff0_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) + (long long) x$r_buff0_thd1) >= 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_buff0_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) + (long long) x$w_buff0) >= 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_buff0_used) >= 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_buff0_used) >= 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$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$read_delayed) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd1) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd1) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$w_buff0) + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) x$w_buff0) >= 0LL)) && (((long long) x + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$w_buff0) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$w_buff0) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff0_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd0) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) y) >= 0LL)) && (((long long) x$r_buff0_thd2 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd0 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd1 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd2 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd2 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$read_delayed + (long long) x$w_buff0) >= 0LL)) && (((long long) x$read_delayed + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) y) >= 0LL)) && (((long long) x$w_buff0_used + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0_used + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$w_buff0_used) >= 0LL)) && (((1LL + (long long) x$w_buff0_used) - (long long) x$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff0_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd0) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) + (long long) x$w_buff0_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) + (long long) x$r_buff0_thd1) >= 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_buff0_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) + (long long) x$w_buff0) >= 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_buff0_used) >= 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_buff0_used) >= 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$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$read_delayed) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd1) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd1) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) x$w_buff0) + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) x$w_buff0) >= 0LL)) && (((long long) x + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$w_buff0) >= 0LL)) && (((long long) x$flush_delayed + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$w_buff0) >= 0LL)) && (((long long) x$mem_tmp + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff0_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd0) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 + (long long) y) >= 0LL)) && (((long long) x$r_buff0_thd2 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd0 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd1 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd1 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff1_thd2 + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff1_thd2 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$read_delayed + (long long) x$w_buff0) >= 0LL)) && (((long long) x$read_delayed + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 + (long long) y) >= 0LL)) && (((long long) x$w_buff0_used + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0_used + (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) x$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) x$w_buff0_used) >= 0LL)) && (((1LL + (long long) x$w_buff0_used) - (long long) x$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff0_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd0) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 441.4s, OverallIterations: 142, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 222.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8378 SdHoareTripleChecker+Valid, 48.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7148 mSDsluCounter, 4119 SdHoareTripleChecker+Invalid, 41.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3365 mSDsCounter, 2461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59024 IncrementalHoareTripleChecker+Invalid, 61485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2461 mSolverCounterUnsat, 754 mSDtfsCounter, 59024 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 1547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5677occurred in iteration=51, InterpolantAutomatonStates: 1354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 215.0s InterpolantComputationTime, 2233 NumberOfCodeBlocks, 2233 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2066 ConstructedInterpolants, 0 QuantifiedInterpolants, 96306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 141 InterpolantComputations, 141 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:39:55,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE