./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.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/mix012_pso.opt_tso.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/mix012_pso.opt_tso.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix012_pso.opt_tso.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:08:39,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:08:39,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:08:39,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:08:39,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:08:39,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:08:39,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:08:39,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:08:39,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:08:39,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:08:39,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:08:39,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:08:39,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:08:39,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:08:39,378 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:08:39,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:08:39,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:08:39,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:08:39,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:08:39,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:08:39,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:08:39,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:08:39,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:08:39,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:08:39,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:08:39,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:08:39,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:08:39,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:08:39,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:08:39,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:08:39,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:08:39,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:08:39,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:08:39,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:08:39,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:08:39,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:08:39,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:08:39,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:08:39,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:08:39,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:08:39,391 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:08:39,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:08:39,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:08:39,392 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:08:39,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:08:39,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:08:39,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:08:39,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:08:39,683 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:08:39,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-27 22:08:40,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:08:41,143 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:08:41,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2024-06-27 22:08:41,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63faa90e8/0a4226efdcda4aa19a24969604fe0743/FLAG0e61132af [2024-06-27 22:08:41,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63faa90e8/0a4226efdcda4aa19a24969604fe0743 [2024-06-27 22:08:41,177 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:08:41,177 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:08:41,178 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/mix012_pso.opt_tso.opt.yml/witness.yml [2024-06-27 22:08:41,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:08:41,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:08:41,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:08:41,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:08:41,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:08:41,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:08:41" (1/2) ... [2024-06-27 22:08:41,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9e8071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:08:41, skipping insertion in model container [2024-06-27 22:08:41,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:08:41" (1/2) ... [2024-06-27 22:08:41,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b24665f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:08:41, skipping insertion in model container [2024-06-27 22:08:41,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:08:41" (2/2) ... [2024-06-27 22:08:41,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9e8071 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:08:41, skipping insertion in model container [2024-06-27 22:08:41,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:08:41" (2/2) ... [2024-06-27 22:08:41,291 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:08:41,322 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:08:41,324 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 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_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:08:41,324 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 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_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:08:41,324 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:08:41,324 INFO L106 edCorrectnessWitness]: ghost_update [L822-L822] multithreaded = 1; [2024-06-27 22:08:41,363 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:08:41,541 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/mix012_pso.opt_tso.opt.i[999,1012] [2024-06-27 22:08:41,741 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:08:41,756 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:08:41,801 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/mix012_pso.opt_tso.opt.i[999,1012] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:08:41,897 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:08:41,929 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:08:41,930 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:08:41 WrapperNode [2024-06-27 22:08:41,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:08:41,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:08:41,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:08:41,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:08:41,938 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:08:41" (1/1) ... [2024-06-27 22:08:41,960 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:08:41" (1/1) ... [2024-06-27 22:08:42,002 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-06-27 22:08:42,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:08:42,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:08:42,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:08:42,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:08:42,015 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:08:41" (1/1) ... [2024-06-27 22:08:42,015 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:08:41" (1/1) ... [2024-06-27 22:08:42,019 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:08:41" (1/1) ... [2024-06-27 22:08:42,046 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:08:42,049 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:08:41" (1/1) ... [2024-06-27 22:08:42,049 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:08:41" (1/1) ... [2024-06-27 22:08:42,063 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:08:41" (1/1) ... [2024-06-27 22:08:42,077 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:08:41" (1/1) ... [2024-06-27 22:08:42,079 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:08:41" (1/1) ... [2024-06-27 22:08:42,081 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:08:41" (1/1) ... [2024-06-27 22:08:42,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:08:42,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:08:42,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:08:42,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:08:42,096 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:08:41" (1/1) ... [2024-06-27 22:08:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:08:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:08:42,142 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:08:42,160 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:08:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:08:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:08:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:08:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:08:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:08:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:08:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:08:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:08:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:08:42,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:08:42,185 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:08:42,349 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:08:42,351 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:08:42,828 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:08:42,828 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:08:42,988 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:08:42,988 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:08:42,989 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:08:42 BoogieIcfgContainer [2024-06-27 22:08:42,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:08:42,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:08:42,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:08:42,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:08:42,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:08:41" (1/4) ... [2024-06-27 22:08:42,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572dbe44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:08:42, skipping insertion in model container [2024-06-27 22:08:42,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:08:41" (2/4) ... [2024-06-27 22:08:42,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572dbe44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:08:42, skipping insertion in model container [2024-06-27 22:08:42,996 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:08:41" (3/4) ... [2024-06-27 22:08:42,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572dbe44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:08:42, skipping insertion in model container [2024-06-27 22:08:42,997 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:08:42" (4/4) ... [2024-06-27 22:08:42,998 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2024-06-27 22:08:43,016 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:08:43,016 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:08:43,016 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:08:43,066 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:08:43,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:08:43,140 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 22:08:43,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:08:43,144 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 5. Compared 49 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:08:43,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:08:43,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-27 22:08:43,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:08:43,179 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;@2361d315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:08:43,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:08:43,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:08:43,184 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:08:43,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:08:43,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:43,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:08:43,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:43,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 336206949, now seen corresponding path program 1 times [2024-06-27 22:08:43,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340143894] [2024-06-27 22:08:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:44,342 INFO 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:08:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340143894] [2024-06-27 22:08:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340143894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:08:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038655975] [2024-06-27 22:08:44,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:44,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:08:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:08:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:08:44,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-27 22:08:44,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:44,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:44,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-27 22:08:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:44,639 INFO L124 PetriNetUnfolderBase]: 372/671 cut-off events. [2024-06-27 22:08:44,640 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 22:08:44,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 671 events. 372/671 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3408 event pairs, 160 based on Foata normal form. 35/660 useless extension candidates. Maximal degree in co-relation 1305. Up to 620 conditions per place. [2024-06-27 22:08:44,646 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 29 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:08:44,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 159 flow [2024-06-27 22:08:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:08:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:08:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 22:08:44,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-06-27 22:08:44,671 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 76 transitions. [2024-06-27 22:08:44,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 159 flow [2024-06-27 22:08:44,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:08:44,676 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 93 flow [2024-06-27 22:08:44,678 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:08:44,682 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 22:08:44,682 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 93 flow [2024-06-27 22:08:44,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:44,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:44,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:08:44,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:44,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 972347140, now seen corresponding path program 1 times [2024-06-27 22:08:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308343069] [2024-06-27 22:08:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:45,571 INFO 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:08:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308343069] [2024-06-27 22:08:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308343069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:08:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600794508] [2024-06-27 22:08:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:45,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:08:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:08:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:08:45,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:08:45,621 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:08:45,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:45,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:08:45,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:45,796 INFO L124 PetriNetUnfolderBase]: 414/715 cut-off events. [2024-06-27 22:08:45,796 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-06-27 22:08:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 715 events. 414/715 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3514 event pairs, 133 based on Foata normal form. 2/694 useless extension candidates. Maximal degree in co-relation 1576. Up to 671 conditions per place. [2024-06-27 22:08:45,801 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 38 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-06-27 22:08:45,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 221 flow [2024-06-27 22:08:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:08:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:08:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-06-27 22:08:45,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-06-27 22:08:45,804 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 93 flow. Second operand 4 states and 94 transitions. [2024-06-27 22:08:45,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 221 flow [2024-06-27 22:08:45,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:08:45,806 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 119 flow [2024-06-27 22:08:45,806 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-27 22:08:45,807 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-06-27 22:08:45,807 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 119 flow [2024-06-27 22:08:45,807 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:08:45,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:45,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:45,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:08:45,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:45,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash 77990840, now seen corresponding path program 1 times [2024-06-27 22:08:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879826739] [2024-06-27 22:08:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:47,345 INFO 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:08:47,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:47,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879826739] [2024-06-27 22:08:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879826739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:47,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:47,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:08:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892703013] [2024-06-27 22:08:47,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:47,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:08:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:08:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:08:47,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:08:47,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:47,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:47,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:08:47,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:47,723 INFO L124 PetriNetUnfolderBase]: 398/779 cut-off events. [2024-06-27 22:08:47,724 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-06-27 22:08:47,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 779 events. 398/779 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4075 event pairs, 130 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 1746. Up to 629 conditions per place. [2024-06-27 22:08:47,729 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 46 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-06-27 22:08:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 287 flow [2024-06-27 22:08:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:08:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:08:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 22:08:47,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-06-27 22:08:47,731 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 119 flow. Second operand 5 states and 116 transitions. [2024-06-27 22:08:47,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 287 flow [2024-06-27 22:08:47,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 278 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:08:47,734 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 145 flow [2024-06-27 22:08:47,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-06-27 22:08:47,735 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-06-27 22:08:47,735 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 145 flow [2024-06-27 22:08:47,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:47,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:47,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:47,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:08:47,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:47,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1504293461, now seen corresponding path program 1 times [2024-06-27 22:08:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:47,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619562113] [2024-06-27 22:08:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:49,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:08:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619562113] [2024-06-27 22:08:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619562113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:08:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098601361] [2024-06-27 22:08:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:49,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:08:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:08:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:08:49,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:08:49,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:49,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:49,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:08:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:49,627 INFO L124 PetriNetUnfolderBase]: 375/673 cut-off events. [2024-06-27 22:08:49,628 INFO L125 PetriNetUnfolderBase]: For 457/457 co-relation queries the response was YES. [2024-06-27 22:08:49,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 673 events. 375/673 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3282 event pairs, 45 based on Foata normal form. 4/668 useless extension candidates. Maximal degree in co-relation 1672. Up to 554 conditions per place. [2024-06-27 22:08:49,632 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 44 selfloop transitions, 8 changer transitions 5/67 dead transitions. [2024-06-27 22:08:49,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 309 flow [2024-06-27 22:08:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:08:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:08:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-27 22:08:49,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-06-27 22:08:49,634 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 145 flow. Second operand 6 states and 132 transitions. [2024-06-27 22:08:49,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 309 flow [2024-06-27 22:08:49,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 294 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 22:08:49,637 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 132 flow [2024-06-27 22:08:49,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-06-27 22:08:49,638 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-06-27 22:08:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 132 flow [2024-06-27 22:08:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:49,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:49,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:08:49,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:49,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1804653252, now seen corresponding path program 1 times [2024-06-27 22:08:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903809768] [2024-06-27 22:08:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:50,484 INFO 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:08:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903809768] [2024-06-27 22:08:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903809768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:50,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:50,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:08:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935286542] [2024-06-27 22:08:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:50,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:08:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:08:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:08:50,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:08:50,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:08:50,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:50,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:08:50,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:50,804 INFO L124 PetriNetUnfolderBase]: 315/666 cut-off events. [2024-06-27 22:08:50,804 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2024-06-27 22:08:50,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 666 events. 315/666 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3485 event pairs, 106 based on Foata normal form. 1/641 useless extension candidates. Maximal degree in co-relation 1574. Up to 521 conditions per place. [2024-06-27 22:08:50,808 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 33 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-27 22:08:50,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 270 flow [2024-06-27 22:08:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:08:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:08:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-27 22:08:50,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 22:08:50,810 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 132 flow. Second operand 6 states and 104 transitions. [2024-06-27 22:08:50,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 270 flow [2024-06-27 22:08:50,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 244 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 22:08:50,813 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 185 flow [2024-06-27 22:08:50,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-27 22:08:50,813 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 22:08:50,814 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 185 flow [2024-06-27 22:08:50,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:08:50,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:50,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:50,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:08:50,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:50,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 109676963, now seen corresponding path program 1 times [2024-06-27 22:08:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:50,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212260309] [2024-06-27 22:08:50,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:52,388 INFO 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:08:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212260309] [2024-06-27 22:08:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212260309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:08:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830865119] [2024-06-27 22:08:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:08:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:08:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:08:52,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:08:52,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:52,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:52,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:08:52,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:52,737 INFO L124 PetriNetUnfolderBase]: 317/656 cut-off events. [2024-06-27 22:08:52,737 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2024-06-27 22:08:52,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 656 events. 317/656 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3421 event pairs, 104 based on Foata normal form. 2/635 useless extension candidates. Maximal degree in co-relation 1642. Up to 505 conditions per place. [2024-06-27 22:08:52,742 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 39 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2024-06-27 22:08:52,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 327 flow [2024-06-27 22:08:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:08:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:08:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-27 22:08:52,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:08:52,745 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 185 flow. Second operand 6 states and 112 transitions. [2024-06-27 22:08:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 327 flow [2024-06-27 22:08:52,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 323 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:08:52,748 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 222 flow [2024-06-27 22:08:52,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-27 22:08:52,751 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-06-27 22:08:52,751 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 222 flow [2024-06-27 22:08:52,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:52,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:52,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:52,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:08:52,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:52,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1621079401, now seen corresponding path program 1 times [2024-06-27 22:08:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337302989] [2024-06-27 22:08:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337302989] [2024-06-27 22:08:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337302989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:08:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841270497] [2024-06-27 22:08:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:08:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:08:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:08:53,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:08:53,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:53,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:53,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:08:53,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:54,070 INFO L124 PetriNetUnfolderBase]: 393/813 cut-off events. [2024-06-27 22:08:54,070 INFO L125 PetriNetUnfolderBase]: For 984/984 co-relation queries the response was YES. [2024-06-27 22:08:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 813 events. 393/813 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4313 event pairs, 122 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 2145. Up to 629 conditions per place. [2024-06-27 22:08:54,077 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 44 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2024-06-27 22:08:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 422 flow [2024-06-27 22:08:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:08:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:08:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-27 22:08:54,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:08:54,079 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 222 flow. Second operand 6 states and 108 transitions. [2024-06-27 22:08:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 422 flow [2024-06-27 22:08:54,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 397 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:08:54,083 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 303 flow [2024-06-27 22:08:54,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-06-27 22:08:54,085 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2024-06-27 22:08:54,086 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 303 flow [2024-06-27 22:08:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:08:54,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:54,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -894989341, now seen corresponding path program 2 times [2024-06-27 22:08:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667900851] [2024-06-27 22:08:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:55,112 INFO 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:08:55,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667900851] [2024-06-27 22:08:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667900851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:08:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527804609] [2024-06-27 22:08:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:08:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:08:55,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:08:55,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:08:55,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:55,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:55,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:08:55,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:55,462 INFO L124 PetriNetUnfolderBase]: 401/827 cut-off events. [2024-06-27 22:08:55,462 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2024-06-27 22:08:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 827 events. 401/827 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4398 event pairs, 126 based on Foata normal form. 1/791 useless extension candidates. Maximal degree in co-relation 2304. Up to 619 conditions per place. [2024-06-27 22:08:55,468 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 42 selfloop transitions, 25 changer transitions 0/75 dead transitions. [2024-06-27 22:08:55,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 513 flow [2024-06-27 22:08:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:08:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:08:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-27 22:08:55,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2024-06-27 22:08:55,469 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 303 flow. Second operand 6 states and 109 transitions. [2024-06-27 22:08:55,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 513 flow [2024-06-27 22:08:55,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 505 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 22:08:55,482 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 393 flow [2024-06-27 22:08:55,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-06-27 22:08:55,484 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-06-27 22:08:55,485 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 393 flow [2024-06-27 22:08:55,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:55,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:55,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:08:55,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:55,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1087826269, now seen corresponding path program 3 times [2024-06-27 22:08:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791205522] [2024-06-27 22:08:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:56,277 INFO 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:08:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:56,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791205522] [2024-06-27 22:08:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791205522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:08:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293537893] [2024-06-27 22:08:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:56,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:08:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:08:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:08:56,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:08:56,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:56,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:56,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:08:56,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:56,692 INFO L124 PetriNetUnfolderBase]: 407/835 cut-off events. [2024-06-27 22:08:56,692 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-06-27 22:08:56,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 835 events. 407/835 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4415 event pairs, 121 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 2522. Up to 646 conditions per place. [2024-06-27 22:08:56,699 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 54 selfloop transitions, 24 changer transitions 0/86 dead transitions. [2024-06-27 22:08:56,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 637 flow [2024-06-27 22:08:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:08:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:08:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 22:08:56,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-27 22:08:56,701 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 393 flow. Second operand 7 states and 124 transitions. [2024-06-27 22:08:56,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 637 flow [2024-06-27 22:08:56,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 604 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:08:56,706 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 484 flow [2024-06-27 22:08:56,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2024-06-27 22:08:56,708 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-06-27 22:08:56,708 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 484 flow [2024-06-27 22:08:56,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:56,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:56,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:08:56,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:56,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1286026003, now seen corresponding path program 1 times [2024-06-27 22:08:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301054258] [2024-06-27 22:08:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:58,022 INFO 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:08:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301054258] [2024-06-27 22:08:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301054258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538703696] [2024-06-27 22:08:58,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:58,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:58,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:08:58,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 484 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:58,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:58,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:08:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:58,554 INFO L124 PetriNetUnfolderBase]: 424/867 cut-off events. [2024-06-27 22:08:58,554 INFO L125 PetriNetUnfolderBase]: For 2122/2122 co-relation queries the response was YES. [2024-06-27 22:08:58,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 867 events. 424/867 cut-off events. For 2122/2122 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4643 event pairs, 129 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 2750. Up to 651 conditions per place. [2024-06-27 22:08:58,560 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 62 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-27 22:08:58,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 768 flow [2024-06-27 22:08:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:08:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:08:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 22:08:58,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2024-06-27 22:08:58,562 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 484 flow. Second operand 7 states and 127 transitions. [2024-06-27 22:08:58,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 768 flow [2024-06-27 22:08:58,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 713 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:08:58,570 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 570 flow [2024-06-27 22:08:58,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=570, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-06-27 22:08:58,572 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2024-06-27 22:08:58,572 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 570 flow [2024-06-27 22:08:58,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:58,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:58,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:58,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:08:58,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:08:58,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1286147120, now seen corresponding path program 1 times [2024-06-27 22:08:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552043919] [2024-06-27 22:08:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:00,105 INFO 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:09:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552043919] [2024-06-27 22:09:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552043919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957193765] [2024-06-27 22:09:00,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:00,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:00,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:00,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 570 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:00,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:00,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:00,615 INFO L124 PetriNetUnfolderBase]: 446/873 cut-off events. [2024-06-27 22:09:00,615 INFO L125 PetriNetUnfolderBase]: For 2699/2699 co-relation queries the response was YES. [2024-06-27 22:09:00,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 873 events. 446/873 cut-off events. For 2699/2699 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4522 event pairs, 100 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 2970. Up to 655 conditions per place. [2024-06-27 22:09:00,621 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 60 selfloop transitions, 33 changer transitions 0/101 dead transitions. [2024-06-27 22:09:00,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 101 transitions, 826 flow [2024-06-27 22:09:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:09:00,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-27 22:09:00,623 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 570 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:09:00,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 101 transitions, 826 flow [2024-06-27 22:09:00,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 795 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-27 22:09:00,630 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 635 flow [2024-06-27 22:09:00,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2024-06-27 22:09:00,631 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2024-06-27 22:09:00,631 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 635 flow [2024-06-27 22:09:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:00,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:00,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:00,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:09:00,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:00,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1286146903, now seen corresponding path program 2 times [2024-06-27 22:09:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61266271] [2024-06-27 22:09:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:01,985 INFO 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:09:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61266271] [2024-06-27 22:09:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61266271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:01,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:01,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009992055] [2024-06-27 22:09:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:01,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:01,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:01,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:02,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:02,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 635 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:02,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:02,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:02,458 INFO L124 PetriNetUnfolderBase]: 454/889 cut-off events. [2024-06-27 22:09:02,458 INFO L125 PetriNetUnfolderBase]: For 3319/3319 co-relation queries the response was YES. [2024-06-27 22:09:02,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 889 events. 454/889 cut-off events. For 3319/3319 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4645 event pairs, 102 based on Foata normal form. 1/859 useless extension candidates. Maximal degree in co-relation 3261. Up to 678 conditions per place. [2024-06-27 22:09:02,465 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 61 selfloop transitions, 33 changer transitions 0/102 dead transitions. [2024-06-27 22:09:02,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 893 flow [2024-06-27 22:09:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 22:09:02,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:09:02,467 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 635 flow. Second operand 7 states and 128 transitions. [2024-06-27 22:09:02,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 893 flow [2024-06-27 22:09:02,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 102 transitions, 823 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:02,480 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 672 flow [2024-06-27 22:09:02,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-06-27 22:09:02,481 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-06-27 22:09:02,481 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 672 flow [2024-06-27 22:09:02,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:02,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:02,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:02,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:09:02,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:02,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1464468110, now seen corresponding path program 2 times [2024-06-27 22:09:02,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847351050] [2024-06-27 22:09:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847351050] [2024-06-27 22:09:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847351050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217421850] [2024-06-27 22:09:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:04,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:04,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:04,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:04,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:04,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:04,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 672 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:04,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:04,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:04,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:04,937 INFO L124 PetriNetUnfolderBase]: 482/958 cut-off events. [2024-06-27 22:09:04,938 INFO L125 PetriNetUnfolderBase]: For 4179/4179 co-relation queries the response was YES. [2024-06-27 22:09:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 958 events. 482/958 cut-off events. For 4179/4179 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5123 event pairs, 109 based on Foata normal form. 1/920 useless extension candidates. Maximal degree in co-relation 3608. Up to 649 conditions per place. [2024-06-27 22:09:04,946 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 58 selfloop transitions, 51 changer transitions 0/117 dead transitions. [2024-06-27 22:09:04,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 1094 flow [2024-06-27 22:09:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:09:04,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 22:09:04,948 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 672 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:09:04,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 1094 flow [2024-06-27 22:09:04,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 1011 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:04,957 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 870 flow [2024-06-27 22:09:04,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2024-06-27 22:09:04,958 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-06-27 22:09:04,958 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 870 flow [2024-06-27 22:09:04,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:04,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:04,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:04,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:09:04,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:04,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1290817580, now seen corresponding path program 3 times [2024-06-27 22:09:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800434232] [2024-06-27 22:09:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800434232] [2024-06-27 22:09:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800434232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507467325] [2024-06-27 22:09:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:06,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:06,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:06,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 870 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:06,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:06,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:06,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:06,775 INFO L124 PetriNetUnfolderBase]: 490/975 cut-off events. [2024-06-27 22:09:06,775 INFO L125 PetriNetUnfolderBase]: For 5240/5240 co-relation queries the response was YES. [2024-06-27 22:09:06,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 975 events. 490/975 cut-off events. For 5240/5240 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5216 event pairs, 113 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 4051. Up to 705 conditions per place. [2024-06-27 22:09:06,785 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 67 selfloop transitions, 44 changer transitions 0/119 dead transitions. [2024-06-27 22:09:06,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 1193 flow [2024-06-27 22:09:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 22:09:06,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:09:06,787 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 870 flow. Second operand 8 states and 138 transitions. [2024-06-27 22:09:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 1193 flow [2024-06-27 22:09:06,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 1127 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-27 22:09:06,807 INFO L231 Difference]: Finished difference. Result has 92 places, 104 transitions, 939 flow [2024-06-27 22:09:06,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=939, PETRI_PLACES=92, PETRI_TRANSITIONS=104} [2024-06-27 22:09:06,808 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-06-27 22:09:06,809 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 939 flow [2024-06-27 22:09:06,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:06,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:06,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:06,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:09:06,810 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:06,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1464200983, now seen corresponding path program 3 times [2024-06-27 22:09:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493494939] [2024-06-27 22:09:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:08,237 INFO 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:09:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493494939] [2024-06-27 22:09:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493494939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:08,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652469032] [2024-06-27 22:09:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:08,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:08,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:08,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 939 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:08,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:08,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:08,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:08,743 INFO L124 PetriNetUnfolderBase]: 498/987 cut-off events. [2024-06-27 22:09:08,744 INFO L125 PetriNetUnfolderBase]: For 5609/5609 co-relation queries the response was YES. [2024-06-27 22:09:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 987 events. 498/987 cut-off events. For 5609/5609 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5280 event pairs, 109 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 4234. Up to 700 conditions per place. [2024-06-27 22:09:08,753 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 70 selfloop transitions, 47 changer transitions 0/125 dead transitions. [2024-06-27 22:09:08,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 1321 flow [2024-06-27 22:09:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 22:09:08,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:09:08,755 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 939 flow. Second operand 7 states and 128 transitions. [2024-06-27 22:09:08,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 1321 flow [2024-06-27 22:09:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 1223 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:08,802 INFO L231 Difference]: Finished difference. Result has 93 places, 110 transitions, 1027 flow [2024-06-27 22:09:08,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1027, PETRI_PLACES=93, PETRI_TRANSITIONS=110} [2024-06-27 22:09:08,804 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2024-06-27 22:09:08,804 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 1027 flow [2024-06-27 22:09:08,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:08,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:08,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:08,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:09:08,805 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:08,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1991159795, now seen corresponding path program 4 times [2024-06-27 22:09:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457656831] [2024-06-27 22:09:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457656831] [2024-06-27 22:09:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457656831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602507133] [2024-06-27 22:09:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:09,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:09,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 1027 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:09,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:09,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:09,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:10,192 INFO L124 PetriNetUnfolderBase]: 526/1039 cut-off events. [2024-06-27 22:09:10,192 INFO L125 PetriNetUnfolderBase]: For 6687/6687 co-relation queries the response was YES. [2024-06-27 22:09:10,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 1039 events. 526/1039 cut-off events. For 6687/6687 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5616 event pairs, 105 based on Foata normal form. 1/1004 useless extension candidates. Maximal degree in co-relation 4621. Up to 793 conditions per place. [2024-06-27 22:09:10,200 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 100 selfloop transitions, 39 changer transitions 0/147 dead transitions. [2024-06-27 22:09:10,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1529 flow [2024-06-27 22:09:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 22:09:10,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 22:09:10,202 INFO L175 Difference]: Start difference. First operand has 93 places, 110 transitions, 1027 flow. Second operand 9 states and 156 transitions. [2024-06-27 22:09:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1529 flow [2024-06-27 22:09:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 147 transitions, 1459 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:09:10,218 INFO L231 Difference]: Finished difference. Result has 101 places, 125 transitions, 1246 flow [2024-06-27 22:09:10,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1246, PETRI_PLACES=101, PETRI_TRANSITIONS=125} [2024-06-27 22:09:10,219 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 61 predicate places. [2024-06-27 22:09:10,219 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 125 transitions, 1246 flow [2024-06-27 22:09:10,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:10,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:10,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:09:10,220 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:10,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1248123279, now seen corresponding path program 5 times [2024-06-27 22:09:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698967838] [2024-06-27 22:09:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:11,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:09:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698967838] [2024-06-27 22:09:11,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698967838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:11,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:11,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995353822] [2024-06-27 22:09:11,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:11,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:11,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:11,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:11,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 125 transitions, 1246 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:11,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:11,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:11,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:11,710 INFO L124 PetriNetUnfolderBase]: 555/1100 cut-off events. [2024-06-27 22:09:11,711 INFO L125 PetriNetUnfolderBase]: For 7395/7395 co-relation queries the response was YES. [2024-06-27 22:09:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5127 conditions, 1100 events. 555/1100 cut-off events. For 7395/7395 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6022 event pairs, 108 based on Foata normal form. 1/1062 useless extension candidates. Maximal degree in co-relation 5080. Up to 810 conditions per place. [2024-06-27 22:09:11,721 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 112 selfloop transitions, 52 changer transitions 0/172 dead transitions. [2024-06-27 22:09:11,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 172 transitions, 1922 flow [2024-06-27 22:09:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 22:09:11,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 22:09:11,723 INFO L175 Difference]: Start difference. First operand has 101 places, 125 transitions, 1246 flow. Second operand 7 states and 138 transitions. [2024-06-27 22:09:11,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 172 transitions, 1922 flow [2024-06-27 22:09:11,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 172 transitions, 1775 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:11,744 INFO L231 Difference]: Finished difference. Result has 105 places, 146 transitions, 1534 flow [2024-06-27 22:09:11,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1534, PETRI_PLACES=105, PETRI_TRANSITIONS=146} [2024-06-27 22:09:11,745 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2024-06-27 22:09:11,745 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 146 transitions, 1534 flow [2024-06-27 22:09:11,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:11,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:11,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:09:11,746 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:11,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1224765182, now seen corresponding path program 4 times [2024-06-27 22:09:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503338669] [2024-06-27 22:09:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503338669] [2024-06-27 22:09:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503338669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:12,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474211404] [2024-06-27 22:09:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:12,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:12,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 146 transitions, 1534 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:12,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:12,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:12,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:13,388 INFO L124 PetriNetUnfolderBase]: 559/1105 cut-off events. [2024-06-27 22:09:13,389 INFO L125 PetriNetUnfolderBase]: For 7903/7903 co-relation queries the response was YES. [2024-06-27 22:09:13,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5249 conditions, 1105 events. 559/1105 cut-off events. For 7903/7903 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6107 event pairs, 107 based on Foata normal form. 2/1067 useless extension candidates. Maximal degree in co-relation 5201. Up to 797 conditions per place. [2024-06-27 22:09:13,399 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 102 selfloop transitions, 61 changer transitions 0/171 dead transitions. [2024-06-27 22:09:13,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 171 transitions, 1969 flow [2024-06-27 22:09:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 22:09:13,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-06-27 22:09:13,401 INFO L175 Difference]: Start difference. First operand has 105 places, 146 transitions, 1534 flow. Second operand 7 states and 134 transitions. [2024-06-27 22:09:13,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 171 transitions, 1969 flow [2024-06-27 22:09:13,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1886 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 22:09:13,425 INFO L231 Difference]: Finished difference. Result has 110 places, 152 transitions, 1648 flow [2024-06-27 22:09:13,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1648, PETRI_PLACES=110, PETRI_TRANSITIONS=152} [2024-06-27 22:09:13,425 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-06-27 22:09:13,425 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 152 transitions, 1648 flow [2024-06-27 22:09:13,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:13,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:13,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:13,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:09:13,426 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:13,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1248002379, now seen corresponding path program 6 times [2024-06-27 22:09:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:13,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196891085] [2024-06-27 22:09:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196891085] [2024-06-27 22:09:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196891085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588764045] [2024-06-27 22:09:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:14,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:14,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:14,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 152 transitions, 1648 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:14,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:14,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:14,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:15,153 INFO L124 PetriNetUnfolderBase]: 561/1111 cut-off events. [2024-06-27 22:09:15,153 INFO L125 PetriNetUnfolderBase]: For 8282/8282 co-relation queries the response was YES. [2024-06-27 22:09:15,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 1111 events. 561/1111 cut-off events. For 8282/8282 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6148 event pairs, 107 based on Foata normal form. 1/1072 useless extension candidates. Maximal degree in co-relation 5267. Up to 818 conditions per place. [2024-06-27 22:09:15,163 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 106 selfloop transitions, 60 changer transitions 0/174 dead transitions. [2024-06-27 22:09:15,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 2058 flow [2024-06-27 22:09:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 22:09:15,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:09:15,165 INFO L175 Difference]: Start difference. First operand has 110 places, 152 transitions, 1648 flow. Second operand 7 states and 133 transitions. [2024-06-27 22:09:15,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 174 transitions, 2058 flow [2024-06-27 22:09:15,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 174 transitions, 1962 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:09:15,190 INFO L231 Difference]: Finished difference. Result has 114 places, 155 transitions, 1706 flow [2024-06-27 22:09:15,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1706, PETRI_PLACES=114, PETRI_TRANSITIONS=155} [2024-06-27 22:09:15,190 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 74 predicate places. [2024-06-27 22:09:15,191 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 1706 flow [2024-06-27 22:09:15,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:15,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:15,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:15,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:09:15,191 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:15,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash -635430700, now seen corresponding path program 1 times [2024-06-27 22:09:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:15,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827351829] [2024-06-27 22:09:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:15,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:16,734 INFO 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:09:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827351829] [2024-06-27 22:09:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827351829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750873058] [2024-06-27 22:09:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:16,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:16,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:16,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:16,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:16,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:17,246 INFO L124 PetriNetUnfolderBase]: 572/1137 cut-off events. [2024-06-27 22:09:17,246 INFO L125 PetriNetUnfolderBase]: For 9173/9173 co-relation queries the response was YES. [2024-06-27 22:09:17,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1137 events. 572/1137 cut-off events. For 9173/9173 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6361 event pairs, 113 based on Foata normal form. 1/1097 useless extension candidates. Maximal degree in co-relation 5400. Up to 834 conditions per place. [2024-06-27 22:09:17,255 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 113 selfloop transitions, 55 changer transitions 0/176 dead transitions. [2024-06-27 22:09:17,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 176 transitions, 2136 flow [2024-06-27 22:09:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 22:09:17,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:09:17,257 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 1706 flow. Second operand 8 states and 145 transitions. [2024-06-27 22:09:17,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 176 transitions, 2136 flow [2024-06-27 22:09:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 1912 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:09:17,282 INFO L231 Difference]: Finished difference. Result has 115 places, 157 transitions, 1624 flow [2024-06-27 22:09:17,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1624, PETRI_PLACES=115, PETRI_TRANSITIONS=157} [2024-06-27 22:09:17,283 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2024-06-27 22:09:17,283 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 157 transitions, 1624 flow [2024-06-27 22:09:17,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:17,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:17,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:09:17,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -635424190, now seen corresponding path program 2 times [2024-06-27 22:09:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:17,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638687414] [2024-06-27 22:09:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638687414] [2024-06-27 22:09:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638687414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782193155] [2024-06-27 22:09:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:19,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:19,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 157 transitions, 1624 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:19,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:19,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:19,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:19,489 INFO L124 PetriNetUnfolderBase]: 586/1169 cut-off events. [2024-06-27 22:09:19,489 INFO L125 PetriNetUnfolderBase]: For 9908/9908 co-relation queries the response was YES. [2024-06-27 22:09:19,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 1169 events. 586/1169 cut-off events. For 9908/9908 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6623 event pairs, 109 based on Foata normal form. 1/1128 useless extension candidates. Maximal degree in co-relation 5507. Up to 814 conditions per place. [2024-06-27 22:09:19,496 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 109 selfloop transitions, 67 changer transitions 0/184 dead transitions. [2024-06-27 22:09:19,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 184 transitions, 2134 flow [2024-06-27 22:09:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 22:09:19,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-06-27 22:09:19,498 INFO L175 Difference]: Start difference. First operand has 115 places, 157 transitions, 1624 flow. Second operand 9 states and 157 transitions. [2024-06-27 22:09:19,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 184 transitions, 2134 flow [2024-06-27 22:09:19,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 184 transitions, 2018 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:19,525 INFO L231 Difference]: Finished difference. Result has 118 places, 162 transitions, 1724 flow [2024-06-27 22:09:19,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1724, PETRI_PLACES=118, PETRI_TRANSITIONS=162} [2024-06-27 22:09:19,526 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2024-06-27 22:09:19,526 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 162 transitions, 1724 flow [2024-06-27 22:09:19,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:19,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:19,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:19,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:09:19,527 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:19,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -635423942, now seen corresponding path program 1 times [2024-06-27 22:09:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126707103] [2024-06-27 22:09:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126707103] [2024-06-27 22:09:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126707103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:21,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934736307] [2024-06-27 22:09:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:21,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:21,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 162 transitions, 1724 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:21,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:21,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:21,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:21,475 INFO L124 PetriNetUnfolderBase]: 594/1201 cut-off events. [2024-06-27 22:09:21,475 INFO L125 PetriNetUnfolderBase]: For 12627/12627 co-relation queries the response was YES. [2024-06-27 22:09:21,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5813 conditions, 1201 events. 594/1201 cut-off events. For 12627/12627 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7004 event pairs, 115 based on Foata normal form. 4/1158 useless extension candidates. Maximal degree in co-relation 5761. Up to 735 conditions per place. [2024-06-27 22:09:21,482 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 95 selfloop transitions, 82 changer transitions 0/189 dead transitions. [2024-06-27 22:09:21,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 189 transitions, 2283 flow [2024-06-27 22:09:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 22:09:21,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 22:09:21,485 INFO L175 Difference]: Start difference. First operand has 118 places, 162 transitions, 1724 flow. Second operand 7 states and 138 transitions. [2024-06-27 22:09:21,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 189 transitions, 2283 flow [2024-06-27 22:09:21,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 189 transitions, 2180 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:21,514 INFO L231 Difference]: Finished difference. Result has 121 places, 168 transitions, 1911 flow [2024-06-27 22:09:21,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1911, PETRI_PLACES=121, PETRI_TRANSITIONS=168} [2024-06-27 22:09:21,515 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-06-27 22:09:21,515 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 168 transitions, 1911 flow [2024-06-27 22:09:21,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:21,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:21,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:21,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:09:21,516 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:21,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash 365492010, now seen corresponding path program 3 times [2024-06-27 22:09:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930472868] [2024-06-27 22:09:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:23,202 INFO 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:09:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930472868] [2024-06-27 22:09:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930472868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:23,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:23,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983472959] [2024-06-27 22:09:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:23,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:23,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:23,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 168 transitions, 1911 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:23,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:23,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:23,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:23,753 INFO L124 PetriNetUnfolderBase]: 656/1287 cut-off events. [2024-06-27 22:09:23,753 INFO L125 PetriNetUnfolderBase]: For 13673/13673 co-relation queries the response was YES. [2024-06-27 22:09:23,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6817 conditions, 1287 events. 656/1287 cut-off events. For 13673/13673 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7356 event pairs, 118 based on Foata normal form. 1/1244 useless extension candidates. Maximal degree in co-relation 6763. Up to 812 conditions per place. [2024-06-27 22:09:23,763 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 91 selfloop transitions, 99 changer transitions 0/198 dead transitions. [2024-06-27 22:09:23,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 198 transitions, 2571 flow [2024-06-27 22:09:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:09:23,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:09:23,765 INFO L175 Difference]: Start difference. First operand has 121 places, 168 transitions, 1911 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:09:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 198 transitions, 2571 flow [2024-06-27 22:09:23,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 198 transitions, 2478 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 22:09:23,802 INFO L231 Difference]: Finished difference. Result has 127 places, 180 transitions, 2255 flow [2024-06-27 22:09:23,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2255, PETRI_PLACES=127, PETRI_TRANSITIONS=180} [2024-06-27 22:09:23,803 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2024-06-27 22:09:23,803 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 180 transitions, 2255 flow [2024-06-27 22:09:23,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:23,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:23,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:23,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:09:23,804 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:23,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1846127816, now seen corresponding path program 2 times [2024-06-27 22:09:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450339388] [2024-06-27 22:09:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:25,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:09:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:25,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450339388] [2024-06-27 22:09:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450339388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:25,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:25,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069865602] [2024-06-27 22:09:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:25,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:25,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:25,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 180 transitions, 2255 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:25,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:25,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:25,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:25,563 INFO L124 PetriNetUnfolderBase]: 677/1346 cut-off events. [2024-06-27 22:09:25,563 INFO L125 PetriNetUnfolderBase]: For 16054/16054 co-relation queries the response was YES. [2024-06-27 22:09:25,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 1346 events. 677/1346 cut-off events. For 16054/16054 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8115 event pairs, 103 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 7205. Up to 790 conditions per place. [2024-06-27 22:09:25,575 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 118 selfloop transitions, 85 changer transitions 0/215 dead transitions. [2024-06-27 22:09:25,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 215 transitions, 3000 flow [2024-06-27 22:09:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 22:09:25,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-06-27 22:09:25,577 INFO L175 Difference]: Start difference. First operand has 127 places, 180 transitions, 2255 flow. Second operand 7 states and 143 transitions. [2024-06-27 22:09:25,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 215 transitions, 3000 flow [2024-06-27 22:09:25,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 215 transitions, 2849 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 22:09:25,619 INFO L231 Difference]: Finished difference. Result has 132 places, 190 transitions, 2444 flow [2024-06-27 22:09:25,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2444, PETRI_PLACES=132, PETRI_TRANSITIONS=190} [2024-06-27 22:09:25,620 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-27 22:09:25,620 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 190 transitions, 2444 flow [2024-06-27 22:09:25,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:25,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:25,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:25,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:09:25,621 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:25,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1845831146, now seen corresponding path program 3 times [2024-06-27 22:09:25,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:25,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978574590] [2024-06-27 22:09:25,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:25,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:27,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:09:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978574590] [2024-06-27 22:09:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978574590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:27,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008679984] [2024-06-27 22:09:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:27,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:27,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:27,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:27,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 190 transitions, 2444 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:27,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:27,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:27,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:27,817 INFO L124 PetriNetUnfolderBase]: 737/1449 cut-off events. [2024-06-27 22:09:27,817 INFO L125 PetriNetUnfolderBase]: For 17234/17234 co-relation queries the response was YES. [2024-06-27 22:09:27,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 1449 events. 737/1449 cut-off events. For 17234/17234 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8531 event pairs, 141 based on Foata normal form. 2/1398 useless extension candidates. Maximal degree in co-relation 8250. Up to 1119 conditions per place. [2024-06-27 22:09:27,828 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 192 selfloop transitions, 18 changer transitions 0/218 dead transitions. [2024-06-27 22:09:27,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 218 transitions, 3025 flow [2024-06-27 22:09:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 22:09:27,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:09:27,833 INFO L175 Difference]: Start difference. First operand has 132 places, 190 transitions, 2444 flow. Second operand 8 states and 142 transitions. [2024-06-27 22:09:27,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 218 transitions, 3025 flow [2024-06-27 22:09:27,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 218 transitions, 2906 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-06-27 22:09:27,886 INFO L231 Difference]: Finished difference. Result has 139 places, 193 transitions, 2418 flow [2024-06-27 22:09:27,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2418, PETRI_PLACES=139, PETRI_TRANSITIONS=193} [2024-06-27 22:09:27,886 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-27 22:09:27,887 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 193 transitions, 2418 flow [2024-06-27 22:09:27,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:27,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:27,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:27,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:09:27,887 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:27,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1854408784, now seen corresponding path program 4 times [2024-06-27 22:09:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593384771] [2024-06-27 22:09:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:29,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593384771] [2024-06-27 22:09:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593384771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210883148] [2024-06-27 22:09:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:29,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:29,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 193 transitions, 2418 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:29,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:29,940 INFO L124 PetriNetUnfolderBase]: 745/1474 cut-off events. [2024-06-27 22:09:29,940 INFO L125 PetriNetUnfolderBase]: For 17005/17005 co-relation queries the response was YES. [2024-06-27 22:09:29,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 1474 events. 745/1474 cut-off events. For 17005/17005 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8748 event pairs, 134 based on Foata normal form. 1/1420 useless extension candidates. Maximal degree in co-relation 8336. Up to 1056 conditions per place. [2024-06-27 22:09:29,952 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 129 selfloop transitions, 76 changer transitions 0/213 dead transitions. [2024-06-27 22:09:29,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 213 transitions, 2933 flow [2024-06-27 22:09:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:09:29,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-27 22:09:29,955 INFO L175 Difference]: Start difference. First operand has 139 places, 193 transitions, 2418 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:09:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 213 transitions, 2933 flow [2024-06-27 22:09:30,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 213 transitions, 2890 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:30,009 INFO L231 Difference]: Finished difference. Result has 142 places, 196 transitions, 2588 flow [2024-06-27 22:09:30,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2588, PETRI_PLACES=142, PETRI_TRANSITIONS=196} [2024-06-27 22:09:30,009 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 102 predicate places. [2024-06-27 22:09:30,010 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 196 transitions, 2588 flow [2024-06-27 22:09:30,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:30,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:30,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:09:30,010 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:30,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1091265502, now seen corresponding path program 4 times [2024-06-27 22:09:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051039353] [2024-06-27 22:09:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:31,238 INFO 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:09:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051039353] [2024-06-27 22:09:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051039353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:09:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18709595] [2024-06-27 22:09:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:31,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:09:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:09:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:09:31,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:09:31,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 196 transitions, 2588 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:31,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:31,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:09:31,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:31,589 INFO L124 PetriNetUnfolderBase]: 710/1454 cut-off events. [2024-06-27 22:09:31,589 INFO L125 PetriNetUnfolderBase]: For 18841/18841 co-relation queries the response was YES. [2024-06-27 22:09:31,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8219 conditions, 1454 events. 710/1454 cut-off events. For 18841/18841 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9059 event pairs, 125 based on Foata normal form. 2/1391 useless extension candidates. Maximal degree in co-relation 8154. Up to 967 conditions per place. [2024-06-27 22:09:31,598 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 145 selfloop transitions, 70 changer transitions 0/228 dead transitions. [2024-06-27 22:09:31,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 228 transitions, 3326 flow [2024-06-27 22:09:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-27 22:09:31,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-27 22:09:31,600 INFO L175 Difference]: Start difference. First operand has 142 places, 196 transitions, 2588 flow. Second operand 7 states and 144 transitions. [2024-06-27 22:09:31,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 228 transitions, 3326 flow [2024-06-27 22:09:31,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 228 transitions, 3144 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:31,642 INFO L231 Difference]: Finished difference. Result has 145 places, 209 transitions, 2840 flow [2024-06-27 22:09:31,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2840, PETRI_PLACES=145, PETRI_TRANSITIONS=209} [2024-06-27 22:09:31,642 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2024-06-27 22:09:31,642 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 209 transitions, 2840 flow [2024-06-27 22:09:31,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:31,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:31,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:31,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:09:31,643 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:31,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1091265750, now seen corresponding path program 5 times [2024-06-27 22:09:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793794307] [2024-06-27 22:09:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:33,610 INFO 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:09:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793794307] [2024-06-27 22:09:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793794307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854948852] [2024-06-27 22:09:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:33,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:33,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:33,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:33,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:33,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 209 transitions, 2840 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:33,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:33,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:33,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:34,214 INFO L124 PetriNetUnfolderBase]: 795/1580 cut-off events. [2024-06-27 22:09:34,214 INFO L125 PetriNetUnfolderBase]: For 21374/21374 co-relation queries the response was YES. [2024-06-27 22:09:34,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 1580 events. 795/1580 cut-off events. For 21374/21374 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9616 event pairs, 139 based on Foata normal form. 1/1521 useless extension candidates. Maximal degree in co-relation 9528. Up to 1114 conditions per place. [2024-06-27 22:09:34,224 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 143 selfloop transitions, 86 changer transitions 0/237 dead transitions. [2024-06-27 22:09:34,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 237 transitions, 3554 flow [2024-06-27 22:09:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 22:09:34,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:09:34,226 INFO L175 Difference]: Start difference. First operand has 145 places, 209 transitions, 2840 flow. Second operand 8 states and 147 transitions. [2024-06-27 22:09:34,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 237 transitions, 3554 flow [2024-06-27 22:09:34,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 237 transitions, 3389 flow, removed 69 selfloop flow, removed 1 redundant places. [2024-06-27 22:09:34,285 INFO L231 Difference]: Finished difference. Result has 153 places, 218 transitions, 3078 flow [2024-06-27 22:09:34,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3078, PETRI_PLACES=153, PETRI_TRANSITIONS=218} [2024-06-27 22:09:34,286 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2024-06-27 22:09:34,286 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 218 transitions, 3078 flow [2024-06-27 22:09:34,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:34,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:34,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:34,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:09:34,287 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:34,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1850654576, now seen corresponding path program 6 times [2024-06-27 22:09:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331124820] [2024-06-27 22:09:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:35,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:09:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331124820] [2024-06-27 22:09:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331124820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872383037] [2024-06-27 22:09:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:35,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:35,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:35,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 218 transitions, 3078 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:35,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:35,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:36,170 INFO L124 PetriNetUnfolderBase]: 795/1578 cut-off events. [2024-06-27 22:09:36,171 INFO L125 PetriNetUnfolderBase]: For 21464/21464 co-relation queries the response was YES. [2024-06-27 22:09:36,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9701 conditions, 1578 events. 795/1578 cut-off events. For 21464/21464 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9575 event pairs, 133 based on Foata normal form. 1/1519 useless extension candidates. Maximal degree in co-relation 9629. Up to 1175 conditions per place. [2024-06-27 22:09:36,180 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 170 selfloop transitions, 65 changer transitions 0/243 dead transitions. [2024-06-27 22:09:36,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 243 transitions, 3664 flow [2024-06-27 22:09:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 22:09:36,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 22:09:36,183 INFO L175 Difference]: Start difference. First operand has 153 places, 218 transitions, 3078 flow. Second operand 8 states and 149 transitions. [2024-06-27 22:09:36,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 243 transitions, 3664 flow [2024-06-27 22:09:36,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 243 transitions, 3447 flow, removed 65 selfloop flow, removed 4 redundant places. [2024-06-27 22:09:36,234 INFO L231 Difference]: Finished difference. Result has 157 places, 221 transitions, 3052 flow [2024-06-27 22:09:36,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2861, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3052, PETRI_PLACES=157, PETRI_TRANSITIONS=221} [2024-06-27 22:09:36,235 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-06-27 22:09:36,236 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 221 transitions, 3052 flow [2024-06-27 22:09:36,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:36,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:36,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:36,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:09:36,236 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:36,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash 686985804, now seen corresponding path program 7 times [2024-06-27 22:09:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346579330] [2024-06-27 22:09:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346579330] [2024-06-27 22:09:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346579330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:37,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:37,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:37,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650996741] [2024-06-27 22:09:37,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:37,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:37,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:37,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:37,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:38,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:38,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 221 transitions, 3052 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:38,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:38,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:38,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:38,701 INFO L124 PetriNetUnfolderBase]: 818/1642 cut-off events. [2024-06-27 22:09:38,701 INFO L125 PetriNetUnfolderBase]: For 21156/21156 co-relation queries the response was YES. [2024-06-27 22:09:38,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9963 conditions, 1642 events. 818/1642 cut-off events. For 21156/21156 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10222 event pairs, 132 based on Foata normal form. 1/1578 useless extension candidates. Maximal degree in co-relation 9890. Up to 1153 conditions per place. [2024-06-27 22:09:38,712 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 162 selfloop transitions, 92 changer transitions 0/262 dead transitions. [2024-06-27 22:09:38,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 262 transitions, 3881 flow [2024-06-27 22:09:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 22:09:38,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:09:38,713 INFO L175 Difference]: Start difference. First operand has 157 places, 221 transitions, 3052 flow. Second operand 9 states and 162 transitions. [2024-06-27 22:09:38,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 262 transitions, 3881 flow [2024-06-27 22:09:38,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 262 transitions, 3718 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:38,772 INFO L231 Difference]: Finished difference. Result has 161 places, 238 transitions, 3400 flow [2024-06-27 22:09:38,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3400, PETRI_PLACES=161, PETRI_TRANSITIONS=238} [2024-06-27 22:09:38,772 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2024-06-27 22:09:38,773 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 238 transitions, 3400 flow [2024-06-27 22:09:38,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:38,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:38,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:09:38,773 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:38,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1082683710, now seen corresponding path program 1 times [2024-06-27 22:09:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783800290] [2024-06-27 22:09:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:40,912 INFO 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:09:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783800290] [2024-06-27 22:09:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783800290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:09:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445235674] [2024-06-27 22:09:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:40,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:09:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:09:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:09:41,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:41,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 238 transitions, 3400 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:09:41,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:41,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:41,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:41,666 INFO L124 PetriNetUnfolderBase]: 822/1645 cut-off events. [2024-06-27 22:09:41,666 INFO L125 PetriNetUnfolderBase]: For 23011/23011 co-relation queries the response was YES. [2024-06-27 22:09:41,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10150 conditions, 1645 events. 822/1645 cut-off events. For 23011/23011 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10228 event pairs, 153 based on Foata normal form. 2/1584 useless extension candidates. Maximal degree in co-relation 10074. Up to 1271 conditions per place. [2024-06-27 22:09:41,680 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 243 selfloop transitions, 19 changer transitions 0/270 dead transitions. [2024-06-27 22:09:41,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 270 transitions, 4109 flow [2024-06-27 22:09:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:09:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:09:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:09:41,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:09:41,682 INFO L175 Difference]: Start difference. First operand has 161 places, 238 transitions, 3400 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:09:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 270 transitions, 4109 flow [2024-06-27 22:09:41,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 270 transitions, 3932 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:41,744 INFO L231 Difference]: Finished difference. Result has 169 places, 245 transitions, 3361 flow [2024-06-27 22:09:41,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3361, PETRI_PLACES=169, PETRI_TRANSITIONS=245} [2024-06-27 22:09:41,744 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 129 predicate places. [2024-06-27 22:09:41,744 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 245 transitions, 3361 flow [2024-06-27 22:09:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:09:41,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:41,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:09:41,745 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:41,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1079566318, now seen corresponding path program 1 times [2024-06-27 22:09:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984547159] [2024-06-27 22:09:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:42,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:09:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984547159] [2024-06-27 22:09:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984547159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:42,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428699250] [2024-06-27 22:09:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:42,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:42,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:42,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 245 transitions, 3361 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:42,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:42,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:42,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:43,500 INFO L124 PetriNetUnfolderBase]: 834/1667 cut-off events. [2024-06-27 22:09:43,500 INFO L125 PetriNetUnfolderBase]: For 22982/22982 co-relation queries the response was YES. [2024-06-27 22:09:43,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10368 conditions, 1667 events. 834/1667 cut-off events. For 22982/22982 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10394 event pairs, 121 based on Foata normal form. 2/1604 useless extension candidates. Maximal degree in co-relation 10287. Up to 1263 conditions per place. [2024-06-27 22:09:43,514 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 212 selfloop transitions, 45 changer transitions 0/265 dead transitions. [2024-06-27 22:09:43,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 265 transitions, 3969 flow [2024-06-27 22:09:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:09:43,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:09:43,515 INFO L175 Difference]: Start difference. First operand has 169 places, 245 transitions, 3361 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:09:43,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 265 transitions, 3969 flow [2024-06-27 22:09:43,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 265 transitions, 3920 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 22:09:43,583 INFO L231 Difference]: Finished difference. Result has 174 places, 247 transitions, 3453 flow [2024-06-27 22:09:43,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3312, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3453, PETRI_PLACES=174, PETRI_TRANSITIONS=247} [2024-06-27 22:09:43,584 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2024-06-27 22:09:43,584 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 247 transitions, 3453 flow [2024-06-27 22:09:43,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:43,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:43,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:43,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:09:43,585 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:43,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1657408238, now seen corresponding path program 2 times [2024-06-27 22:09:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:43,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475636400] [2024-06-27 22:09:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:44,597 INFO 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:09:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475636400] [2024-06-27 22:09:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475636400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56402130] [2024-06-27 22:09:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:44,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:44,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:44,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 247 transitions, 3453 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:44,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:44,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:44,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:45,205 INFO L124 PetriNetUnfolderBase]: 859/1710 cut-off events. [2024-06-27 22:09:45,205 INFO L125 PetriNetUnfolderBase]: For 24859/24859 co-relation queries the response was YES. [2024-06-27 22:09:45,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10710 conditions, 1710 events. 859/1710 cut-off events. For 24859/24859 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10719 event pairs, 115 based on Foata normal form. 2/1647 useless extension candidates. Maximal degree in co-relation 10627. Up to 1297 conditions per place. [2024-06-27 22:09:45,218 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 225 selfloop transitions, 38 changer transitions 0/271 dead transitions. [2024-06-27 22:09:45,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 271 transitions, 4111 flow [2024-06-27 22:09:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:09:45,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-27 22:09:45,220 INFO L175 Difference]: Start difference. First operand has 174 places, 247 transitions, 3453 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:09:45,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 271 transitions, 4111 flow [2024-06-27 22:09:45,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 271 transitions, 3990 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 22:09:45,294 INFO L231 Difference]: Finished difference. Result has 177 places, 251 transitions, 3496 flow [2024-06-27 22:09:45,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3496, PETRI_PLACES=177, PETRI_TRANSITIONS=251} [2024-06-27 22:09:45,294 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2024-06-27 22:09:45,294 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 251 transitions, 3496 flow [2024-06-27 22:09:45,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:45,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:45,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:09:45,295 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:45,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1776479858, now seen corresponding path program 3 times [2024-06-27 22:09:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968100524] [2024-06-27 22:09:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:46,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968100524] [2024-06-27 22:09:46,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968100524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334532728] [2024-06-27 22:09:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:46,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:46,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 251 transitions, 3496 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:46,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:46,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:46,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:47,188 INFO L124 PetriNetUnfolderBase]: 871/1734 cut-off events. [2024-06-27 22:09:47,188 INFO L125 PetriNetUnfolderBase]: For 26399/26399 co-relation queries the response was YES. [2024-06-27 22:09:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10886 conditions, 1734 events. 871/1734 cut-off events. For 26399/26399 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10900 event pairs, 126 based on Foata normal form. 2/1671 useless extension candidates. Maximal degree in co-relation 10801. Up to 1308 conditions per place. [2024-06-27 22:09:47,202 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 208 selfloop transitions, 55 changer transitions 0/271 dead transitions. [2024-06-27 22:09:47,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 271 transitions, 4126 flow [2024-06-27 22:09:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:09:47,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:09:47,205 INFO L175 Difference]: Start difference. First operand has 177 places, 251 transitions, 3496 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:09:47,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 271 transitions, 4126 flow [2024-06-27 22:09:47,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 271 transitions, 4023 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:47,283 INFO L231 Difference]: Finished difference. Result has 180 places, 253 transitions, 3561 flow [2024-06-27 22:09:47,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3393, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3561, PETRI_PLACES=180, PETRI_TRANSITIONS=253} [2024-06-27 22:09:47,284 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2024-06-27 22:09:47,284 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 253 transitions, 3561 flow [2024-06-27 22:09:47,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:47,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:47,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:09:47,285 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:47,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -963173656, now seen corresponding path program 1 times [2024-06-27 22:09:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652992751] [2024-06-27 22:09:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:49,395 INFO 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:09:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652992751] [2024-06-27 22:09:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652992751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:09:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656323583] [2024-06-27 22:09:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:49,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:09:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:09:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:09:49,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:49,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 253 transitions, 3561 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:09:49,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:49,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:49,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:50,213 INFO L124 PetriNetUnfolderBase]: 840/1707 cut-off events. [2024-06-27 22:09:50,214 INFO L125 PetriNetUnfolderBase]: For 30457/30457 co-relation queries the response was YES. [2024-06-27 22:09:50,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 1707 events. 840/1707 cut-off events. For 30457/30457 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11005 event pairs, 166 based on Foata normal form. 1/1639 useless extension candidates. Maximal degree in co-relation 10723. Up to 1070 conditions per place. [2024-06-27 22:09:50,227 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 177 selfloop transitions, 97 changer transitions 0/286 dead transitions. [2024-06-27 22:09:50,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 286 transitions, 4518 flow [2024-06-27 22:09:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 22:09:50,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2024-06-27 22:09:50,229 INFO L175 Difference]: Start difference. First operand has 180 places, 253 transitions, 3561 flow. Second operand 9 states and 169 transitions. [2024-06-27 22:09:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 286 transitions, 4518 flow [2024-06-27 22:09:50,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 286 transitions, 4368 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:50,311 INFO L231 Difference]: Finished difference. Result has 184 places, 260 transitions, 3772 flow [2024-06-27 22:09:50,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3411, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3772, PETRI_PLACES=184, PETRI_TRANSITIONS=260} [2024-06-27 22:09:50,312 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 144 predicate places. [2024-06-27 22:09:50,312 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 260 transitions, 3772 flow [2024-06-27 22:09:50,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:09:50,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:50,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:50,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:09:50,313 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:50,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2055507530, now seen corresponding path program 2 times [2024-06-27 22:09:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562875198] [2024-06-27 22:09:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:52,359 INFO 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:09:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562875198] [2024-06-27 22:09:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562875198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:09:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062570111] [2024-06-27 22:09:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:09:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:09:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:09:52,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:52,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 260 transitions, 3772 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:09:52,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:52,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:52,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:53,206 INFO L124 PetriNetUnfolderBase]: 838/1709 cut-off events. [2024-06-27 22:09:53,206 INFO L125 PetriNetUnfolderBase]: For 31119/31119 co-relation queries the response was YES. [2024-06-27 22:09:53,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11083 conditions, 1709 events. 838/1709 cut-off events. For 31119/31119 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11076 event pairs, 104 based on Foata normal form. 1/1639 useless extension candidates. Maximal degree in co-relation 10994. Up to 1070 conditions per place. [2024-06-27 22:09:53,220 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 162 selfloop transitions, 112 changer transitions 0/286 dead transitions. [2024-06-27 22:09:53,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 286 transitions, 4505 flow [2024-06-27 22:09:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 22:09:53,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-06-27 22:09:53,222 INFO L175 Difference]: Start difference. First operand has 184 places, 260 transitions, 3772 flow. Second operand 9 states and 164 transitions. [2024-06-27 22:09:53,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 286 transitions, 4505 flow [2024-06-27 22:09:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 286 transitions, 4392 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 22:09:53,319 INFO L231 Difference]: Finished difference. Result has 190 places, 265 transitions, 4011 flow [2024-06-27 22:09:53,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3665, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4011, PETRI_PLACES=190, PETRI_TRANSITIONS=265} [2024-06-27 22:09:53,320 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 150 predicate places. [2024-06-27 22:09:53,320 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 265 transitions, 4011 flow [2024-06-27 22:09:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:09:53,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:53,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:53,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:09:53,321 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:53,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 530293386, now seen corresponding path program 4 times [2024-06-27 22:09:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593435945] [2024-06-27 22:09:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:54,564 INFO 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:09:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593435945] [2024-06-27 22:09:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593435945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800268018] [2024-06-27 22:09:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:54,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:54,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:09:54,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 265 transitions, 4011 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:09:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:55,188 INFO L124 PetriNetUnfolderBase]: 931/1853 cut-off events. [2024-06-27 22:09:55,188 INFO L125 PetriNetUnfolderBase]: For 34498/34498 co-relation queries the response was YES. [2024-06-27 22:09:55,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12527 conditions, 1853 events. 931/1853 cut-off events. For 34498/34498 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11810 event pairs, 141 based on Foata normal form. 2/1786 useless extension candidates. Maximal degree in co-relation 12435. Up to 1352 conditions per place. [2024-06-27 22:09:55,204 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 202 selfloop transitions, 75 changer transitions 0/285 dead transitions. [2024-06-27 22:09:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 285 transitions, 4675 flow [2024-06-27 22:09:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:09:55,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-27 22:09:55,205 INFO L175 Difference]: Start difference. First operand has 190 places, 265 transitions, 4011 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:09:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 285 transitions, 4675 flow [2024-06-27 22:09:55,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 285 transitions, 4460 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:55,316 INFO L231 Difference]: Finished difference. Result has 192 places, 267 transitions, 4007 flow [2024-06-27 22:09:55,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3796, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4007, PETRI_PLACES=192, PETRI_TRANSITIONS=267} [2024-06-27 22:09:55,317 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2024-06-27 22:09:55,317 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 267 transitions, 4007 flow [2024-06-27 22:09:55,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:55,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:55,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:55,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:09:55,317 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:55,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 530501148, now seen corresponding path program 3 times [2024-06-27 22:09:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919442041] [2024-06-27 22:09:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:57,230 INFO 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:09:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919442041] [2024-06-27 22:09:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919442041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053903784] [2024-06-27 22:09:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:57,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:57,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:57,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:57,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:57,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 267 transitions, 4007 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:57,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:57,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:57,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:57,946 INFO L124 PetriNetUnfolderBase]: 895/1825 cut-off events. [2024-06-27 22:09:57,946 INFO L125 PetriNetUnfolderBase]: For 39154/39154 co-relation queries the response was YES. [2024-06-27 22:09:57,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12268 conditions, 1825 events. 895/1825 cut-off events. For 39154/39154 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12023 event pairs, 150 based on Foata normal form. 1/1751 useless extension candidates. Maximal degree in co-relation 12175. Up to 1224 conditions per place. [2024-06-27 22:09:57,963 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 196 selfloop transitions, 91 changer transitions 0/299 dead transitions. [2024-06-27 22:09:57,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 299 transitions, 5029 flow [2024-06-27 22:09:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-27 22:09:57,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2024-06-27 22:09:57,964 INFO L175 Difference]: Start difference. First operand has 192 places, 267 transitions, 4007 flow. Second operand 8 states and 158 transitions. [2024-06-27 22:09:57,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 299 transitions, 5029 flow [2024-06-27 22:09:58,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 299 transitions, 4834 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:58,077 INFO L231 Difference]: Finished difference. Result has 196 places, 277 transitions, 4259 flow [2024-06-27 22:09:58,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3812, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4259, PETRI_PLACES=196, PETRI_TRANSITIONS=277} [2024-06-27 22:09:58,078 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2024-06-27 22:09:58,078 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 277 transitions, 4259 flow [2024-06-27 22:09:58,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:58,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:58,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:58,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:09:58,078 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:09:58,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 787009098, now seen corresponding path program 4 times [2024-06-27 22:09:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609826774] [2024-06-27 22:09:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:59,548 INFO 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:09:59,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:59,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609826774] [2024-06-27 22:09:59,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609826774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:59,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:59,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:09:59,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243009309] [2024-06-27 22:09:59,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:59,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:09:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:09:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:09:59,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:09:59,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 277 transitions, 4259 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:09:59,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:59,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:09:59,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:00,288 INFO L124 PetriNetUnfolderBase]: 955/1955 cut-off events. [2024-06-27 22:10:00,289 INFO L125 PetriNetUnfolderBase]: For 48991/48991 co-relation queries the response was YES. [2024-06-27 22:10:00,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13779 conditions, 1955 events. 955/1955 cut-off events. For 48991/48991 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13094 event pairs, 122 based on Foata normal form. 2/1878 useless extension candidates. Maximal degree in co-relation 13684. Up to 999 conditions per place. [2024-06-27 22:10:00,307 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 192 selfloop transitions, 115 changer transitions 0/319 dead transitions. [2024-06-27 22:10:00,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 319 transitions, 5602 flow [2024-06-27 22:10:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 22:10:00,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2024-06-27 22:10:00,309 INFO L175 Difference]: Start difference. First operand has 196 places, 277 transitions, 4259 flow. Second operand 9 states and 175 transitions. [2024-06-27 22:10:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 319 transitions, 5602 flow [2024-06-27 22:10:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 319 transitions, 5393 flow, removed 65 selfloop flow, removed 3 redundant places. [2024-06-27 22:10:00,441 INFO L231 Difference]: Finished difference. Result has 204 places, 287 transitions, 4588 flow [2024-06-27 22:10:00,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4060, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4588, PETRI_PLACES=204, PETRI_TRANSITIONS=287} [2024-06-27 22:10:00,441 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 164 predicate places. [2024-06-27 22:10:00,441 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 287 transitions, 4588 flow [2024-06-27 22:10:00,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:10:00,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:00,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:00,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:10:00,443 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:00,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 787001658, now seen corresponding path program 5 times [2024-06-27 22:10:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765031951] [2024-06-27 22:10:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:02,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:10:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765031951] [2024-06-27 22:10:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765031951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293313374] [2024-06-27 22:10:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:02,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:02,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:10:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 287 transitions, 4588 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:10:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:03,080 INFO L124 PetriNetUnfolderBase]: 1015/2050 cut-off events. [2024-06-27 22:10:03,080 INFO L125 PetriNetUnfolderBase]: For 54904/54904 co-relation queries the response was YES. [2024-06-27 22:10:03,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15236 conditions, 2050 events. 1015/2050 cut-off events. For 54904/54904 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13942 event pairs, 148 based on Foata normal form. 1/1974 useless extension candidates. Maximal degree in co-relation 15136. Up to 893 conditions per place. [2024-06-27 22:10:03,100 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 178 selfloop transitions, 144 changer transitions 0/334 dead transitions. [2024-06-27 22:10:03,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 334 transitions, 6144 flow [2024-06-27 22:10:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 22:10:03,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2024-06-27 22:10:03,101 INFO L175 Difference]: Start difference. First operand has 204 places, 287 transitions, 4588 flow. Second operand 9 states and 175 transitions. [2024-06-27 22:10:03,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 334 transitions, 6144 flow [2024-06-27 22:10:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 334 transitions, 5865 flow, removed 74 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:03,249 INFO L231 Difference]: Finished difference. Result has 212 places, 302 transitions, 5106 flow [2024-06-27 22:10:03,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4361, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5106, PETRI_PLACES=212, PETRI_TRANSITIONS=302} [2024-06-27 22:10:03,250 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-06-27 22:10:03,250 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 302 transitions, 5106 flow [2024-06-27 22:10:03,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:03,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:03,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:10:03,250 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:03,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash 796205868, now seen corresponding path program 6 times [2024-06-27 22:10:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063364270] [2024-06-27 22:10:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063364270] [2024-06-27 22:10:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063364270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:05,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:05,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728260986] [2024-06-27 22:10:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:05,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:05,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:05,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 302 transitions, 5106 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:05,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:05,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:05,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:06,142 INFO L124 PetriNetUnfolderBase]: 1121/2226 cut-off events. [2024-06-27 22:10:06,142 INFO L125 PetriNetUnfolderBase]: For 56166/56166 co-relation queries the response was YES. [2024-06-27 22:10:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17067 conditions, 2226 events. 1121/2226 cut-off events. For 56166/56166 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14903 event pairs, 214 based on Foata normal form. 2/2151 useless extension candidates. Maximal degree in co-relation 16963. Up to 1695 conditions per place. [2024-06-27 22:10:06,165 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 300 selfloop transitions, 29 changer transitions 0/337 dead transitions. [2024-06-27 22:10:06,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 337 transitions, 6176 flow [2024-06-27 22:10:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:10:06,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:10:06,167 INFO L175 Difference]: Start difference. First operand has 212 places, 302 transitions, 5106 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:10:06,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 337 transitions, 6176 flow [2024-06-27 22:10:06,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 337 transitions, 5917 flow, removed 90 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:06,403 INFO L231 Difference]: Finished difference. Result has 218 places, 307 transitions, 5048 flow [2024-06-27 22:10:06,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4889, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5048, PETRI_PLACES=218, PETRI_TRANSITIONS=307} [2024-06-27 22:10:06,403 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 178 predicate places. [2024-06-27 22:10:06,403 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 307 transitions, 5048 flow [2024-06-27 22:10:06,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:06,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:06,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:06,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:10:06,404 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:06,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1651886897, now seen corresponding path program 1 times [2024-06-27 22:10:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669686916] [2024-06-27 22:10:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:07,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669686916] [2024-06-27 22:10:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669686916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:07,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:07,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200959865] [2024-06-27 22:10:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:07,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:08,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:10:08,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 307 transitions, 5048 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:08,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:08,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:10:08,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:08,687 INFO L124 PetriNetUnfolderBase]: 1019/2067 cut-off events. [2024-06-27 22:10:08,687 INFO L125 PetriNetUnfolderBase]: For 51392/51392 co-relation queries the response was YES. [2024-06-27 22:10:08,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15354 conditions, 2067 events. 1019/2067 cut-off events. For 51392/51392 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14127 event pairs, 170 based on Foata normal form. 2/1986 useless extension candidates. Maximal degree in co-relation 15249. Up to 1439 conditions per place. [2024-06-27 22:10:08,707 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 241 selfloop transitions, 80 changer transitions 0/333 dead transitions. [2024-06-27 22:10:08,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 333 transitions, 5920 flow [2024-06-27 22:10:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:10:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:10:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:10:08,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 22:10:08,708 INFO L175 Difference]: Start difference. First operand has 218 places, 307 transitions, 5048 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:10:08,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 333 transitions, 5920 flow [2024-06-27 22:10:08,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 333 transitions, 5843 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 22:10:08,881 INFO L231 Difference]: Finished difference. Result has 220 places, 310 transitions, 5221 flow [2024-06-27 22:10:08,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4971, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5221, PETRI_PLACES=220, PETRI_TRANSITIONS=310} [2024-06-27 22:10:08,882 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-06-27 22:10:08,882 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 310 transitions, 5221 flow [2024-06-27 22:10:08,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:08,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:08,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:08,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:10:08,883 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:08,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1651887176, now seen corresponding path program 7 times [2024-06-27 22:10:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800701946] [2024-06-27 22:10:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:10,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:10,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800701946] [2024-06-27 22:10:10,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800701946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:10,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311867698] [2024-06-27 22:10:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:10,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:10,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:10,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:10,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:10:10,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 310 transitions, 5221 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:10:10,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:10,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:10:10,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:11,584 INFO L124 PetriNetUnfolderBase]: 1021/2092 cut-off events. [2024-06-27 22:10:11,584 INFO L125 PetriNetUnfolderBase]: For 50943/50943 co-relation queries the response was YES. [2024-06-27 22:10:11,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15577 conditions, 2092 events. 1021/2092 cut-off events. For 50943/50943 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14321 event pairs, 162 based on Foata normal form. 2/2008 useless extension candidates. Maximal degree in co-relation 15471. Up to 1426 conditions per place. [2024-06-27 22:10:11,606 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 227 selfloop transitions, 95 changer transitions 0/334 dead transitions. [2024-06-27 22:10:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 334 transitions, 6125 flow [2024-06-27 22:10:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:10:11,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 22:10:11,607 INFO L175 Difference]: Start difference. First operand has 220 places, 310 transitions, 5221 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:10:11,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 334 transitions, 6125 flow [2024-06-27 22:10:11,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 334 transitions, 5878 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-27 22:10:11,779 INFO L231 Difference]: Finished difference. Result has 223 places, 313 transitions, 5249 flow [2024-06-27 22:10:11,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4975, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5249, PETRI_PLACES=223, PETRI_TRANSITIONS=313} [2024-06-27 22:10:11,780 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2024-06-27 22:10:11,780 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 313 transitions, 5249 flow [2024-06-27 22:10:11,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:10:11,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:11,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:10:11,781 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:11,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1520909222, now seen corresponding path program 5 times [2024-06-27 22:10:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:11,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599010740] [2024-06-27 22:10:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599010740] [2024-06-27 22:10:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599010740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:10:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304373723] [2024-06-27 22:10:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:12,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:10:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:10:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:10:12,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:12,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 313 transitions, 5249 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:12,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:12,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:12,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:13,487 INFO L124 PetriNetUnfolderBase]: 1173/2356 cut-off events. [2024-06-27 22:10:13,487 INFO L125 PetriNetUnfolderBase]: For 54764/54764 co-relation queries the response was YES. [2024-06-27 22:10:13,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17378 conditions, 2356 events. 1173/2356 cut-off events. For 54764/54764 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16022 event pairs, 151 based on Foata normal form. 2/2272 useless extension candidates. Maximal degree in co-relation 17270. Up to 1752 conditions per place. [2024-06-27 22:10:13,512 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 294 selfloop transitions, 54 changer transitions 0/356 dead transitions. [2024-06-27 22:10:13,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 356 transitions, 6186 flow [2024-06-27 22:10:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 22:10:13,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2024-06-27 22:10:13,513 INFO L175 Difference]: Start difference. First operand has 223 places, 313 transitions, 5249 flow. Second operand 9 states and 166 transitions. [2024-06-27 22:10:13,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 356 transitions, 6186 flow [2024-06-27 22:10:13,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 356 transitions, 5973 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 22:10:13,718 INFO L231 Difference]: Finished difference. Result has 227 places, 323 transitions, 5320 flow [2024-06-27 22:10:13,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5036, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5320, PETRI_PLACES=227, PETRI_TRANSITIONS=323} [2024-06-27 22:10:13,719 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 187 predicate places. [2024-06-27 22:10:13,719 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 323 transitions, 5320 flow [2024-06-27 22:10:13,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:13,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:13,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:13,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:10:13,720 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:13,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash -300929912, now seen corresponding path program 6 times [2024-06-27 22:10:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369875607] [2024-06-27 22:10:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:14,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369875607] [2024-06-27 22:10:14,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369875607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:14,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:14,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:10:14,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723191256] [2024-06-27 22:10:14,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:14,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:10:14,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:10:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:10:14,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:14,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 323 transitions, 5320 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:14,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:14,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:14,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:15,498 INFO L124 PetriNetUnfolderBase]: 1191/2377 cut-off events. [2024-06-27 22:10:15,498 INFO L125 PetriNetUnfolderBase]: For 56878/56878 co-relation queries the response was YES. [2024-06-27 22:10:15,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17559 conditions, 2377 events. 1191/2377 cut-off events. For 56878/56878 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16219 event pairs, 201 based on Foata normal form. 2/2296 useless extension candidates. Maximal degree in co-relation 17449. Up to 1830 conditions per place. [2024-06-27 22:10:15,585 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 287 selfloop transitions, 58 changer transitions 0/353 dead transitions. [2024-06-27 22:10:15,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 353 transitions, 6164 flow [2024-06-27 22:10:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:10:15,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:10:15,587 INFO L175 Difference]: Start difference. First operand has 227 places, 323 transitions, 5320 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:10:15,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 353 transitions, 6164 flow [2024-06-27 22:10:15,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 353 transitions, 6025 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:15,783 INFO L231 Difference]: Finished difference. Result has 233 places, 327 transitions, 5388 flow [2024-06-27 22:10:15,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5181, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5388, PETRI_PLACES=233, PETRI_TRANSITIONS=327} [2024-06-27 22:10:15,783 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 193 predicate places. [2024-06-27 22:10:15,784 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 327 transitions, 5388 flow [2024-06-27 22:10:15,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:15,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:15,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:15,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:10:15,784 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:15,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2108613366, now seen corresponding path program 7 times [2024-06-27 22:10:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410491327] [2024-06-27 22:10:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410491327] [2024-06-27 22:10:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410491327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:10:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703102749] [2024-06-27 22:10:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:10:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:10:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:10:16,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:10:16,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 327 transitions, 5388 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:16,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:16,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:10:16,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:17,212 INFO L124 PetriNetUnfolderBase]: 1114/2338 cut-off events. [2024-06-27 22:10:17,213 INFO L125 PetriNetUnfolderBase]: For 55605/55623 co-relation queries the response was YES. [2024-06-27 22:10:17,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16464 conditions, 2338 events. 1114/2338 cut-off events. For 55605/55623 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16760 event pairs, 110 based on Foata normal form. 19/2268 useless extension candidates. Maximal degree in co-relation 16352. Up to 1239 conditions per place. [2024-06-27 22:10:17,237 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 192 selfloop transitions, 60 changer transitions 0/365 dead transitions. [2024-06-27 22:10:17,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 365 transitions, 6171 flow [2024-06-27 22:10:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:10:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:10:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-27 22:10:17,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2024-06-27 22:10:17,240 INFO L175 Difference]: Start difference. First operand has 233 places, 327 transitions, 5388 flow. Second operand 8 states and 158 transitions. [2024-06-27 22:10:17,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 365 transitions, 6171 flow [2024-06-27 22:10:17,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 365 transitions, 6004 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:17,456 INFO L231 Difference]: Finished difference. Result has 234 places, 335 transitions, 5519 flow [2024-06-27 22:10:17,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5221, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5519, PETRI_PLACES=234, PETRI_TRANSITIONS=335} [2024-06-27 22:10:17,457 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 194 predicate places. [2024-06-27 22:10:17,457 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 335 transitions, 5519 flow [2024-06-27 22:10:17,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:17,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:17,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:17,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:10:17,458 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:17,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1153456208, now seen corresponding path program 8 times [2024-06-27 22:10:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885836628] [2024-06-27 22:10:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:18,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885836628] [2024-06-27 22:10:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885836628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:10:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204251487] [2024-06-27 22:10:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:18,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:10:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:18,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:10:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:10:18,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:18,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 335 transitions, 5519 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:18,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:18,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:18,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:19,370 INFO L124 PetriNetUnfolderBase]: 1290/2536 cut-off events. [2024-06-27 22:10:19,370 INFO L125 PetriNetUnfolderBase]: For 64314/64314 co-relation queries the response was YES. [2024-06-27 22:10:19,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19021 conditions, 2536 events. 1290/2536 cut-off events. For 64314/64314 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17501 event pairs, 230 based on Foata normal form. 2/2459 useless extension candidates. Maximal degree in co-relation 18907. Up to 1968 conditions per place. [2024-06-27 22:10:19,397 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 316 selfloop transitions, 52 changer transitions 0/376 dead transitions. [2024-06-27 22:10:19,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 376 transitions, 6653 flow [2024-06-27 22:10:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:10:19,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-06-27 22:10:19,398 INFO L175 Difference]: Start difference. First operand has 234 places, 335 transitions, 5519 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:10:19,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 376 transitions, 6653 flow [2024-06-27 22:10:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 376 transitions, 6503 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:19,642 INFO L231 Difference]: Finished difference. Result has 240 places, 351 transitions, 5846 flow [2024-06-27 22:10:19,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5419, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5846, PETRI_PLACES=240, PETRI_TRANSITIONS=351} [2024-06-27 22:10:19,642 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-06-27 22:10:19,642 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 351 transitions, 5846 flow [2024-06-27 22:10:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:19,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:19,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:10:19,643 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:19,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1153394828, now seen corresponding path program 9 times [2024-06-27 22:10:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858003568] [2024-06-27 22:10:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:20,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:10:20,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858003568] [2024-06-27 22:10:20,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858003568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:20,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:10:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373368392] [2024-06-27 22:10:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:20,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:10:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:10:20,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:10:20,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:20,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 351 transitions, 5846 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:20,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:20,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:20,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:21,553 INFO L124 PetriNetUnfolderBase]: 1314/2576 cut-off events. [2024-06-27 22:10:21,554 INFO L125 PetriNetUnfolderBase]: For 65282/65282 co-relation queries the response was YES. [2024-06-27 22:10:21,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19213 conditions, 2576 events. 1314/2576 cut-off events. For 65282/65282 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17753 event pairs, 251 based on Foata normal form. 2/2499 useless extension candidates. Maximal degree in co-relation 19097. Up to 2045 conditions per place. [2024-06-27 22:10:21,584 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 320 selfloop transitions, 52 changer transitions 0/380 dead transitions. [2024-06-27 22:10:21,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6764 flow [2024-06-27 22:10:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:10:21,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:10:21,586 INFO L175 Difference]: Start difference. First operand has 240 places, 351 transitions, 5846 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:10:21,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6764 flow [2024-06-27 22:10:21,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 380 transitions, 6600 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-27 22:10:21,851 INFO L231 Difference]: Finished difference. Result has 245 places, 357 transitions, 5913 flow [2024-06-27 22:10:21,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5682, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5913, PETRI_PLACES=245, PETRI_TRANSITIONS=357} [2024-06-27 22:10:21,851 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 205 predicate places. [2024-06-27 22:10:21,851 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 357 transitions, 5913 flow [2024-06-27 22:10:21,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:21,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:21,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:21,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:10:21,852 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:21,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -178483288, now seen corresponding path program 10 times [2024-06-27 22:10:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104841397] [2024-06-27 22:10:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104841397] [2024-06-27 22:10:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104841397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:22,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:22,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:10:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724302606] [2024-06-27 22:10:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:22,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:10:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:10:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:10:23,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:23,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 357 transitions, 5913 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:23,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:23,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:23,824 INFO L124 PetriNetUnfolderBase]: 1317/2581 cut-off events. [2024-06-27 22:10:23,825 INFO L125 PetriNetUnfolderBase]: For 63497/63497 co-relation queries the response was YES. [2024-06-27 22:10:23,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19102 conditions, 2581 events. 1317/2581 cut-off events. For 63497/63497 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17781 event pairs, 245 based on Foata normal form. 2/2503 useless extension candidates. Maximal degree in co-relation 18984. Up to 2026 conditions per place. [2024-06-27 22:10:23,852 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 311 selfloop transitions, 65 changer transitions 0/384 dead transitions. [2024-06-27 22:10:23,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 384 transitions, 6825 flow [2024-06-27 22:10:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:10:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:10:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 22:10:23,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 22:10:23,853 INFO L175 Difference]: Start difference. First operand has 245 places, 357 transitions, 5913 flow. Second operand 8 states and 149 transitions. [2024-06-27 22:10:23,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 384 transitions, 6825 flow [2024-06-27 22:10:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 384 transitions, 6654 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-27 22:10:24,100 INFO L231 Difference]: Finished difference. Result has 246 places, 361 transitions, 5976 flow [2024-06-27 22:10:24,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5742, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5976, PETRI_PLACES=246, PETRI_TRANSITIONS=361} [2024-06-27 22:10:24,101 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 206 predicate places. [2024-06-27 22:10:24,101 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 361 transitions, 5976 flow [2024-06-27 22:10:24,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:24,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:24,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:10:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:10:24,101 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:24,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -487603620, now seen corresponding path program 1 times [2024-06-27 22:10:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864729344] [2024-06-27 22:10:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864729344] [2024-06-27 22:10:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864729344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:10:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873566398] [2024-06-27 22:10:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:10:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:10:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:10:24,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:10:24,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 361 transitions, 5976 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:10:24,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:24,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:10:24,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:24,484 INFO L124 PetriNetUnfolderBase]: 828/1638 cut-off events. [2024-06-27 22:10:24,484 INFO L125 PetriNetUnfolderBase]: For 41161/41177 co-relation queries the response was YES. [2024-06-27 22:10:24,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11894 conditions, 1638 events. 828/1638 cut-off events. For 41161/41177 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10305 event pairs, 159 based on Foata normal form. 122/1720 useless extension candidates. Maximal degree in co-relation 11789. Up to 559 conditions per place. [2024-06-27 22:10:24,501 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 165 selfloop transitions, 64 changer transitions 0/266 dead transitions. [2024-06-27 22:10:24,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 266 transitions, 4810 flow [2024-06-27 22:10:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:10:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:10:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-27 22:10:24,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 22:10:24,502 INFO L175 Difference]: Start difference. First operand has 246 places, 361 transitions, 5976 flow. Second operand 4 states and 99 transitions. [2024-06-27 22:10:24,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 266 transitions, 4810 flow [2024-06-27 22:10:24,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 266 transitions, 3627 flow, removed 147 selfloop flow, removed 52 redundant places. [2024-06-27 22:10:24,670 INFO L231 Difference]: Finished difference. Result has 198 places, 228 transitions, 2998 flow [2024-06-27 22:10:24,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2998, PETRI_PLACES=198, PETRI_TRANSITIONS=228} [2024-06-27 22:10:24,671 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-06-27 22:10:24,671 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 228 transitions, 2998 flow [2024-06-27 22:10:24,671 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:10:24,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:24,672 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:10:24,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:10:24,672 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:24,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1333225761, now seen corresponding path program 1 times [2024-06-27 22:10:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347459945] [2024-06-27 22:10:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347459945] [2024-06-27 22:10:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347459945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595369874] [2024-06-27 22:10:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:26,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 228 transitions, 2998 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:10:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:26,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:26,799 INFO L124 PetriNetUnfolderBase]: 856/1608 cut-off events. [2024-06-27 22:10:26,799 INFO L125 PetriNetUnfolderBase]: For 37863/37863 co-relation queries the response was YES. [2024-06-27 22:10:26,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10586 conditions, 1608 events. 856/1608 cut-off events. For 37863/37863 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9486 event pairs, 155 based on Foata normal form. 2/1507 useless extension candidates. Maximal degree in co-relation 10501. Up to 1279 conditions per place. [2024-06-27 22:10:26,812 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 200 selfloop transitions, 42 changer transitions 0/251 dead transitions. [2024-06-27 22:10:26,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 251 transitions, 3615 flow [2024-06-27 22:10:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:10:26,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:10:26,814 INFO L175 Difference]: Start difference. First operand has 198 places, 228 transitions, 2998 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:10:26,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 251 transitions, 3615 flow [2024-06-27 22:10:26,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 251 transitions, 3550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:10:26,978 INFO L231 Difference]: Finished difference. Result has 206 places, 230 transitions, 3083 flow [2024-06-27 22:10:26,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2933, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3083, PETRI_PLACES=206, PETRI_TRANSITIONS=230} [2024-06-27 22:10:26,979 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2024-06-27 22:10:26,979 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 230 transitions, 3083 flow [2024-06-27 22:10:26,979 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:10:26,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:26,979 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:10:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:10:26,979 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:26,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 893183509, now seen corresponding path program 2 times [2024-06-27 22:10:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128120910] [2024-06-27 22:10:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128120910] [2024-06-27 22:10:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128120910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316148306] [2024-06-27 22:10:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:28,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:28,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:28,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 230 transitions, 3083 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:10:28,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:28,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:28,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:29,077 INFO L124 PetriNetUnfolderBase]: 869/1632 cut-off events. [2024-06-27 22:10:29,077 INFO L125 PetriNetUnfolderBase]: For 39793/39793 co-relation queries the response was YES. [2024-06-27 22:10:29,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10937 conditions, 1632 events. 869/1632 cut-off events. For 39793/39793 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9619 event pairs, 165 based on Foata normal form. 2/1531 useless extension candidates. Maximal degree in co-relation 10851. Up to 1358 conditions per place. [2024-06-27 22:10:29,088 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 202 selfloop transitions, 39 changer transitions 0/250 dead transitions. [2024-06-27 22:10:29,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 250 transitions, 3689 flow [2024-06-27 22:10:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-27 22:10:29,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-27 22:10:29,089 INFO L175 Difference]: Start difference. First operand has 206 places, 230 transitions, 3083 flow. Second operand 10 states and 161 transitions. [2024-06-27 22:10:29,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 250 transitions, 3689 flow [2024-06-27 22:10:29,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 250 transitions, 3561 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:29,223 INFO L231 Difference]: Finished difference. Result has 208 places, 232 transitions, 3102 flow [2024-06-27 22:10:29,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3102, PETRI_PLACES=208, PETRI_TRANSITIONS=232} [2024-06-27 22:10:29,224 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 168 predicate places. [2024-06-27 22:10:29,224 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 232 transitions, 3102 flow [2024-06-27 22:10:29,224 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:10:29,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:29,224 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:10:29,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:10:29,225 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:29,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash 893361139, now seen corresponding path program 3 times [2024-06-27 22:10:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064852354] [2024-06-27 22:10:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064852354] [2024-06-27 22:10:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064852354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385516971] [2024-06-27 22:10:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:30,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:30,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:30,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:30,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:30,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 232 transitions, 3102 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:30,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:30,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:31,541 INFO L124 PetriNetUnfolderBase]: 882/1664 cut-off events. [2024-06-27 22:10:31,541 INFO L125 PetriNetUnfolderBase]: For 41144/41144 co-relation queries the response was YES. [2024-06-27 22:10:31,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11090 conditions, 1664 events. 882/1664 cut-off events. For 41144/41144 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9916 event pairs, 181 based on Foata normal form. 2/1562 useless extension candidates. Maximal degree in co-relation 11003. Up to 1419 conditions per place. [2024-06-27 22:10:31,554 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 206 selfloop transitions, 37 changer transitions 0/252 dead transitions. [2024-06-27 22:10:31,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 252 transitions, 3734 flow [2024-06-27 22:10:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:10:31,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:10:31,556 INFO L175 Difference]: Start difference. First operand has 208 places, 232 transitions, 3102 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:10:31,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 252 transitions, 3734 flow [2024-06-27 22:10:31,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 252 transitions, 3607 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:31,713 INFO L231 Difference]: Finished difference. Result has 211 places, 236 transitions, 3158 flow [2024-06-27 22:10:31,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3158, PETRI_PLACES=211, PETRI_TRANSITIONS=236} [2024-06-27 22:10:31,714 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2024-06-27 22:10:31,714 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 236 transitions, 3158 flow [2024-06-27 22:10:31,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:31,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:31,714 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:10:31,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:10:31,715 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:31,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash -763520621, now seen corresponding path program 4 times [2024-06-27 22:10:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849629150] [2024-06-27 22:10:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849629150] [2024-06-27 22:10:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849629150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932081122] [2024-06-27 22:10:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:33,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:33,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:33,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 236 transitions, 3158 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:33,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:33,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:33,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:34,575 INFO L124 PetriNetUnfolderBase]: 895/1687 cut-off events. [2024-06-27 22:10:34,576 INFO L125 PetriNetUnfolderBase]: For 43465/43465 co-relation queries the response was YES. [2024-06-27 22:10:34,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11253 conditions, 1687 events. 895/1687 cut-off events. For 43465/43465 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10083 event pairs, 188 based on Foata normal form. 2/1584 useless extension candidates. Maximal degree in co-relation 11164. Up to 1431 conditions per place. [2024-06-27 22:10:34,591 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 202 selfloop transitions, 43 changer transitions 0/254 dead transitions. [2024-06-27 22:10:34,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 254 transitions, 3774 flow [2024-06-27 22:10:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:10:34,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:10:34,593 INFO L175 Difference]: Start difference. First operand has 211 places, 236 transitions, 3158 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:10:34,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 254 transitions, 3774 flow [2024-06-27 22:10:34,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 254 transitions, 3653 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 22:10:34,769 INFO L231 Difference]: Finished difference. Result has 214 places, 238 transitions, 3199 flow [2024-06-27 22:10:34,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3199, PETRI_PLACES=214, PETRI_TRANSITIONS=238} [2024-06-27 22:10:34,769 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 174 predicate places. [2024-06-27 22:10:34,769 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 238 transitions, 3199 flow [2024-06-27 22:10:34,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:34,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:34,770 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:10:34,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:10:34,770 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:34,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 199948113, now seen corresponding path program 5 times [2024-06-27 22:10:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377201460] [2024-06-27 22:10:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:34,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:36,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:36,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377201460] [2024-06-27 22:10:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377201460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:36,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:36,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072705412] [2024-06-27 22:10:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:36,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:36,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:36,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 238 transitions, 3199 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:10:36,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:36,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:36,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:36,944 INFO L124 PetriNetUnfolderBase]: 908/1711 cut-off events. [2024-06-27 22:10:36,944 INFO L125 PetriNetUnfolderBase]: For 45457/45457 co-relation queries the response was YES. [2024-06-27 22:10:36,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 1711 events. 908/1711 cut-off events. For 45457/45457 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10287 event pairs, 182 based on Foata normal form. 2/1607 useless extension candidates. Maximal degree in co-relation 11333. Up to 1428 conditions per place. [2024-06-27 22:10:36,961 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 206 selfloop transitions, 43 changer transitions 0/258 dead transitions. [2024-06-27 22:10:36,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 258 transitions, 3835 flow [2024-06-27 22:10:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 22:10:36,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-27 22:10:36,962 INFO L175 Difference]: Start difference. First operand has 214 places, 238 transitions, 3199 flow. Second operand 9 states and 152 transitions. [2024-06-27 22:10:36,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 258 transitions, 3835 flow [2024-06-27 22:10:37,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 258 transitions, 3691 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:37,147 INFO L231 Difference]: Finished difference. Result has 215 places, 240 transitions, 3221 flow [2024-06-27 22:10:37,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3055, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3221, PETRI_PLACES=215, PETRI_TRANSITIONS=240} [2024-06-27 22:10:37,147 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 175 predicate places. [2024-06-27 22:10:37,147 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 240 transitions, 3221 flow [2024-06-27 22:10:37,147 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:10:37,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:37,148 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:10:37,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:10:37,148 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:37,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -704012533, now seen corresponding path program 6 times [2024-06-27 22:10:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399677890] [2024-06-27 22:10:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399677890] [2024-06-27 22:10:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399677890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:39,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:39,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998460792] [2024-06-27 22:10:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:39,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:39,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:39,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 240 transitions, 3221 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:39,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:39,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:39,916 INFO L124 PetriNetUnfolderBase]: 921/1735 cut-off events. [2024-06-27 22:10:39,916 INFO L125 PetriNetUnfolderBase]: For 47518/47518 co-relation queries the response was YES. [2024-06-27 22:10:39,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11585 conditions, 1735 events. 921/1735 cut-off events. For 47518/47518 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10474 event pairs, 190 based on Foata normal form. 2/1630 useless extension candidates. Maximal degree in co-relation 11494. Up to 1458 conditions per place. [2024-06-27 22:10:39,930 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 196 selfloop transitions, 53 changer transitions 0/258 dead transitions. [2024-06-27 22:10:39,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 258 transitions, 3853 flow [2024-06-27 22:10:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-27 22:10:39,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-27 22:10:39,931 INFO L175 Difference]: Start difference. First operand has 215 places, 240 transitions, 3221 flow. Second operand 10 states and 161 transitions. [2024-06-27 22:10:39,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 258 transitions, 3853 flow [2024-06-27 22:10:40,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 258 transitions, 3705 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 22:10:40,119 INFO L231 Difference]: Finished difference. Result has 218 places, 242 transitions, 3263 flow [2024-06-27 22:10:40,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3263, PETRI_PLACES=218, PETRI_TRANSITIONS=242} [2024-06-27 22:10:40,119 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 178 predicate places. [2024-06-27 22:10:40,119 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 242 transitions, 3263 flow [2024-06-27 22:10:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:40,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:40,120 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:10:40,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:10:40,120 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:40,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 206619437, now seen corresponding path program 1 times [2024-06-27 22:10:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:40,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999109435] [2024-06-27 22:10:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999109435] [2024-06-27 22:10:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999109435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978938741] [2024-06-27 22:10:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:42,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:42,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:42,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:10:42,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 242 transitions, 3263 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:10:42,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:42,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:10:42,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:43,159 INFO L124 PetriNetUnfolderBase]: 792/1538 cut-off events. [2024-06-27 22:10:43,160 INFO L125 PetriNetUnfolderBase]: For 46435/46445 co-relation queries the response was YES. [2024-06-27 22:10:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 1538 events. 792/1538 cut-off events. For 46435/46445 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9387 event pairs, 187 based on Foata normal form. 7/1417 useless extension candidates. Maximal degree in co-relation 10268. Up to 1198 conditions per place. [2024-06-27 22:10:43,173 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 164 selfloop transitions, 78 changer transitions 0/256 dead transitions. [2024-06-27 22:10:43,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 256 transitions, 3925 flow [2024-06-27 22:10:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 22:10:43,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 22:10:43,174 INFO L175 Difference]: Start difference. First operand has 218 places, 242 transitions, 3263 flow. Second operand 9 states and 156 transitions. [2024-06-27 22:10:43,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 256 transitions, 3925 flow [2024-06-27 22:10:43,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 256 transitions, 3737 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:43,338 INFO L231 Difference]: Finished difference. Result has 220 places, 244 transitions, 3286 flow [2024-06-27 22:10:43,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3075, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3286, PETRI_PLACES=220, PETRI_TRANSITIONS=244} [2024-06-27 22:10:43,338 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-06-27 22:10:43,338 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 244 transitions, 3286 flow [2024-06-27 22:10:43,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:10:43,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:43,339 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:10:43,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:10:43,339 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:43,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash 206388797, now seen corresponding path program 2 times [2024-06-27 22:10:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:43,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904700202] [2024-06-27 22:10:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904700202] [2024-06-27 22:10:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904700202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499152538] [2024-06-27 22:10:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:45,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:45,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:46,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:10:46,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 244 transitions, 3286 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:10:46,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:46,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:10:46,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:46,852 INFO L124 PetriNetUnfolderBase]: 790/1553 cut-off events. [2024-06-27 22:10:46,852 INFO L125 PetriNetUnfolderBase]: For 44448/44457 co-relation queries the response was YES. [2024-06-27 22:10:46,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10270 conditions, 1553 events. 790/1553 cut-off events. For 44448/44457 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9504 event pairs, 171 based on Foata normal form. 6/1426 useless extension candidates. Maximal degree in co-relation 10176. Up to 1196 conditions per place. [2024-06-27 22:10:46,866 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 167 selfloop transitions, 74 changer transitions 0/255 dead transitions. [2024-06-27 22:10:46,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 255 transitions, 3794 flow [2024-06-27 22:10:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:10:46,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:10:46,867 INFO L175 Difference]: Start difference. First operand has 220 places, 244 transitions, 3286 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:10:46,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 255 transitions, 3794 flow [2024-06-27 22:10:47,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 255 transitions, 3608 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 22:10:47,038 INFO L231 Difference]: Finished difference. Result has 223 places, 244 transitions, 3253 flow [2024-06-27 22:10:47,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3253, PETRI_PLACES=223, PETRI_TRANSITIONS=244} [2024-06-27 22:10:47,038 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2024-06-27 22:10:47,038 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 244 transitions, 3253 flow [2024-06-27 22:10:47,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:10:47,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:47,039 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:10:47,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:10:47,039 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:47,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash -703766269, now seen corresponding path program 1 times [2024-06-27 22:10:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098783372] [2024-06-27 22:10:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098783372] [2024-06-27 22:10:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098783372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707075819] [2024-06-27 22:10:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:48,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:10:48,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 244 transitions, 3253 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:48,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:48,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:10:48,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:49,141 INFO L124 PetriNetUnfolderBase]: 852/1708 cut-off events. [2024-06-27 22:10:49,141 INFO L125 PetriNetUnfolderBase]: For 61757/61767 co-relation queries the response was YES. [2024-06-27 22:10:49,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11083 conditions, 1708 events. 852/1708 cut-off events. For 61757/61767 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10785 event pairs, 222 based on Foata normal form. 15/1581 useless extension candidates. Maximal degree in co-relation 10988. Up to 1211 conditions per place. [2024-06-27 22:10:49,156 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 180 selfloop transitions, 68 changer transitions 0/263 dead transitions. [2024-06-27 22:10:49,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 263 transitions, 3897 flow [2024-06-27 22:10:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:10:49,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 22:10:49,157 INFO L175 Difference]: Start difference. First operand has 223 places, 244 transitions, 3253 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:10:49,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 263 transitions, 3897 flow [2024-06-27 22:10:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 263 transitions, 3724 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:49,354 INFO L231 Difference]: Finished difference. Result has 224 places, 245 transitions, 3249 flow [2024-06-27 22:10:49,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3080, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3249, PETRI_PLACES=224, PETRI_TRANSITIONS=245} [2024-06-27 22:10:49,355 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 184 predicate places. [2024-06-27 22:10:49,355 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 245 transitions, 3249 flow [2024-06-27 22:10:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:10:49,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:49,356 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:10:49,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:10:49,356 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:49,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1372758261, now seen corresponding path program 7 times [2024-06-27 22:10:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085720369] [2024-06-27 22:10:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085720369] [2024-06-27 22:10:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085720369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55722074] [2024-06-27 22:10:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:51,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:10:51,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:51,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 245 transitions, 3249 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:10:51,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:51,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:51,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:52,318 INFO L124 PetriNetUnfolderBase]: 1008/1948 cut-off events. [2024-06-27 22:10:52,319 INFO L125 PetriNetUnfolderBase]: For 53360/53360 co-relation queries the response was YES. [2024-06-27 22:10:52,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12594 conditions, 1948 events. 1008/1948 cut-off events. For 53360/53360 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12151 event pairs, 224 based on Foata normal form. 2/1825 useless extension candidates. Maximal degree in co-relation 12498. Up to 1538 conditions per place. [2024-06-27 22:10:52,338 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 174 selfloop transitions, 80 changer transitions 0/263 dead transitions. [2024-06-27 22:10:52,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 263 transitions, 3897 flow [2024-06-27 22:10:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:10:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:10:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 22:10:52,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-06-27 22:10:52,339 INFO L175 Difference]: Start difference. First operand has 224 places, 245 transitions, 3249 flow. Second operand 9 states and 151 transitions. [2024-06-27 22:10:52,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 263 transitions, 3897 flow [2024-06-27 22:10:52,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 263 transitions, 3731 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 22:10:52,547 INFO L231 Difference]: Finished difference. Result has 226 places, 247 transitions, 3330 flow [2024-06-27 22:10:52,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3330, PETRI_PLACES=226, PETRI_TRANSITIONS=247} [2024-06-27 22:10:52,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 186 predicate places. [2024-06-27 22:10:52,548 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 247 transitions, 3330 flow [2024-06-27 22:10:52,548 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:10:52,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:52,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:10:52,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:10:52,549 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:52,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -740768569, now seen corresponding path program 8 times [2024-06-27 22:10:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122209400] [2024-06-27 22:10:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122209400] [2024-06-27 22:10:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122209400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077263777] [2024-06-27 22:10:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:54,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:54,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:54,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 247 transitions, 3330 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:54,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:54,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:54,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:55,276 INFO L124 PetriNetUnfolderBase]: 1021/1971 cut-off events. [2024-06-27 22:10:55,276 INFO L125 PetriNetUnfolderBase]: For 56049/56049 co-relation queries the response was YES. [2024-06-27 22:10:55,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12820 conditions, 1971 events. 1021/1971 cut-off events. For 56049/56049 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12360 event pairs, 237 based on Foata normal form. 2/1850 useless extension candidates. Maximal degree in co-relation 12723. Up to 1635 conditions per place. [2024-06-27 22:10:55,294 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 203 selfloop transitions, 53 changer transitions 0/265 dead transitions. [2024-06-27 22:10:55,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 265 transitions, 3986 flow [2024-06-27 22:10:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:10:55,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:10:55,295 INFO L175 Difference]: Start difference. First operand has 226 places, 247 transitions, 3330 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:10:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 265 transitions, 3986 flow [2024-06-27 22:10:55,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 265 transitions, 3755 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-27 22:10:55,591 INFO L231 Difference]: Finished difference. Result has 229 places, 249 transitions, 3296 flow [2024-06-27 22:10:55,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3099, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3296, PETRI_PLACES=229, PETRI_TRANSITIONS=249} [2024-06-27 22:10:55,592 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 189 predicate places. [2024-06-27 22:10:55,592 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 249 transitions, 3296 flow [2024-06-27 22:10:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:55,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:55,593 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:10:55,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:10:55,593 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:55,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -740773219, now seen corresponding path program 9 times [2024-06-27 22:10:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510511271] [2024-06-27 22:10:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:57,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:10:57,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510511271] [2024-06-27 22:10:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510511271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:57,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:57,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:10:57,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487918795] [2024-06-27 22:10:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:57,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:10:57,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:10:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:10:57,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:10:57,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 249 transitions, 3296 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:57,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:10:57,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:10:57,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:10:57,952 INFO L124 PetriNetUnfolderBase]: 1034/1995 cut-off events. [2024-06-27 22:10:57,952 INFO L125 PetriNetUnfolderBase]: For 58461/58461 co-relation queries the response was YES. [2024-06-27 22:10:57,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12897 conditions, 1995 events. 1034/1995 cut-off events. For 58461/58461 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12507 event pairs, 231 based on Foata normal form. 2/1873 useless extension candidates. Maximal degree in co-relation 12799. Up to 1642 conditions per place. [2024-06-27 22:10:57,970 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 207 selfloop transitions, 53 changer transitions 0/269 dead transitions. [2024-06-27 22:10:57,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 269 transitions, 3972 flow [2024-06-27 22:10:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:10:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:10:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-27 22:10:57,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-27 22:10:57,971 INFO L175 Difference]: Start difference. First operand has 229 places, 249 transitions, 3296 flow. Second operand 10 states and 161 transitions. [2024-06-27 22:10:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 269 transitions, 3972 flow [2024-06-27 22:10:58,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 269 transitions, 3791 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-27 22:10:58,213 INFO L231 Difference]: Finished difference. Result has 231 places, 251 transitions, 3316 flow [2024-06-27 22:10:58,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3115, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3316, PETRI_PLACES=231, PETRI_TRANSITIONS=251} [2024-06-27 22:10:58,213 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 191 predicate places. [2024-06-27 22:10:58,213 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 251 transitions, 3316 flow [2024-06-27 22:10:58,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:10:58,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:10:58,214 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:10:58,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:10:58,214 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:10:58,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:10:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1171115655, now seen corresponding path program 10 times [2024-06-27 22:10:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:10:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668345285] [2024-06-27 22:10:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:10:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:10:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:10:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:10:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:10:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668345285] [2024-06-27 22:10:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668345285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:10:59,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:10:59,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:10:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085274031] [2024-06-27 22:10:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:10:59,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:10:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:10:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:10:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:00,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:00,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 251 transitions, 3316 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:11:00,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:00,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:00,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:00,787 INFO L124 PetriNetUnfolderBase]: 1047/2018 cut-off events. [2024-06-27 22:11:00,787 INFO L125 PetriNetUnfolderBase]: For 60500/60500 co-relation queries the response was YES. [2024-06-27 22:11:00,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13058 conditions, 2018 events. 1047/2018 cut-off events. For 60500/60500 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12722 event pairs, 245 based on Foata normal form. 2/1896 useless extension candidates. Maximal degree in co-relation 12959. Up to 1671 conditions per place. [2024-06-27 22:11:00,806 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 204 selfloop transitions, 56 changer transitions 0/269 dead transitions. [2024-06-27 22:11:00,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 269 transitions, 3988 flow [2024-06-27 22:11:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 22:11:00,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-06-27 22:11:00,808 INFO L175 Difference]: Start difference. First operand has 231 places, 251 transitions, 3316 flow. Second operand 9 states and 151 transitions. [2024-06-27 22:11:00,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 269 transitions, 3988 flow [2024-06-27 22:11:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 269 transitions, 3803 flow, removed 41 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:01,074 INFO L231 Difference]: Finished difference. Result has 232 places, 253 transitions, 3342 flow [2024-06-27 22:11:01,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3342, PETRI_PLACES=232, PETRI_TRANSITIONS=253} [2024-06-27 22:11:01,075 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 192 predicate places. [2024-06-27 22:11:01,075 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 253 transitions, 3342 flow [2024-06-27 22:11:01,075 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:11:01,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:01,076 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:11:01,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:11:01,076 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:01,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -734093215, now seen corresponding path program 2 times [2024-06-27 22:11:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998710362] [2024-06-27 22:11:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:02,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:11:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998710362] [2024-06-27 22:11:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998710362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498598819] [2024-06-27 22:11:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:02,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:11:02,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 253 transitions, 3342 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:02,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:02,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:11:02,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:03,481 INFO L124 PetriNetUnfolderBase]: 950/1945 cut-off events. [2024-06-27 22:11:03,481 INFO L125 PetriNetUnfolderBase]: For 80114/80123 co-relation queries the response was YES. [2024-06-27 22:11:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12481 conditions, 1945 events. 950/1945 cut-off events. For 80114/80123 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12911 event pairs, 275 based on Foata normal form. 15/1800 useless extension candidates. Maximal degree in co-relation 12381. Up to 1457 conditions per place. [2024-06-27 22:11:03,501 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 199 selfloop transitions, 56 changer transitions 0/270 dead transitions. [2024-06-27 22:11:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 270 transitions, 4004 flow [2024-06-27 22:11:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:11:03,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 22:11:03,503 INFO L175 Difference]: Start difference. First operand has 232 places, 253 transitions, 3342 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:11:03,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 270 transitions, 4004 flow [2024-06-27 22:11:03,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 270 transitions, 3809 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 22:11:03,799 INFO L231 Difference]: Finished difference. Result has 234 places, 254 transitions, 3293 flow [2024-06-27 22:11:03,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3147, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3293, PETRI_PLACES=234, PETRI_TRANSITIONS=254} [2024-06-27 22:11:03,800 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 194 predicate places. [2024-06-27 22:11:03,800 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 254 transitions, 3293 flow [2024-06-27 22:11:03,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:03,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:03,801 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:11:03,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:11:03,801 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:03,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -734332535, now seen corresponding path program 3 times [2024-06-27 22:11:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:03,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813398128] [2024-06-27 22:11:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813398128] [2024-06-27 22:11:06,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813398128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:06,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:11:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368907587] [2024-06-27 22:11:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:11:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:11:06,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:11:06,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:11:06,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 254 transitions, 3293 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:11:06,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:06,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:11:06,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:07,646 INFO L124 PetriNetUnfolderBase]: 955/1936 cut-off events. [2024-06-27 22:11:07,646 INFO L125 PetriNetUnfolderBase]: For 63097/63107 co-relation queries the response was YES. [2024-06-27 22:11:07,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12412 conditions, 1936 events. 955/1936 cut-off events. For 63097/63107 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12797 event pairs, 275 based on Foata normal form. 6/1782 useless extension candidates. Maximal degree in co-relation 12311. Up to 1560 conditions per place. [2024-06-27 22:11:07,665 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 188 selfloop transitions, 64 changer transitions 0/266 dead transitions. [2024-06-27 22:11:07,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 266 transitions, 3983 flow [2024-06-27 22:11:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 22:11:07,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-27 22:11:07,667 INFO L175 Difference]: Start difference. First operand has 234 places, 254 transitions, 3293 flow. Second operand 10 states and 167 transitions. [2024-06-27 22:11:07,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 266 transitions, 3983 flow [2024-06-27 22:11:08,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 266 transitions, 3861 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 22:11:08,041 INFO L231 Difference]: Finished difference. Result has 237 places, 256 transitions, 3344 flow [2024-06-27 22:11:08,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3171, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3344, PETRI_PLACES=237, PETRI_TRANSITIONS=256} [2024-06-27 22:11:08,042 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 197 predicate places. [2024-06-27 22:11:08,042 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 256 transitions, 3344 flow [2024-06-27 22:11:08,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:11:08,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:08,043 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:11:08,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:11:08,043 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:08,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1372751317, now seen corresponding path program 4 times [2024-06-27 22:11:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:08,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121640780] [2024-06-27 22:11:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121640780] [2024-06-27 22:11:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121640780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50198840] [2024-06-27 22:11:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:10,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:11:10,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 256 transitions, 3344 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:10,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:10,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:11:10,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:11,725 INFO L124 PetriNetUnfolderBase]: 960/1959 cut-off events. [2024-06-27 22:11:11,726 INFO L125 PetriNetUnfolderBase]: For 63452/63462 co-relation queries the response was YES. [2024-06-27 22:11:11,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12458 conditions, 1959 events. 960/1959 cut-off events. For 63452/63462 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12954 event pairs, 275 based on Foata normal form. 7/1802 useless extension candidates. Maximal degree in co-relation 12356. Up to 1463 conditions per place. [2024-06-27 22:11:11,745 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 167 selfloop transitions, 91 changer transitions 0/272 dead transitions. [2024-06-27 22:11:11,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 272 transitions, 4208 flow [2024-06-27 22:11:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:11:11,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:11:11,746 INFO L175 Difference]: Start difference. First operand has 237 places, 256 transitions, 3344 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:11:11,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 272 transitions, 4208 flow [2024-06-27 22:11:12,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 272 transitions, 4060 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:12,098 INFO L231 Difference]: Finished difference. Result has 239 places, 258 transitions, 3419 flow [2024-06-27 22:11:12,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3419, PETRI_PLACES=239, PETRI_TRANSITIONS=258} [2024-06-27 22:11:12,098 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 199 predicate places. [2024-06-27 22:11:12,099 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 258 transitions, 3419 flow [2024-06-27 22:11:12,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:12,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:12,099 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:11:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:11:12,099 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:12,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -734101895, now seen corresponding path program 5 times [2024-06-27 22:11:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779181575] [2024-06-27 22:11:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779181575] [2024-06-27 22:11:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779181575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102533844] [2024-06-27 22:11:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:14,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:14,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:14,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:11:14,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 258 transitions, 3419 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:14,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:11:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:15,403 INFO L124 PetriNetUnfolderBase]: 958/1940 cut-off events. [2024-06-27 22:11:15,403 INFO L125 PetriNetUnfolderBase]: For 62906/62916 co-relation queries the response was YES. [2024-06-27 22:11:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12466 conditions, 1940 events. 958/1940 cut-off events. For 62906/62916 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12809 event pairs, 275 based on Foata normal form. 6/1784 useless extension candidates. Maximal degree in co-relation 12363. Up to 1565 conditions per place. [2024-06-27 22:11:15,421 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 190 selfloop transitions, 63 changer transitions 0/267 dead transitions. [2024-06-27 22:11:15,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 267 transitions, 3945 flow [2024-06-27 22:11:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:11:15,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-27 22:11:15,423 INFO L175 Difference]: Start difference. First operand has 239 places, 258 transitions, 3419 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:11:15,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 267 transitions, 3945 flow [2024-06-27 22:11:15,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 267 transitions, 3729 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:15,732 INFO L231 Difference]: Finished difference. Result has 240 places, 258 transitions, 3334 flow [2024-06-27 22:11:15,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3203, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3334, PETRI_PLACES=240, PETRI_TRANSITIONS=258} [2024-06-27 22:11:15,732 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-06-27 22:11:15,732 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 258 transitions, 3334 flow [2024-06-27 22:11:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:15,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:15,732 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:11:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:11:15,733 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:15,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1372511997, now seen corresponding path program 3 times [2024-06-27 22:11:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723840073] [2024-06-27 22:11:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723840073] [2024-06-27 22:11:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723840073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:17,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:11:17,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265050541] [2024-06-27 22:11:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:17,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:11:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:17,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:11:17,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:11:17,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:11:17,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 258 transitions, 3334 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:11:17,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:17,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:11:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:18,465 INFO L124 PetriNetUnfolderBase]: 972/1991 cut-off events. [2024-06-27 22:11:18,466 INFO L125 PetriNetUnfolderBase]: For 67111/67121 co-relation queries the response was YES. [2024-06-27 22:11:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12611 conditions, 1991 events. 972/1991 cut-off events. For 67111/67121 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13256 event pairs, 278 based on Foata normal form. 8/1832 useless extension candidates. Maximal degree in co-relation 12507. Up to 1565 conditions per place. [2024-06-27 22:11:18,486 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 200 selfloop transitions, 64 changer transitions 0/278 dead transitions. [2024-06-27 22:11:18,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 278 transitions, 4060 flow [2024-06-27 22:11:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 22:11:18,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-27 22:11:18,487 INFO L175 Difference]: Start difference. First operand has 240 places, 258 transitions, 3334 flow. Second operand 10 states and 167 transitions. [2024-06-27 22:11:18,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 278 transitions, 4060 flow [2024-06-27 22:11:18,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 278 transitions, 3864 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-27 22:11:18,790 INFO L231 Difference]: Finished difference. Result has 242 places, 265 transitions, 3422 flow [2024-06-27 22:11:18,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3422, PETRI_PLACES=242, PETRI_TRANSITIONS=265} [2024-06-27 22:11:18,791 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 202 predicate places. [2024-06-27 22:11:18,791 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 265 transitions, 3422 flow [2024-06-27 22:11:18,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:11:18,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:18,791 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:11:18,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:11:18,791 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:18,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1364468427, now seen corresponding path program 4 times [2024-06-27 22:11:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24402436] [2024-06-27 22:11:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24402436] [2024-06-27 22:11:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24402436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996475288] [2024-06-27 22:11:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:21,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:21,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 265 transitions, 3422 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:11:21,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:21,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:21,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:21,896 INFO L124 PetriNetUnfolderBase]: 1170/2296 cut-off events. [2024-06-27 22:11:21,896 INFO L125 PetriNetUnfolderBase]: For 72430/72430 co-relation queries the response was YES. [2024-06-27 22:11:21,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14627 conditions, 2296 events. 1170/2296 cut-off events. For 72430/72430 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15102 event pairs, 330 based on Foata normal form. 2/2155 useless extension candidates. Maximal degree in co-relation 14520. Up to 1975 conditions per place. [2024-06-27 22:11:21,917 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 262 selfloop transitions, 17 changer transitions 0/288 dead transitions. [2024-06-27 22:11:21,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 288 transitions, 4166 flow [2024-06-27 22:11:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:11:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:11:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:11:21,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 22:11:21,918 INFO L175 Difference]: Start difference. First operand has 242 places, 265 transitions, 3422 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:11:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 288 transitions, 4166 flow [2024-06-27 22:11:22,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 288 transitions, 4045 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 22:11:22,385 INFO L231 Difference]: Finished difference. Result has 250 places, 268 transitions, 3404 flow [2024-06-27 22:11:22,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3301, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3404, PETRI_PLACES=250, PETRI_TRANSITIONS=268} [2024-06-27 22:11:22,386 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 210 predicate places. [2024-06-27 22:11:22,386 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 268 transitions, 3404 flow [2024-06-27 22:11:22,386 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:11:22,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:22,386 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:11:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:11:22,387 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:22,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash -307312625, now seen corresponding path program 6 times [2024-06-27 22:11:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736043106] [2024-06-27 22:11:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736043106] [2024-06-27 22:11:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736043106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748623656] [2024-06-27 22:11:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:24,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:24,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:11:24,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 268 transitions, 3404 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:24,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:24,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:11:24,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:25,422 INFO L124 PetriNetUnfolderBase]: 988/2013 cut-off events. [2024-06-27 22:11:25,422 INFO L125 PetriNetUnfolderBase]: For 65962/65972 co-relation queries the response was YES. [2024-06-27 22:11:25,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 2013 events. 988/2013 cut-off events. For 65962/65972 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13419 event pairs, 281 based on Foata normal form. 6/1851 useless extension candidates. Maximal degree in co-relation 12712. Up to 1478 conditions per place. [2024-06-27 22:11:25,499 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 160 selfloop transitions, 103 changer transitions 0/278 dead transitions. [2024-06-27 22:11:25,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 278 transitions, 4086 flow [2024-06-27 22:11:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:11:25,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:11:25,500 INFO L175 Difference]: Start difference. First operand has 250 places, 268 transitions, 3404 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:11:25,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 278 transitions, 4086 flow [2024-06-27 22:11:25,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 278 transitions, 4012 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:25,831 INFO L231 Difference]: Finished difference. Result has 251 places, 268 transitions, 3541 flow [2024-06-27 22:11:25,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3541, PETRI_PLACES=251, PETRI_TRANSITIONS=268} [2024-06-27 22:11:25,832 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 211 predicate places. [2024-06-27 22:11:25,832 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 268 transitions, 3541 flow [2024-06-27 22:11:25,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:25,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:25,832 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:11:25,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:11:25,832 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:25,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1087420807, now seen corresponding path program 7 times [2024-06-27 22:11:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608865342] [2024-06-27 22:11:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:28,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608865342] [2024-06-27 22:11:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608865342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:28,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:11:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927072443] [2024-06-27 22:11:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:28,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:11:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:28,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:11:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:11:28,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:28,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 268 transitions, 3541 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:11:28,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:28,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:28,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:29,911 INFO L124 PetriNetUnfolderBase]: 1166/2306 cut-off events. [2024-06-27 22:11:29,911 INFO L125 PetriNetUnfolderBase]: For 65645/65645 co-relation queries the response was YES. [2024-06-27 22:11:29,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14456 conditions, 2306 events. 1166/2306 cut-off events. For 65645/65645 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15177 event pairs, 330 based on Foata normal form. 1/2161 useless extension candidates. Maximal degree in co-relation 14345. Up to 1962 conditions per place. [2024-06-27 22:11:29,935 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 252 selfloop transitions, 23 changer transitions 0/284 dead transitions. [2024-06-27 22:11:29,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 284 transitions, 4153 flow [2024-06-27 22:11:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:11:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:11:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:11:29,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 22:11:29,936 INFO L175 Difference]: Start difference. First operand has 251 places, 268 transitions, 3541 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:11:29,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 284 transitions, 4153 flow [2024-06-27 22:11:30,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 284 transitions, 3903 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-27 22:11:30,305 INFO L231 Difference]: Finished difference. Result has 253 places, 268 transitions, 3342 flow [2024-06-27 22:11:30,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3291, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3342, PETRI_PLACES=253, PETRI_TRANSITIONS=268} [2024-06-27 22:11:30,305 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 213 predicate places. [2024-06-27 22:11:30,305 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 268 transitions, 3342 flow [2024-06-27 22:11:30,306 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:11:30,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:30,306 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:11:30,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:11:30,306 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:30,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1077292797, now seen corresponding path program 5 times [2024-06-27 22:11:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778248081] [2024-06-27 22:11:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778248081] [2024-06-27 22:11:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778248081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:32,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:32,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799663499] [2024-06-27 22:11:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:32,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:33,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:33,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 268 transitions, 3342 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:11:33,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:33,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:33,840 INFO L124 PetriNetUnfolderBase]: 1183/2329 cut-off events. [2024-06-27 22:11:33,840 INFO L125 PetriNetUnfolderBase]: For 70581/70581 co-relation queries the response was YES. [2024-06-27 22:11:33,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14469 conditions, 2329 events. 1183/2329 cut-off events. For 70581/70581 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15403 event pairs, 343 based on Foata normal form. 2/2186 useless extension candidates. Maximal degree in co-relation 14357. Up to 1990 conditions per place. [2024-06-27 22:11:33,864 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 261 selfloop transitions, 21 changer transitions 0/291 dead transitions. [2024-06-27 22:11:33,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 291 transitions, 4076 flow [2024-06-27 22:11:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:11:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:11:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:11:33,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43686868686868685 [2024-06-27 22:11:33,865 INFO L175 Difference]: Start difference. First operand has 253 places, 268 transitions, 3342 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:11:33,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 291 transitions, 4076 flow [2024-06-27 22:11:34,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 291 transitions, 4021 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-27 22:11:34,276 INFO L231 Difference]: Finished difference. Result has 254 places, 269 transitions, 3367 flow [2024-06-27 22:11:34,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3367, PETRI_PLACES=254, PETRI_TRANSITIONS=269} [2024-06-27 22:11:34,277 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 214 predicate places. [2024-06-27 22:11:34,277 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 269 transitions, 3367 flow [2024-06-27 22:11:34,277 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:11:34,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:34,277 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:11:34,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:11:34,277 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:34,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -11728555, now seen corresponding path program 6 times [2024-06-27 22:11:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324956159] [2024-06-27 22:11:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:36,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:11:36,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:36,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324956159] [2024-06-27 22:11:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324956159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:11:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308773723] [2024-06-27 22:11:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:36,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:11:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:11:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:11:36,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:36,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 269 transitions, 3367 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:11:36,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:36,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:36,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:37,456 INFO L124 PetriNetUnfolderBase]: 1180/2316 cut-off events. [2024-06-27 22:11:37,456 INFO L125 PetriNetUnfolderBase]: For 66867/66867 co-relation queries the response was YES. [2024-06-27 22:11:37,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14311 conditions, 2316 events. 1180/2316 cut-off events. For 66867/66867 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15245 event pairs, 329 based on Foata normal form. 2/2180 useless extension candidates. Maximal degree in co-relation 14198. Up to 1912 conditions per place. [2024-06-27 22:11:37,480 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 263 selfloop transitions, 23 changer transitions 0/295 dead transitions. [2024-06-27 22:11:37,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 295 transitions, 4145 flow [2024-06-27 22:11:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:11:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:11:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-06-27 22:11:37,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-27 22:11:37,481 INFO L175 Difference]: Start difference. First operand has 254 places, 269 transitions, 3367 flow. Second operand 12 states and 186 transitions. [2024-06-27 22:11:37,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 295 transitions, 4145 flow [2024-06-27 22:11:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 295 transitions, 4060 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-27 22:11:37,877 INFO L231 Difference]: Finished difference. Result has 255 places, 269 transitions, 3332 flow [2024-06-27 22:11:37,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3282, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3332, PETRI_PLACES=255, PETRI_TRANSITIONS=269} [2024-06-27 22:11:37,878 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 215 predicate places. [2024-06-27 22:11:37,878 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 269 transitions, 3332 flow [2024-06-27 22:11:37,878 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:11:37,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:37,878 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:11:37,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:11:37,878 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:37,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 381039721, now seen corresponding path program 11 times [2024-06-27 22:11:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525390820] [2024-06-27 22:11:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525390820] [2024-06-27 22:11:39,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525390820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:39,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691694791] [2024-06-27 22:11:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:39,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:39,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 269 transitions, 3332 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:39,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:39,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:39,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:40,191 INFO L124 PetriNetUnfolderBase]: 1204/2373 cut-off events. [2024-06-27 22:11:40,191 INFO L125 PetriNetUnfolderBase]: For 69136/69136 co-relation queries the response was YES. [2024-06-27 22:11:40,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14576 conditions, 2373 events. 1204/2373 cut-off events. For 69136/69136 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15743 event pairs, 277 based on Foata normal form. 2/2224 useless extension candidates. Maximal degree in co-relation 14464. Up to 1927 conditions per place. [2024-06-27 22:11:40,216 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 250 selfloop transitions, 42 changer transitions 0/301 dead transitions. [2024-06-27 22:11:40,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 301 transitions, 4120 flow [2024-06-27 22:11:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:11:40,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-27 22:11:40,217 INFO L175 Difference]: Start difference. First operand has 255 places, 269 transitions, 3332 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:11:40,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 301 transitions, 4120 flow [2024-06-27 22:11:40,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 301 transitions, 4027 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-27 22:11:40,585 INFO L231 Difference]: Finished difference. Result has 254 places, 271 transitions, 3374 flow [2024-06-27 22:11:40,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3374, PETRI_PLACES=254, PETRI_TRANSITIONS=271} [2024-06-27 22:11:40,585 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 214 predicate places. [2024-06-27 22:11:40,585 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 271 transitions, 3374 flow [2024-06-27 22:11:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:40,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:40,586 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:11:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:11:40,586 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:40,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -738714051, now seen corresponding path program 12 times [2024-06-27 22:11:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506467218] [2024-06-27 22:11:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:42,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:11:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506467218] [2024-06-27 22:11:42,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506467218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:42,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:42,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621523762] [2024-06-27 22:11:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:42,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:42,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:42,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:42,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 271 transitions, 3374 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:42,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:42,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:42,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:42,992 INFO L124 PetriNetUnfolderBase]: 1236/2439 cut-off events. [2024-06-27 22:11:42,993 INFO L125 PetriNetUnfolderBase]: For 71462/71462 co-relation queries the response was YES. [2024-06-27 22:11:43,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14991 conditions, 2439 events. 1236/2439 cut-off events. For 71462/71462 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16279 event pairs, 324 based on Foata normal form. 2/2288 useless extension candidates. Maximal degree in co-relation 14879. Up to 2061 conditions per place. [2024-06-27 22:11:43,018 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 253 selfloop transitions, 40 changer transitions 0/302 dead transitions. [2024-06-27 22:11:43,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 302 transitions, 4218 flow [2024-06-27 22:11:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:11:43,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:11:43,021 INFO L175 Difference]: Start difference. First operand has 254 places, 271 transitions, 3374 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:11:43,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 302 transitions, 4218 flow [2024-06-27 22:11:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 302 transitions, 4119 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-27 22:11:43,417 INFO L231 Difference]: Finished difference. Result has 256 places, 277 transitions, 3494 flow [2024-06-27 22:11:43,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3277, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3494, PETRI_PLACES=256, PETRI_TRANSITIONS=277} [2024-06-27 22:11:43,417 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 216 predicate places. [2024-06-27 22:11:43,417 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 277 transitions, 3494 flow [2024-06-27 22:11:43,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:43,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:43,417 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:11:43,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:11:43,417 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:43,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -717643971, now seen corresponding path program 13 times [2024-06-27 22:11:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388662573] [2024-06-27 22:11:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:44,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:11:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388662573] [2024-06-27 22:11:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388662573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169834849] [2024-06-27 22:11:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:44,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:44,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 277 transitions, 3494 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:44,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:44,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:45,727 INFO L124 PetriNetUnfolderBase]: 1256/2475 cut-off events. [2024-06-27 22:11:45,727 INFO L125 PetriNetUnfolderBase]: For 72726/72726 co-relation queries the response was YES. [2024-06-27 22:11:45,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15277 conditions, 2475 events. 1256/2475 cut-off events. For 72726/72726 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16614 event pairs, 326 based on Foata normal form. 2/2325 useless extension candidates. Maximal degree in co-relation 15164. Up to 2067 conditions per place. [2024-06-27 22:11:45,753 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 252 selfloop transitions, 44 changer transitions 0/305 dead transitions. [2024-06-27 22:11:45,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 305 transitions, 4278 flow [2024-06-27 22:11:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:11:45,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:11:45,754 INFO L175 Difference]: Start difference. First operand has 256 places, 277 transitions, 3494 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:11:45,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 305 transitions, 4278 flow [2024-06-27 22:11:46,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 305 transitions, 4199 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:11:46,178 INFO L231 Difference]: Finished difference. Result has 259 places, 281 transitions, 3624 flow [2024-06-27 22:11:46,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3624, PETRI_PLACES=259, PETRI_TRANSITIONS=281} [2024-06-27 22:11:46,178 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 219 predicate places. [2024-06-27 22:11:46,179 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 281 transitions, 3624 flow [2024-06-27 22:11:46,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:46,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:46,179 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:11:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:11:46,179 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:46,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 942505905, now seen corresponding path program 14 times [2024-06-27 22:11:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389633293] [2024-06-27 22:11:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389633293] [2024-06-27 22:11:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389633293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:47,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:47,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:47,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52428573] [2024-06-27 22:11:47,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:47,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:47,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:47,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:47,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:11:47,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 281 transitions, 3624 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:47,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:47,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:11:47,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:48,399 INFO L124 PetriNetUnfolderBase]: 1150/2372 cut-off events. [2024-06-27 22:11:48,399 INFO L125 PetriNetUnfolderBase]: For 74427/74443 co-relation queries the response was YES. [2024-06-27 22:11:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14491 conditions, 2372 events. 1150/2372 cut-off events. For 74427/74443 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16469 event pairs, 145 based on Foata normal form. 5/2241 useless extension candidates. Maximal degree in co-relation 14377. Up to 1368 conditions per place. [2024-06-27 22:11:48,425 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 168 selfloop transitions, 69 changer transitions 0/319 dead transitions. [2024-06-27 22:11:48,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 319 transitions, 4444 flow [2024-06-27 22:11:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:11:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:11:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 22:11:48,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:11:48,426 INFO L175 Difference]: Start difference. First operand has 259 places, 281 transitions, 3624 flow. Second operand 9 states and 171 transitions. [2024-06-27 22:11:48,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 319 transitions, 4444 flow [2024-06-27 22:11:48,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 319 transitions, 4275 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:48,848 INFO L231 Difference]: Finished difference. Result has 260 places, 288 transitions, 3806 flow [2024-06-27 22:11:48,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3455, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3806, PETRI_PLACES=260, PETRI_TRANSITIONS=288} [2024-06-27 22:11:48,848 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 220 predicate places. [2024-06-27 22:11:48,849 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 288 transitions, 3806 flow [2024-06-27 22:11:48,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:11:48,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:48,849 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:11:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:11:48,849 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:48,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1397403081, now seen corresponding path program 15 times [2024-06-27 22:11:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290036744] [2024-06-27 22:11:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290036744] [2024-06-27 22:11:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290036744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:50,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067309670] [2024-06-27 22:11:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:50,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:50,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:50,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:50,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 288 transitions, 3806 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:11:50,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:50,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:50,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:51,120 INFO L124 PetriNetUnfolderBase]: 1311/2571 cut-off events. [2024-06-27 22:11:51,120 INFO L125 PetriNetUnfolderBase]: For 84876/84876 co-relation queries the response was YES. [2024-06-27 22:11:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16587 conditions, 2571 events. 1311/2571 cut-off events. For 84876/84876 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17325 event pairs, 311 based on Foata normal form. 2/2415 useless extension candidates. Maximal degree in co-relation 16472. Up to 2099 conditions per place. [2024-06-27 22:11:51,147 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 262 selfloop transitions, 49 changer transitions 0/320 dead transitions. [2024-06-27 22:11:51,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 320 transitions, 4778 flow [2024-06-27 22:11:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 22:11:51,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 22:11:51,149 INFO L175 Difference]: Start difference. First operand has 260 places, 288 transitions, 3806 flow. Second operand 10 states and 168 transitions. [2024-06-27 22:11:51,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 320 transitions, 4778 flow [2024-06-27 22:11:51,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 4518 flow, removed 87 selfloop flow, removed 6 redundant places. [2024-06-27 22:11:51,623 INFO L231 Difference]: Finished difference. Result has 264 places, 295 transitions, 3928 flow [2024-06-27 22:11:51,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3631, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3928, PETRI_PLACES=264, PETRI_TRANSITIONS=295} [2024-06-27 22:11:51,623 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 224 predicate places. [2024-06-27 22:11:51,623 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 295 transitions, 3928 flow [2024-06-27 22:11:51,623 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:11:51,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:51,623 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:11:51,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:11:51,623 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:51,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1307737131, now seen corresponding path program 16 times [2024-06-27 22:11:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082033325] [2024-06-27 22:11:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082033325] [2024-06-27 22:11:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082033325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:11:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073165265] [2024-06-27 22:11:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:53,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:11:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:11:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:11:53,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:53,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 295 transitions, 3928 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:11:53,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:53,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:53,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:54,246 INFO L124 PetriNetUnfolderBase]: 1348/2657 cut-off events. [2024-06-27 22:11:54,246 INFO L125 PetriNetUnfolderBase]: For 84450/84450 co-relation queries the response was YES. [2024-06-27 22:11:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16830 conditions, 2657 events. 1348/2657 cut-off events. For 84450/84450 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18123 event pairs, 366 based on Foata normal form. 2/2497 useless extension candidates. Maximal degree in co-relation 16714. Up to 2249 conditions per place. [2024-06-27 22:11:54,276 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 274 selfloop transitions, 43 changer transitions 0/326 dead transitions. [2024-06-27 22:11:54,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 326 transitions, 4873 flow [2024-06-27 22:11:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:11:54,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:11:54,277 INFO L175 Difference]: Start difference. First operand has 264 places, 295 transitions, 3928 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:11:54,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 326 transitions, 4873 flow [2024-06-27 22:11:54,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 326 transitions, 4622 flow, removed 82 selfloop flow, removed 8 redundant places. [2024-06-27 22:11:54,735 INFO L231 Difference]: Finished difference. Result has 267 places, 302 transitions, 3944 flow [2024-06-27 22:11:54,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3944, PETRI_PLACES=267, PETRI_TRANSITIONS=302} [2024-06-27 22:11:54,735 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 227 predicate places. [2024-06-27 22:11:54,736 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 302 transitions, 3944 flow [2024-06-27 22:11:54,736 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:11:54,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:54,736 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:11:54,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:11:54,736 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:54,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1307914761, now seen corresponding path program 17 times [2024-06-27 22:11:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456809756] [2024-06-27 22:11:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456809756] [2024-06-27 22:11:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456809756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801703929] [2024-06-27 22:11:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:56,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:56,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 302 transitions, 3944 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:56,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:56,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:56,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:11:57,126 INFO L124 PetriNetUnfolderBase]: 1375/2707 cut-off events. [2024-06-27 22:11:57,126 INFO L125 PetriNetUnfolderBase]: For 85890/85890 co-relation queries the response was YES. [2024-06-27 22:11:57,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16973 conditions, 2707 events. 1375/2707 cut-off events. For 85890/85890 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18564 event pairs, 360 based on Foata normal form. 2/2546 useless extension candidates. Maximal degree in co-relation 16855. Up to 2276 conditions per place. [2024-06-27 22:11:57,156 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 276 selfloop transitions, 45 changer transitions 0/330 dead transitions. [2024-06-27 22:11:57,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 330 transitions, 4804 flow [2024-06-27 22:11:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:11:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:11:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:11:57,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:11:57,158 INFO L175 Difference]: Start difference. First operand has 267 places, 302 transitions, 3944 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:11:57,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 330 transitions, 4804 flow [2024-06-27 22:11:57,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 330 transitions, 4724 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:11:57,624 INFO L231 Difference]: Finished difference. Result has 270 places, 308 transitions, 4115 flow [2024-06-27 22:11:57,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3864, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4115, PETRI_PLACES=270, PETRI_TRANSITIONS=308} [2024-06-27 22:11:57,624 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 230 predicate places. [2024-06-27 22:11:57,624 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 308 transitions, 4115 flow [2024-06-27 22:11:57,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:57,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:11:57,624 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:11:57,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:11:57,625 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:11:57,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:11:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1231579893, now seen corresponding path program 18 times [2024-06-27 22:11:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:11:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729569536] [2024-06-27 22:11:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:11:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:11:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:11:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:11:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:11:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729569536] [2024-06-27 22:11:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729569536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:11:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:11:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:11:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848237593] [2024-06-27 22:11:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:11:59,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:11:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:11:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:11:59,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:11:59,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:11:59,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 308 transitions, 4115 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:11:59,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:11:59,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:11:59,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:00,938 INFO L124 PetriNetUnfolderBase]: 1395/2744 cut-off events. [2024-06-27 22:12:00,938 INFO L125 PetriNetUnfolderBase]: For 91564/91564 co-relation queries the response was YES. [2024-06-27 22:12:00,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17445 conditions, 2744 events. 1395/2744 cut-off events. For 91564/91564 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18886 event pairs, 381 based on Foata normal form. 2/2580 useless extension candidates. Maximal degree in co-relation 17326. Up to 2313 conditions per place. [2024-06-27 22:12:00,963 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 256 selfloop transitions, 67 changer transitions 0/332 dead transitions. [2024-06-27 22:12:00,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 4957 flow [2024-06-27 22:12:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:12:00,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:12:00,964 INFO L175 Difference]: Start difference. First operand has 270 places, 308 transitions, 4115 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:12:00,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 4957 flow [2024-06-27 22:12:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 332 transitions, 4782 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:01,453 INFO L231 Difference]: Finished difference. Result has 272 places, 312 transitions, 4212 flow [2024-06-27 22:12:01,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4212, PETRI_PLACES=272, PETRI_TRANSITIONS=312} [2024-06-27 22:12:01,454 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 232 predicate places. [2024-06-27 22:12:01,454 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 312 transitions, 4212 flow [2024-06-27 22:12:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:12:01,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:01,454 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:12:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:12:01,454 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:01,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1237836003, now seen corresponding path program 19 times [2024-06-27 22:12:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717020303] [2024-06-27 22:12:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717020303] [2024-06-27 22:12:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717020303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:03,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:03,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329952889] [2024-06-27 22:12:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:03,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:03,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:03,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:12:03,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 312 transitions, 4212 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:12:03,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:03,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:12:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:04,259 INFO L124 PetriNetUnfolderBase]: 1415/2781 cut-off events. [2024-06-27 22:12:04,259 INFO L125 PetriNetUnfolderBase]: For 95170/95170 co-relation queries the response was YES. [2024-06-27 22:12:04,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17762 conditions, 2781 events. 1415/2781 cut-off events. For 95170/95170 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 19168 event pairs, 389 based on Foata normal form. 2/2616 useless extension candidates. Maximal degree in co-relation 17642. Up to 2374 conditions per place. [2024-06-27 22:12:04,288 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 276 selfloop transitions, 51 changer transitions 0/336 dead transitions. [2024-06-27 22:12:04,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 336 transitions, 5066 flow [2024-06-27 22:12:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:12:04,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-27 22:12:04,289 INFO L175 Difference]: Start difference. First operand has 272 places, 312 transitions, 4212 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:12:04,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 336 transitions, 5066 flow [2024-06-27 22:12:04,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 336 transitions, 4832 flow, removed 53 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:04,856 INFO L231 Difference]: Finished difference. Result has 274 places, 316 transitions, 4222 flow [2024-06-27 22:12:04,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3978, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4222, PETRI_PLACES=274, PETRI_TRANSITIONS=316} [2024-06-27 22:12:04,856 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 234 predicate places. [2024-06-27 22:12:04,856 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 316 transitions, 4222 flow [2024-06-27 22:12:04,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:12:04,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:04,856 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:12:04,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:12:04,857 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:04,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2001150157, now seen corresponding path program 20 times [2024-06-27 22:12:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194569689] [2024-06-27 22:12:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194569689] [2024-06-27 22:12:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194569689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073106553] [2024-06-27 22:12:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:06,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:12:06,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 316 transitions, 4222 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:12:06,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:06,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:12:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:07,413 INFO L124 PetriNetUnfolderBase]: 1419/2789 cut-off events. [2024-06-27 22:12:07,413 INFO L125 PetriNetUnfolderBase]: For 88136/88136 co-relation queries the response was YES. [2024-06-27 22:12:07,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17374 conditions, 2789 events. 1419/2789 cut-off events. For 88136/88136 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19239 event pairs, 381 based on Foata normal form. 2/2624 useless extension candidates. Maximal degree in co-relation 17253. Up to 2356 conditions per place. [2024-06-27 22:12:07,439 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 283 selfloop transitions, 50 changer transitions 0/342 dead transitions. [2024-06-27 22:12:07,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 342 transitions, 5100 flow [2024-06-27 22:12:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:12:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:12:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:12:07,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:12:07,441 INFO L175 Difference]: Start difference. First operand has 274 places, 316 transitions, 4222 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:12:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 342 transitions, 5100 flow [2024-06-27 22:12:07,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 342 transitions, 4894 flow, removed 55 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:07,942 INFO L231 Difference]: Finished difference. Result has 275 places, 320 transitions, 4262 flow [2024-06-27 22:12:07,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4016, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4262, PETRI_PLACES=275, PETRI_TRANSITIONS=320} [2024-06-27 22:12:07,942 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 235 predicate places. [2024-06-27 22:12:07,942 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 320 transitions, 4262 flow [2024-06-27 22:12:07,942 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:12:07,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:07,943 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:12:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:12:07,943 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:07,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1407276837, now seen corresponding path program 1 times [2024-06-27 22:12:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977782765] [2024-06-27 22:12:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977782765] [2024-06-27 22:12:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977782765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376320986] [2024-06-27 22:12:09,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:09,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:09,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:09,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:09,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 320 transitions, 4262 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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:12:09,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:09,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:09,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:10,511 INFO L124 PetriNetUnfolderBase]: 1245/2559 cut-off events. [2024-06-27 22:12:10,511 INFO L125 PetriNetUnfolderBase]: For 110023/110037 co-relation queries the response was YES. [2024-06-27 22:12:10,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16070 conditions, 2559 events. 1245/2559 cut-off events. For 110023/110037 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18234 event pairs, 357 based on Foata normal form. 14/2378 useless extension candidates. Maximal degree in co-relation 15948. Up to 1859 conditions per place. [2024-06-27 22:12:10,539 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 276 selfloop transitions, 56 changer transitions 0/346 dead transitions. [2024-06-27 22:12:10,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 346 transitions, 5150 flow [2024-06-27 22:12:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:12:10,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:12:10,541 INFO L175 Difference]: Start difference. First operand has 275 places, 320 transitions, 4262 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:12:10,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 346 transitions, 5150 flow [2024-06-27 22:12:11,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 346 transitions, 4942 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:11,093 INFO L231 Difference]: Finished difference. Result has 279 places, 321 transitions, 4244 flow [2024-06-27 22:12:11,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4054, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4244, PETRI_PLACES=279, PETRI_TRANSITIONS=321} [2024-06-27 22:12:11,094 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 239 predicate places. [2024-06-27 22:12:11,094 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 321 transitions, 4244 flow [2024-06-27 22:12:11,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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:12:11,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:11,094 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:12:11,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:12:11,095 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:11,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1050651883, now seen corresponding path program 2 times [2024-06-27 22:12:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230644811] [2024-06-27 22:12:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:12,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230644811] [2024-06-27 22:12:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230644811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:12,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:12:12,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106286052] [2024-06-27 22:12:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:12,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:12:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:12:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:12:13,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:13,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 321 transitions, 4244 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:13,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:13,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:13,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:13,787 INFO L124 PetriNetUnfolderBase]: 1285/2653 cut-off events. [2024-06-27 22:12:13,787 INFO L125 PetriNetUnfolderBase]: For 102446/102458 co-relation queries the response was YES. [2024-06-27 22:12:13,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16903 conditions, 2653 events. 1285/2653 cut-off events. For 102446/102458 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 19176 event pairs, 431 based on Foata normal form. 8/2457 useless extension candidates. Maximal degree in co-relation 16779. Up to 2037 conditions per place. [2024-06-27 22:12:13,818 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 278 selfloop transitions, 56 changer transitions 0/348 dead transitions. [2024-06-27 22:12:13,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 348 transitions, 5408 flow [2024-06-27 22:12:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:12:13,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:12:13,819 INFO L175 Difference]: Start difference. First operand has 279 places, 321 transitions, 4244 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:12:13,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 348 transitions, 5408 flow [2024-06-27 22:12:14,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 348 transitions, 5272 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:14,423 INFO L231 Difference]: Finished difference. Result has 284 places, 325 transitions, 4385 flow [2024-06-27 22:12:14,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4108, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4385, PETRI_PLACES=284, PETRI_TRANSITIONS=325} [2024-06-27 22:12:14,423 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 244 predicate places. [2024-06-27 22:12:14,424 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 325 transitions, 4385 flow [2024-06-27 22:12:14,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:14,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:14,424 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:12:14,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:12:14,424 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:14,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1154873847, now seen corresponding path program 3 times [2024-06-27 22:12:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914480290] [2024-06-27 22:12:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914480290] [2024-06-27 22:12:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914480290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:12:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350443820] [2024-06-27 22:12:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:12:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:12:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:12:16,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:16,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 325 transitions, 4385 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:16,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:16,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:16,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:17,167 INFO L124 PetriNetUnfolderBase]: 1282/2641 cut-off events. [2024-06-27 22:12:17,167 INFO L125 PetriNetUnfolderBase]: For 96473/96488 co-relation queries the response was YES. [2024-06-27 22:12:17,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16868 conditions, 2641 events. 1282/2641 cut-off events. For 96473/96488 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 19028 event pairs, 443 based on Foata normal form. 8/2445 useless extension candidates. Maximal degree in co-relation 16741. Up to 2192 conditions per place. [2024-06-27 22:12:17,190 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 276 selfloop transitions, 52 changer transitions 0/342 dead transitions. [2024-06-27 22:12:17,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 342 transitions, 5155 flow [2024-06-27 22:12:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:12:17,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:12:17,192 INFO L175 Difference]: Start difference. First operand has 284 places, 325 transitions, 4385 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:12:17,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 342 transitions, 5155 flow [2024-06-27 22:12:17,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 342 transitions, 5057 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 22:12:17,751 INFO L231 Difference]: Finished difference. Result has 289 places, 325 transitions, 4395 flow [2024-06-27 22:12:17,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4395, PETRI_PLACES=289, PETRI_TRANSITIONS=325} [2024-06-27 22:12:17,752 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 249 predicate places. [2024-06-27 22:12:17,752 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 325 transitions, 4395 flow [2024-06-27 22:12:17,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:17,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:17,752 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:12:17,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:12:17,752 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:17,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -855251887, now seen corresponding path program 4 times [2024-06-27 22:12:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886947619] [2024-06-27 22:12:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:19,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:12:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886947619] [2024-06-27 22:12:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886947619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:12:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866189522] [2024-06-27 22:12:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:12:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:12:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:12:19,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:19,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 325 transitions, 4395 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:19,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:19,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:19,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:20,383 INFO L124 PetriNetUnfolderBase]: 1303/2748 cut-off events. [2024-06-27 22:12:20,383 INFO L125 PetriNetUnfolderBase]: For 98886/98904 co-relation queries the response was YES. [2024-06-27 22:12:20,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 2748 events. 1303/2748 cut-off events. For 98886/98904 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20106 event pairs, 305 based on Foata normal form. 2/2548 useless extension candidates. Maximal degree in co-relation 17099. Up to 1862 conditions per place. [2024-06-27 22:12:20,411 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 271 selfloop transitions, 71 changer transitions 0/356 dead transitions. [2024-06-27 22:12:20,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 356 transitions, 5458 flow [2024-06-27 22:12:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:12:20,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:12:20,413 INFO L175 Difference]: Start difference. First operand has 289 places, 325 transitions, 4395 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:12:20,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 356 transitions, 5458 flow [2024-06-27 22:12:21,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 356 transitions, 5350 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:21,045 INFO L231 Difference]: Finished difference. Result has 294 places, 331 transitions, 4746 flow [2024-06-27 22:12:21,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4746, PETRI_PLACES=294, PETRI_TRANSITIONS=331} [2024-06-27 22:12:21,045 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 254 predicate places. [2024-06-27 22:12:21,045 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 331 transitions, 4746 flow [2024-06-27 22:12:21,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:21,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:21,046 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:12:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:12:21,046 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:21,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2100665555, now seen corresponding path program 5 times [2024-06-27 22:12:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679789567] [2024-06-27 22:12:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:23,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:12:23,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679789567] [2024-06-27 22:12:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679789567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:23,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:23,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:12:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207024280] [2024-06-27 22:12:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:23,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:12:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:12:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:12:23,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:23,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 331 transitions, 4746 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:23,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:23,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:24,097 INFO L124 PetriNetUnfolderBase]: 1343/2824 cut-off events. [2024-06-27 22:12:24,097 INFO L125 PetriNetUnfolderBase]: For 119099/119114 co-relation queries the response was YES. [2024-06-27 22:12:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18755 conditions, 2824 events. 1343/2824 cut-off events. For 119099/119114 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20814 event pairs, 452 based on Foata normal form. 10/2615 useless extension candidates. Maximal degree in co-relation 18622. Up to 2213 conditions per place. [2024-06-27 22:12:24,127 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 284 selfloop transitions, 56 changer transitions 0/354 dead transitions. [2024-06-27 22:12:24,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 354 transitions, 5912 flow [2024-06-27 22:12:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:12:24,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:12:24,128 INFO L175 Difference]: Start difference. First operand has 294 places, 331 transitions, 4746 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:12:24,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 354 transitions, 5912 flow [2024-06-27 22:12:24,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 354 transitions, 5702 flow, removed 75 selfloop flow, removed 5 redundant places. [2024-06-27 22:12:24,890 INFO L231 Difference]: Finished difference. Result has 300 places, 334 transitions, 4788 flow [2024-06-27 22:12:24,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4536, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4788, PETRI_PLACES=300, PETRI_TRANSITIONS=334} [2024-06-27 22:12:24,891 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 260 predicate places. [2024-06-27 22:12:24,891 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 334 transitions, 4788 flow [2024-06-27 22:12:24,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:24,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:24,891 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:12:24,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:12:24,891 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:24,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2100872945, now seen corresponding path program 6 times [2024-06-27 22:12:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515284558] [2024-06-27 22:12:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515284558] [2024-06-27 22:12:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515284558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:12:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289469203] [2024-06-27 22:12:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:26,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:12:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:12:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:12:26,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:12:26,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 334 transitions, 4788 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:26,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:26,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:12:26,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:27,291 INFO L124 PetriNetUnfolderBase]: 1340/2819 cut-off events. [2024-06-27 22:12:27,291 INFO L125 PetriNetUnfolderBase]: For 110138/110150 co-relation queries the response was YES. [2024-06-27 22:12:27,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18382 conditions, 2819 events. 1340/2819 cut-off events. For 110138/110150 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20785 event pairs, 456 based on Foata normal form. 10/2608 useless extension candidates. Maximal degree in co-relation 18247. Up to 2293 conditions per place. [2024-06-27 22:12:27,323 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 281 selfloop transitions, 53 changer transitions 0/349 dead transitions. [2024-06-27 22:12:27,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 349 transitions, 5566 flow [2024-06-27 22:12:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:12:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:12:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 22:12:27,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-27 22:12:27,324 INFO L175 Difference]: Start difference. First operand has 300 places, 334 transitions, 4788 flow. Second operand 9 states and 161 transitions. [2024-06-27 22:12:27,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 349 transitions, 5566 flow [2024-06-27 22:12:28,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 349 transitions, 5438 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 22:12:28,138 INFO L231 Difference]: Finished difference. Result has 304 places, 334 transitions, 4770 flow [2024-06-27 22:12:28,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4660, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4770, PETRI_PLACES=304, PETRI_TRANSITIONS=334} [2024-06-27 22:12:28,138 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 264 predicate places. [2024-06-27 22:12:28,139 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 334 transitions, 4770 flow [2024-06-27 22:12:28,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:28,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:28,139 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:12:28,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:12:28,139 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:28,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2103078567, now seen corresponding path program 7 times [2024-06-27 22:12:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147690124] [2024-06-27 22:12:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147690124] [2024-06-27 22:12:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147690124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273816130] [2024-06-27 22:12:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:30,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:31,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:31,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 334 transitions, 4770 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:31,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:31,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:31,919 INFO L124 PetriNetUnfolderBase]: 1356/2857 cut-off events. [2024-06-27 22:12:31,920 INFO L125 PetriNetUnfolderBase]: For 109960/109975 co-relation queries the response was YES. [2024-06-27 22:12:31,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18507 conditions, 2857 events. 1356/2857 cut-off events. For 109960/109975 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21134 event pairs, 464 based on Foata normal form. 9/2642 useless extension candidates. Maximal degree in co-relation 18370. Up to 2270 conditions per place. [2024-06-27 22:12:31,956 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 265 selfloop transitions, 71 changer transitions 0/350 dead transitions. [2024-06-27 22:12:31,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 350 transitions, 5584 flow [2024-06-27 22:12:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 22:12:31,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-27 22:12:31,957 INFO L175 Difference]: Start difference. First operand has 304 places, 334 transitions, 4770 flow. Second operand 10 states and 167 transitions. [2024-06-27 22:12:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 350 transitions, 5584 flow [2024-06-27 22:12:32,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 350 transitions, 5477 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:12:32,844 INFO L231 Difference]: Finished difference. Result has 307 places, 335 transitions, 4843 flow [2024-06-27 22:12:32,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4663, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4843, PETRI_PLACES=307, PETRI_TRANSITIONS=335} [2024-06-27 22:12:32,844 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 267 predicate places. [2024-06-27 22:12:32,844 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 335 transitions, 4843 flow [2024-06-27 22:12:32,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:32,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:32,845 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:12:32,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:12:32,845 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:32,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2102871177, now seen corresponding path program 8 times [2024-06-27 22:12:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440491915] [2024-06-27 22:12:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440491915] [2024-06-27 22:12:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440491915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:12:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630767414] [2024-06-27 22:12:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:34,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:12:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:34,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:12:34,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:12:35,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:35,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 335 transitions, 4843 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:35,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:35,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:35,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:36,280 INFO L124 PetriNetUnfolderBase]: 1453/3137 cut-off events. [2024-06-27 22:12:36,281 INFO L125 PetriNetUnfolderBase]: For 163946/163961 co-relation queries the response was YES. [2024-06-27 22:12:36,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21295 conditions, 3137 events. 1453/3137 cut-off events. For 163946/163961 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23998 event pairs, 517 based on Foata normal form. 9/2900 useless extension candidates. Maximal degree in co-relation 21157. Up to 2204 conditions per place. [2024-06-27 22:12:36,331 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 265 selfloop transitions, 82 changer transitions 0/361 dead transitions. [2024-06-27 22:12:36,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 361 transitions, 6077 flow [2024-06-27 22:12:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:12:36,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 22:12:36,333 INFO L175 Difference]: Start difference. First operand has 307 places, 335 transitions, 4843 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:12:36,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 361 transitions, 6077 flow [2024-06-27 22:12:37,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 361 transitions, 5913 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:37,381 INFO L231 Difference]: Finished difference. Result has 310 places, 338 transitions, 4997 flow [2024-06-27 22:12:37,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4679, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4997, PETRI_PLACES=310, PETRI_TRANSITIONS=338} [2024-06-27 22:12:37,382 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 270 predicate places. [2024-06-27 22:12:37,382 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 338 transitions, 4997 flow [2024-06-27 22:12:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:12:37,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:37,382 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:12:37,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:12:37,382 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:37,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1903425237, now seen corresponding path program 9 times [2024-06-27 22:12:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962531028] [2024-06-27 22:12:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962531028] [2024-06-27 22:12:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962531028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:39,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803612313] [2024-06-27 22:12:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:39,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:39,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:39,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 338 transitions, 4997 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:39,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:39,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:39,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:40,271 INFO L124 PetriNetUnfolderBase]: 1476/3178 cut-off events. [2024-06-27 22:12:40,272 INFO L125 PetriNetUnfolderBase]: For 170481/170496 co-relation queries the response was YES. [2024-06-27 22:12:40,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21914 conditions, 3178 events. 1476/3178 cut-off events. For 170481/170496 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24417 event pairs, 503 based on Foata normal form. 10/2942 useless extension candidates. Maximal degree in co-relation 21774. Up to 2451 conditions per place. [2024-06-27 22:12:40,313 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 294 selfloop transitions, 54 changer transitions 0/362 dead transitions. [2024-06-27 22:12:40,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 362 transitions, 5959 flow [2024-06-27 22:12:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:12:40,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:12:40,314 INFO L175 Difference]: Start difference. First operand has 310 places, 338 transitions, 4997 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:12:40,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 362 transitions, 5959 flow [2024-06-27 22:12:41,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 362 transitions, 5757 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:41,472 INFO L231 Difference]: Finished difference. Result has 314 places, 341 transitions, 5067 flow [2024-06-27 22:12:41,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5067, PETRI_PLACES=314, PETRI_TRANSITIONS=341} [2024-06-27 22:12:41,473 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 274 predicate places. [2024-06-27 22:12:41,473 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 341 transitions, 5067 flow [2024-06-27 22:12:41,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:41,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:41,473 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:12:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:12:41,473 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:41,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2110228407, now seen corresponding path program 10 times [2024-06-27 22:12:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683783266] [2024-06-27 22:12:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683783266] [2024-06-27 22:12:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683783266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:12:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462054218] [2024-06-27 22:12:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:43,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:12:43,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:12:43,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:12:43,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:43,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 341 transitions, 5067 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:43,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:43,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:43,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:44,288 INFO L124 PetriNetUnfolderBase]: 1463/3179 cut-off events. [2024-06-27 22:12:44,288 INFO L125 PetriNetUnfolderBase]: For 161261/161276 co-relation queries the response was YES. [2024-06-27 22:12:44,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20714 conditions, 3179 events. 1463/3179 cut-off events. For 161261/161276 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24489 event pairs, 528 based on Foata normal form. 17/2941 useless extension candidates. Maximal degree in co-relation 20572. Up to 2346 conditions per place. [2024-06-27 22:12:44,332 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 258 selfloop transitions, 87 changer transitions 0/359 dead transitions. [2024-06-27 22:12:44,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 359 transitions, 5905 flow [2024-06-27 22:12:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:12:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:12:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:12:44,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:12:44,333 INFO L175 Difference]: Start difference. First operand has 314 places, 341 transitions, 5067 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:12:44,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 359 transitions, 5905 flow [2024-06-27 22:12:45,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 359 transitions, 5687 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-27 22:12:45,400 INFO L231 Difference]: Finished difference. Result has 318 places, 341 transitions, 5029 flow [2024-06-27 22:12:45,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4849, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5029, PETRI_PLACES=318, PETRI_TRANSITIONS=341} [2024-06-27 22:12:45,401 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 278 predicate places. [2024-06-27 22:12:45,401 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 341 transitions, 5029 flow [2024-06-27 22:12:45,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:45,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:45,401 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:12:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:12:45,402 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:45,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2103086503, now seen corresponding path program 1 times [2024-06-27 22:12:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899014798] [2024-06-27 22:12:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:48,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:12:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899014798] [2024-06-27 22:12:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899014798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:12:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279047507] [2024-06-27 22:12:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:48,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:12:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:12:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:12:48,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:48,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 341 transitions, 5029 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:48,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:48,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:48,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:49,573 INFO L124 PetriNetUnfolderBase]: 1511/3317 cut-off events. [2024-06-27 22:12:49,573 INFO L125 PetriNetUnfolderBase]: For 156048/156062 co-relation queries the response was YES. [2024-06-27 22:12:49,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21213 conditions, 3317 events. 1511/3317 cut-off events. For 156048/156062 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26035 event pairs, 560 based on Foata normal form. 15/3065 useless extension candidates. Maximal degree in co-relation 21070. Up to 2468 conditions per place. [2024-06-27 22:12:49,620 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 268 selfloop transitions, 78 changer transitions 0/360 dead transitions. [2024-06-27 22:12:49,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 360 transitions, 5871 flow [2024-06-27 22:12:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:12:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:12:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-27 22:12:49,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-27 22:12:49,621 INFO L175 Difference]: Start difference. First operand has 318 places, 341 transitions, 5029 flow. Second operand 11 states and 185 transitions. [2024-06-27 22:12:49,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 360 transitions, 5871 flow [2024-06-27 22:12:50,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 360 transitions, 5699 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-27 22:12:50,616 INFO L231 Difference]: Finished difference. Result has 321 places, 341 transitions, 5017 flow [2024-06-27 22:12:50,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4857, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5017, PETRI_PLACES=321, PETRI_TRANSITIONS=341} [2024-06-27 22:12:50,616 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 281 predicate places. [2024-06-27 22:12:50,617 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 5017 flow [2024-06-27 22:12:50,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:50,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:50,617 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:12:50,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:12:50,617 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:50,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2110236343, now seen corresponding path program 2 times [2024-06-27 22:12:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276000026] [2024-06-27 22:12:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276000026] [2024-06-27 22:12:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276000026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:54,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:12:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189945750] [2024-06-27 22:12:54,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:54,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:12:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:12:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:12:55,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:55,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 5017 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:55,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:55,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:12:56,165 INFO L124 PetriNetUnfolderBase]: 1558/3439 cut-off events. [2024-06-27 22:12:56,165 INFO L125 PetriNetUnfolderBase]: For 164017/164032 co-relation queries the response was YES. [2024-06-27 22:12:56,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21954 conditions, 3439 events. 1558/3439 cut-off events. For 164017/164032 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27394 event pairs, 596 based on Foata normal form. 15/3182 useless extension candidates. Maximal degree in co-relation 21810. Up to 2590 conditions per place. [2024-06-27 22:12:56,210 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 265 selfloop transitions, 81 changer transitions 0/360 dead transitions. [2024-06-27 22:12:56,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 360 transitions, 5859 flow [2024-06-27 22:12:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:12:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:12:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-27 22:12:56,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-27 22:12:56,212 INFO L175 Difference]: Start difference. First operand has 321 places, 341 transitions, 5017 flow. Second operand 11 states and 182 transitions. [2024-06-27 22:12:56,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 360 transitions, 5859 flow [2024-06-27 22:12:57,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 360 transitions, 5705 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:12:57,225 INFO L231 Difference]: Finished difference. Result has 323 places, 341 transitions, 5029 flow [2024-06-27 22:12:57,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4863, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5029, PETRI_PLACES=323, PETRI_TRANSITIONS=341} [2024-06-27 22:12:57,225 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 283 predicate places. [2024-06-27 22:12:57,226 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 341 transitions, 5029 flow [2024-06-27 22:12:57,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:57,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:12:57,226 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:12:57,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:12:57,226 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:12:57,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:12:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2110505113, now seen corresponding path program 3 times [2024-06-27 22:12:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:12:57,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28055903] [2024-06-27 22:12:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:12:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:12:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:12:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:12:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:12:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28055903] [2024-06-27 22:12:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28055903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:12:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:12:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:12:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472477574] [2024-06-27 22:12:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:12:59,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:12:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:12:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:12:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:12:59,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:12:59,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 341 transitions, 5029 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:12:59,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:12:59,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:12:59,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:00,994 INFO L124 PetriNetUnfolderBase]: 1588/3539 cut-off events. [2024-06-27 22:13:00,995 INFO L125 PetriNetUnfolderBase]: For 160295/160307 co-relation queries the response was YES. [2024-06-27 22:13:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22492 conditions, 3539 events. 1588/3539 cut-off events. For 160295/160307 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28515 event pairs, 607 based on Foata normal form. 13/3274 useless extension candidates. Maximal degree in co-relation 22347. Up to 2187 conditions per place. [2024-06-27 22:13:01,052 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 263 selfloop transitions, 89 changer transitions 0/366 dead transitions. [2024-06-27 22:13:01,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 366 transitions, 5995 flow [2024-06-27 22:13:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:13:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:13:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-27 22:13:01,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-06-27 22:13:01,054 INFO L175 Difference]: Start difference. First operand has 323 places, 341 transitions, 5029 flow. Second operand 11 states and 188 transitions. [2024-06-27 22:13:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 366 transitions, 5995 flow [2024-06-27 22:13:02,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 366 transitions, 5835 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:13:02,290 INFO L231 Difference]: Finished difference. Result has 325 places, 341 transitions, 5050 flow [2024-06-27 22:13:02,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4869, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5050, PETRI_PLACES=325, PETRI_TRANSITIONS=341} [2024-06-27 22:13:02,291 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 285 predicate places. [2024-06-27 22:13:02,291 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 341 transitions, 5050 flow [2024-06-27 22:13:02,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:02,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:02,291 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:13:02,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:13:02,292 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:02,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1073577265, now seen corresponding path program 11 times [2024-06-27 22:13:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244189699] [2024-06-27 22:13:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244189699] [2024-06-27 22:13:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244189699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463317249] [2024-06-27 22:13:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:04,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:04,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:04,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 341 transitions, 5050 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:04,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:04,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:04,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:05,549 INFO L124 PetriNetUnfolderBase]: 1623/3657 cut-off events. [2024-06-27 22:13:05,549 INFO L125 PetriNetUnfolderBase]: For 161607/161622 co-relation queries the response was YES. [2024-06-27 22:13:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23637 conditions, 3657 events. 1623/3657 cut-off events. For 161607/161622 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29866 event pairs, 652 based on Foata normal form. 9/3376 useless extension candidates. Maximal degree in co-relation 23491. Up to 2828 conditions per place. [2024-06-27 22:13:05,598 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 295 selfloop transitions, 53 changer transitions 0/362 dead transitions. [2024-06-27 22:13:05,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 362 transitions, 6258 flow [2024-06-27 22:13:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:13:05,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-27 22:13:05,599 INFO L175 Difference]: Start difference. First operand has 325 places, 341 transitions, 5050 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:13:05,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 362 transitions, 6258 flow [2024-06-27 22:13:06,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 362 transitions, 6091 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 22:13:06,920 INFO L231 Difference]: Finished difference. Result has 327 places, 344 transitions, 5137 flow [2024-06-27 22:13:06,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4883, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5137, PETRI_PLACES=327, PETRI_TRANSITIONS=344} [2024-06-27 22:13:06,920 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 287 predicate places. [2024-06-27 22:13:06,920 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 344 transitions, 5137 flow [2024-06-27 22:13:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:06,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:06,921 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:13:06,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:13:06,921 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:06,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1483620169, now seen corresponding path program 12 times [2024-06-27 22:13:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:06,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878420045] [2024-06-27 22:13:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878420045] [2024-06-27 22:13:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878420045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:13:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636344001] [2024-06-27 22:13:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:09,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:13:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:09,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:13:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:13:09,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:09,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 344 transitions, 5137 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:13:09,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:09,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:09,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:10,242 INFO L124 PetriNetUnfolderBase]: 1620/3652 cut-off events. [2024-06-27 22:13:10,242 INFO L125 PetriNetUnfolderBase]: For 154746/154758 co-relation queries the response was YES. [2024-06-27 22:13:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23394 conditions, 3652 events. 1620/3652 cut-off events. For 154746/154758 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29844 event pairs, 659 based on Foata normal form. 9/3370 useless extension candidates. Maximal degree in co-relation 23247. Up to 2869 conditions per place. [2024-06-27 22:13:10,288 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 292 selfloop transitions, 51 changer transitions 0/357 dead transitions. [2024-06-27 22:13:10,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 357 transitions, 5927 flow [2024-06-27 22:13:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:13:10,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-27 22:13:10,289 INFO L175 Difference]: Start difference. First operand has 327 places, 344 transitions, 5137 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:13:10,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 357 transitions, 5927 flow [2024-06-27 22:13:11,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 357 transitions, 5758 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 22:13:11,616 INFO L231 Difference]: Finished difference. Result has 331 places, 344 transitions, 5074 flow [2024-06-27 22:13:11,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4968, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5074, PETRI_PLACES=331, PETRI_TRANSITIONS=344} [2024-06-27 22:13:11,616 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 291 predicate places. [2024-06-27 22:13:11,616 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 344 transitions, 5074 flow [2024-06-27 22:13:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:13:11,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:11,616 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:13:11,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:13:11,617 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:11,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1489132279, now seen corresponding path program 13 times [2024-06-27 22:13:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181946965] [2024-06-27 22:13:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:13,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:13,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181946965] [2024-06-27 22:13:13,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181946965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:13,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:13,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:13:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982312132] [2024-06-27 22:13:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:13,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:13:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:13:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:13:13,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:13,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 344 transitions, 5074 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:13,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:13,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:13,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:14,146 INFO L124 PetriNetUnfolderBase]: 1642/3719 cut-off events. [2024-06-27 22:13:14,147 INFO L125 PetriNetUnfolderBase]: For 157202/157216 co-relation queries the response was YES. [2024-06-27 22:13:14,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23693 conditions, 3719 events. 1642/3719 cut-off events. For 157202/157216 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 30645 event pairs, 650 based on Foata normal form. 9/3431 useless extension candidates. Maximal degree in co-relation 23545. Up to 2865 conditions per place. [2024-06-27 22:13:14,194 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 301 selfloop transitions, 50 changer transitions 0/366 dead transitions. [2024-06-27 22:13:14,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 366 transitions, 6042 flow [2024-06-27 22:13:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 22:13:14,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2024-06-27 22:13:14,195 INFO L175 Difference]: Start difference. First operand has 331 places, 344 transitions, 5074 flow. Second operand 9 states and 166 transitions. [2024-06-27 22:13:14,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 366 transitions, 6042 flow [2024-06-27 22:13:15,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 366 transitions, 5941 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:13:15,508 INFO L231 Difference]: Finished difference. Result has 334 places, 347 transitions, 5233 flow [2024-06-27 22:13:15,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4973, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5233, PETRI_PLACES=334, PETRI_TRANSITIONS=347} [2024-06-27 22:13:15,509 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 294 predicate places. [2024-06-27 22:13:15,509 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 347 transitions, 5233 flow [2024-06-27 22:13:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:15,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:15,509 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:13:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:13:15,509 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:15,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1282329109, now seen corresponding path program 14 times [2024-06-27 22:13:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217284652] [2024-06-27 22:13:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217284652] [2024-06-27 22:13:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217284652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:13:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937255859] [2024-06-27 22:13:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:17,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:13:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:13:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:13:17,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:17,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 347 transitions, 5233 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:17,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:17,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:17,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:18,525 INFO L124 PetriNetUnfolderBase]: 1700/3880 cut-off events. [2024-06-27 22:13:18,525 INFO L125 PetriNetUnfolderBase]: For 206447/206459 co-relation queries the response was YES. [2024-06-27 22:13:18,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24864 conditions, 3880 events. 1700/3880 cut-off events. For 206447/206459 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 32506 event pairs, 699 based on Foata normal form. 17/3585 useless extension candidates. Maximal degree in co-relation 24713. Up to 2901 conditions per place. [2024-06-27 22:13:18,577 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 285 selfloop transitions, 64 changer transitions 0/364 dead transitions. [2024-06-27 22:13:18,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 364 transitions, 6111 flow [2024-06-27 22:13:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:13:18,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:13:18,578 INFO L175 Difference]: Start difference. First operand has 334 places, 347 transitions, 5233 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:13:18,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 364 transitions, 6111 flow [2024-06-27 22:13:19,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 364 transitions, 5895 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-06-27 22:13:20,003 INFO L231 Difference]: Finished difference. Result has 338 places, 348 transitions, 5190 flow [2024-06-27 22:13:20,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5017, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5190, PETRI_PLACES=338, PETRI_TRANSITIONS=348} [2024-06-27 22:13:20,004 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 298 predicate places. [2024-06-27 22:13:20,004 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 348 transitions, 5190 flow [2024-06-27 22:13:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:20,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:20,005 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:13:20,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:13:20,005 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:20,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1289478949, now seen corresponding path program 15 times [2024-06-27 22:13:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261912785] [2024-06-27 22:13:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261912785] [2024-06-27 22:13:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261912785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:13:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690290578] [2024-06-27 22:13:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:13:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:13:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:13:22,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:22,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 348 transitions, 5190 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:22,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:22,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:23,230 INFO L124 PetriNetUnfolderBase]: 1714/3884 cut-off events. [2024-06-27 22:13:23,230 INFO L125 PetriNetUnfolderBase]: For 169810/169822 co-relation queries the response was YES. [2024-06-27 22:13:23,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24942 conditions, 3884 events. 1714/3884 cut-off events. For 169810/169822 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 32446 event pairs, 687 based on Foata normal form. 9/3584 useless extension candidates. Maximal degree in co-relation 24790. Up to 3025 conditions per place. [2024-06-27 22:13:23,281 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 283 selfloop transitions, 64 changer transitions 0/362 dead transitions. [2024-06-27 22:13:23,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 362 transitions, 6028 flow [2024-06-27 22:13:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 22:13:23,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2024-06-27 22:13:23,283 INFO L175 Difference]: Start difference. First operand has 338 places, 348 transitions, 5190 flow. Second operand 9 states and 166 transitions. [2024-06-27 22:13:23,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 362 transitions, 6028 flow [2024-06-27 22:13:24,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 362 transitions, 5873 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 22:13:24,755 INFO L231 Difference]: Finished difference. Result has 340 places, 349 transitions, 5209 flow [2024-06-27 22:13:24,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5035, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5209, PETRI_PLACES=340, PETRI_TRANSITIONS=349} [2024-06-27 22:13:24,755 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 300 predicate places. [2024-06-27 22:13:24,755 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 349 transitions, 5209 flow [2024-06-27 22:13:24,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:24,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:24,756 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:13:24,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:13:24,756 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:24,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 650875799, now seen corresponding path program 16 times [2024-06-27 22:13:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677183586] [2024-06-27 22:13:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677183586] [2024-06-27 22:13:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677183586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058954903] [2024-06-27 22:13:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:26,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:27,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:13:27,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 349 transitions, 5209 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:13:27,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:27,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:13:27,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:28,357 INFO L124 PetriNetUnfolderBase]: 2059/4445 cut-off events. [2024-06-27 22:13:28,358 INFO L125 PetriNetUnfolderBase]: For 221340/221340 co-relation queries the response was YES. [2024-06-27 22:13:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28394 conditions, 4445 events. 2059/4445 cut-off events. For 221340/221340 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 36241 event pairs, 809 based on Foata normal form. 10/4186 useless extension candidates. Maximal degree in co-relation 28241. Up to 3569 conditions per place. [2024-06-27 22:13:28,415 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 338 selfloop transitions, 25 changer transitions 0/372 dead transitions. [2024-06-27 22:13:28,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 372 transitions, 6159 flow [2024-06-27 22:13:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:13:28,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 22:13:28,418 INFO L175 Difference]: Start difference. First operand has 340 places, 349 transitions, 5209 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:13:28,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 372 transitions, 6159 flow [2024-06-27 22:13:29,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 372 transitions, 6001 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:13:29,928 INFO L231 Difference]: Finished difference. Result has 343 places, 351 transitions, 5227 flow [2024-06-27 22:13:29,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5051, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5227, PETRI_PLACES=343, PETRI_TRANSITIONS=351} [2024-06-27 22:13:29,928 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 303 predicate places. [2024-06-27 22:13:29,928 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 351 transitions, 5227 flow [2024-06-27 22:13:29,929 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:13:29,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:29,929 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:13:29,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:13:29,929 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:29,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 394375289, now seen corresponding path program 17 times [2024-06-27 22:13:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857136340] [2024-06-27 22:13:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:31,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857136340] [2024-06-27 22:13:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857136340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:31,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:13:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261002935] [2024-06-27 22:13:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:13:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:13:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:13:31,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:31,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 351 transitions, 5227 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:31,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:31,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:31,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:32,946 INFO L124 PetriNetUnfolderBase]: 1770/4003 cut-off events. [2024-06-27 22:13:32,946 INFO L125 PetriNetUnfolderBase]: For 186002/186017 co-relation queries the response was YES. [2024-06-27 22:13:32,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25947 conditions, 4003 events. 1770/4003 cut-off events. For 186002/186017 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33642 event pairs, 710 based on Foata normal form. 9/3696 useless extension candidates. Maximal degree in co-relation 25793. Up to 2988 conditions per place. [2024-06-27 22:13:32,999 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 238 selfloop transitions, 113 changer transitions 0/365 dead transitions. [2024-06-27 22:13:32,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 365 transitions, 6079 flow [2024-06-27 22:13:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:13:33,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:13:33,000 INFO L175 Difference]: Start difference. First operand has 343 places, 351 transitions, 5227 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:13:33,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 365 transitions, 6079 flow [2024-06-27 22:13:34,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 365 transitions, 5929 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-27 22:13:34,586 INFO L231 Difference]: Finished difference. Result has 345 places, 352 transitions, 5353 flow [2024-06-27 22:13:34,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5077, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5353, PETRI_PLACES=345, PETRI_TRANSITIONS=352} [2024-06-27 22:13:34,587 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 305 predicate places. [2024-06-27 22:13:34,587 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 352 transitions, 5353 flow [2024-06-27 22:13:34,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:34,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:34,587 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:13:34,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:13:34,587 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:34,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 394167899, now seen corresponding path program 18 times [2024-06-27 22:13:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375032516] [2024-06-27 22:13:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375032516] [2024-06-27 22:13:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375032516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:36,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:13:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355706725] [2024-06-27 22:13:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:13:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:13:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:13:36,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:36,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 352 transitions, 5353 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:36,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:36,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:36,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:37,992 INFO L124 PetriNetUnfolderBase]: 1859/4268 cut-off events. [2024-06-27 22:13:37,992 INFO L125 PetriNetUnfolderBase]: For 247340/247354 co-relation queries the response was YES. [2024-06-27 22:13:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28639 conditions, 4268 events. 1859/4268 cut-off events. For 247340/247354 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 36671 event pairs, 769 based on Foata normal form. 9/3937 useless extension candidates. Maximal degree in co-relation 28484. Up to 2901 conditions per place. [2024-06-27 22:13:38,050 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 245 selfloop transitions, 116 changer transitions 0/376 dead transitions. [2024-06-27 22:13:38,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 376 transitions, 6671 flow [2024-06-27 22:13:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 22:13:38,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-27 22:13:38,051 INFO L175 Difference]: Start difference. First operand has 345 places, 352 transitions, 5353 flow. Second operand 9 states and 177 transitions. [2024-06-27 22:13:38,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 376 transitions, 6671 flow [2024-06-27 22:13:39,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 376 transitions, 6413 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-27 22:13:39,740 INFO L231 Difference]: Finished difference. Result has 347 places, 355 transitions, 5509 flow [2024-06-27 22:13:39,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5095, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5509, PETRI_PLACES=347, PETRI_TRANSITIONS=355} [2024-06-27 22:13:39,740 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 307 predicate places. [2024-06-27 22:13:39,740 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 355 transitions, 5509 flow [2024-06-27 22:13:39,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:39,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:39,741 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:13:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:13:39,741 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:39,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1289686339, now seen corresponding path program 19 times [2024-06-27 22:13:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690710961] [2024-06-27 22:13:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690710961] [2024-06-27 22:13:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690710961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:13:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798913757] [2024-06-27 22:13:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:42,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:13:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:42,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:13:42,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:13:42,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:42,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 355 transitions, 5509 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:13:42,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:42,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:42,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:44,173 INFO L124 PetriNetUnfolderBase]: 1864/4295 cut-off events. [2024-06-27 22:13:44,173 INFO L125 PetriNetUnfolderBase]: For 241691/241706 co-relation queries the response was YES. [2024-06-27 22:13:44,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28614 conditions, 4295 events. 1864/4295 cut-off events. For 241691/241706 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 37019 event pairs, 772 based on Foata normal form. 9/3959 useless extension candidates. Maximal degree in co-relation 28457. Up to 3161 conditions per place. [2024-06-27 22:13:44,223 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 295 selfloop transitions, 68 changer transitions 0/377 dead transitions. [2024-06-27 22:13:44,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 377 transitions, 6585 flow [2024-06-27 22:13:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:13:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:13:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 22:13:44,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:13:44,224 INFO L175 Difference]: Start difference. First operand has 347 places, 355 transitions, 5509 flow. Second operand 10 states and 176 transitions. [2024-06-27 22:13:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 377 transitions, 6585 flow [2024-06-27 22:13:45,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 377 transitions, 6370 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 22:13:45,955 INFO L231 Difference]: Finished difference. Result has 353 places, 357 transitions, 5567 flow [2024-06-27 22:13:45,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5294, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5567, PETRI_PLACES=353, PETRI_TRANSITIONS=357} [2024-06-27 22:13:45,956 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 313 predicate places. [2024-06-27 22:13:45,956 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 357 transitions, 5567 flow [2024-06-27 22:13:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 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:13:45,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:45,957 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:13:45,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:13:45,957 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:45,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -936763627, now seen corresponding path program 20 times [2024-06-27 22:13:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727448156] [2024-06-27 22:13:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727448156] [2024-06-27 22:13:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727448156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:13:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934804668] [2024-06-27 22:13:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:48,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:13:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:13:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:13:48,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:48,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 357 transitions, 5567 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:48,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:48,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:49,283 INFO L124 PetriNetUnfolderBase]: 1867/4324 cut-off events. [2024-06-27 22:13:49,283 INFO L125 PetriNetUnfolderBase]: For 229296/229311 co-relation queries the response was YES. [2024-06-27 22:13:49,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27571 conditions, 4324 events. 1867/4324 cut-off events. For 229296/229311 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 37454 event pairs, 783 based on Foata normal form. 17/3992 useless extension candidates. Maximal degree in co-relation 27411. Up to 3089 conditions per place. [2024-06-27 22:13:49,343 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 252 selfloop transitions, 107 changer transitions 0/374 dead transitions. [2024-06-27 22:13:49,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 374 transitions, 6466 flow [2024-06-27 22:13:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:13:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:13:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 22:13:49,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-06-27 22:13:49,345 INFO L175 Difference]: Start difference. First operand has 353 places, 357 transitions, 5567 flow. Second operand 9 states and 173 transitions. [2024-06-27 22:13:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 374 transitions, 6466 flow [2024-06-27 22:13:51,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 374 transitions, 6225 flow, removed 58 selfloop flow, removed 7 redundant places. [2024-06-27 22:13:51,059 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 5584 flow [2024-06-27 22:13:51,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5348, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5584, PETRI_PLACES=355, PETRI_TRANSITIONS=358} [2024-06-27 22:13:51,060 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 315 predicate places. [2024-06-27 22:13:51,060 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 5584 flow [2024-06-27 22:13:51,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:51,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:51,060 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:13:51,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:13:51,060 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:51,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1282052403, now seen corresponding path program 4 times [2024-06-27 22:13:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72678912] [2024-06-27 22:13:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72678912] [2024-06-27 22:13:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72678912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:13:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599405679] [2024-06-27 22:13:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:13:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:13:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:13:54,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:54,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 358 transitions, 5584 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:54,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:54,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:54,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:55,381 INFO L124 PetriNetUnfolderBase]: 1951/4564 cut-off events. [2024-06-27 22:13:55,381 INFO L125 PetriNetUnfolderBase]: For 255593/255608 co-relation queries the response was YES. [2024-06-27 22:13:55,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29443 conditions, 4564 events. 1951/4564 cut-off events. For 255593/255608 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 40252 event pairs, 833 based on Foata normal form. 13/4210 useless extension candidates. Maximal degree in co-relation 29282. Up to 3112 conditions per place. [2024-06-27 22:13:55,447 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 302 selfloop transitions, 67 changer transitions 0/383 dead transitions. [2024-06-27 22:13:55,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 383 transitions, 6809 flow [2024-06-27 22:13:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:13:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:13:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-27 22:13:55,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-27 22:13:55,448 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 5584 flow. Second operand 11 states and 189 transitions. [2024-06-27 22:13:55,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 383 transitions, 6809 flow [2024-06-27 22:13:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 383 transitions, 6594 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 22:13:57,386 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 5523 flow [2024-06-27 22:13:57,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5371, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5523, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2024-06-27 22:13:57,387 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 319 predicate places. [2024-06-27 22:13:57,387 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 5523 flow [2024-06-27 22:13:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:57,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:57,387 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:13:57,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:13:57,387 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:57,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1282321173, now seen corresponding path program 5 times [2024-06-27 22:13:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402220352] [2024-06-27 22:13:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402220352] [2024-06-27 22:13:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402220352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:59,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:59,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:13:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405053192] [2024-06-27 22:13:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:59,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:13:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:13:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:00,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:14:00,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 5523 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:00,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:00,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:14:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:01,749 INFO L124 PetriNetUnfolderBase]: 1995/4716 cut-off events. [2024-06-27 22:14:01,749 INFO L125 PetriNetUnfolderBase]: For 276168/276183 co-relation queries the response was YES. [2024-06-27 22:14:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30048 conditions, 4716 events. 1995/4716 cut-off events. For 276168/276183 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 42101 event pairs, 893 based on Foata normal form. 15/4347 useless extension candidates. Maximal degree in co-relation 29886. Up to 3538 conditions per place. [2024-06-27 22:14:01,817 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 306 selfloop transitions, 56 changer transitions 0/376 dead transitions. [2024-06-27 22:14:01,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 376 transitions, 6393 flow [2024-06-27 22:14:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:14:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:14:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-27 22:14:01,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-27 22:14:01,818 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 5523 flow. Second operand 11 states and 183 transitions. [2024-06-27 22:14:01,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 376 transitions, 6393 flow [2024-06-27 22:14:03,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 376 transitions, 6283 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:14:03,606 INFO L231 Difference]: Finished difference. Result has 363 places, 359 transitions, 5529 flow [2024-06-27 22:14:03,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5413, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5529, PETRI_PLACES=363, PETRI_TRANSITIONS=359} [2024-06-27 22:14:03,606 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 323 predicate places. [2024-06-27 22:14:03,606 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 359 transitions, 5529 flow [2024-06-27 22:14:03,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:03,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:03,606 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:14:03,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:14:03,607 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:03,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1944630581, now seen corresponding path program 6 times [2024-06-27 22:14:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92010036] [2024-06-27 22:14:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92010036] [2024-06-27 22:14:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92010036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:07,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:07,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674253302] [2024-06-27 22:14:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:07,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:07,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:07,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:14:07,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 359 transitions, 5529 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:07,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:07,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:14:07,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:09,483 INFO L124 PetriNetUnfolderBase]: 1985/4698 cut-off events. [2024-06-27 22:14:09,483 INFO L125 PetriNetUnfolderBase]: For 233811/233825 co-relation queries the response was YES. [2024-06-27 22:14:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29135 conditions, 4698 events. 1985/4698 cut-off events. For 233811/233825 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 41911 event pairs, 885 based on Foata normal form. 15/4329 useless extension candidates. Maximal degree in co-relation 28972. Up to 3501 conditions per place. [2024-06-27 22:14:09,549 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 297 selfloop transitions, 64 changer transitions 0/376 dead transitions. [2024-06-27 22:14:09,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 6397 flow [2024-06-27 22:14:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 22:14:09,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:14:09,550 INFO L175 Difference]: Start difference. First operand has 363 places, 359 transitions, 5529 flow. Second operand 10 states and 183 transitions. [2024-06-27 22:14:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 6397 flow [2024-06-27 22:14:11,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 6295 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:11,127 INFO L231 Difference]: Finished difference. Result has 365 places, 359 transitions, 5559 flow [2024-06-27 22:14:11,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5427, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5559, PETRI_PLACES=365, PETRI_TRANSITIONS=359} [2024-06-27 22:14:11,127 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 325 predicate places. [2024-06-27 22:14:11,127 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 359 transitions, 5559 flow [2024-06-27 22:14:11,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:11,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:11,128 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:14:11,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:14:11,128 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:11,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 660089805, now seen corresponding path program 7 times [2024-06-27 22:14:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782031742] [2024-06-27 22:14:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:13,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:14:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782031742] [2024-06-27 22:14:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782031742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:13,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:14:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799038571] [2024-06-27 22:14:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:14:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:14:13,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:13,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:13,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 359 transitions, 5559 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:14:13,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:13,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:13,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:15,724 INFO L124 PetriNetUnfolderBase]: 2432/5497 cut-off events. [2024-06-27 22:14:15,725 INFO L125 PetriNetUnfolderBase]: For 233439/233439 co-relation queries the response was YES. [2024-06-27 22:14:15,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33498 conditions, 5497 events. 2432/5497 cut-off events. For 233439/233439 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48346 event pairs, 1028 based on Foata normal form. 6/5157 useless extension candidates. Maximal degree in co-relation 33334. Up to 4188 conditions per place. [2024-06-27 22:14:15,805 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 363 selfloop transitions, 26 changer transitions 0/398 dead transitions. [2024-06-27 22:14:15,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 398 transitions, 6715 flow [2024-06-27 22:14:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:14:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:14:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2024-06-27 22:14:15,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-27 22:14:15,806 INFO L175 Difference]: Start difference. First operand has 365 places, 359 transitions, 5559 flow. Second operand 14 states and 220 transitions. [2024-06-27 22:14:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 398 transitions, 6715 flow [2024-06-27 22:14:17,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 398 transitions, 6589 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:17,832 INFO L231 Difference]: Finished difference. Result has 371 places, 362 transitions, 5530 flow [2024-06-27 22:14:17,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5433, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5530, PETRI_PLACES=371, PETRI_TRANSITIONS=362} [2024-06-27 22:14:17,832 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 331 predicate places. [2024-06-27 22:14:17,832 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 362 transitions, 5530 flow [2024-06-27 22:14:17,832 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:14:17,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:17,833 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:14:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 22:14:17,833 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:17,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1552581641, now seen corresponding path program 8 times [2024-06-27 22:14:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:17,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494950367] [2024-06-27 22:14:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:20,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:14:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494950367] [2024-06-27 22:14:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494950367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:14:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704852687] [2024-06-27 22:14:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:20,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:14:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:14:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:14:20,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:20,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 362 transitions, 5530 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:14:20,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:20,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:22,222 INFO L124 PetriNetUnfolderBase]: 2533/5743 cut-off events. [2024-06-27 22:14:22,222 INFO L125 PetriNetUnfolderBase]: For 291651/291651 co-relation queries the response was YES. [2024-06-27 22:14:22,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35735 conditions, 5743 events. 2533/5743 cut-off events. For 291651/291651 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51115 event pairs, 1090 based on Foata normal form. 6/5408 useless extension candidates. Maximal degree in co-relation 35570. Up to 3961 conditions per place. [2024-06-27 22:14:22,304 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 367 selfloop transitions, 27 changer transitions 0/403 dead transitions. [2024-06-27 22:14:22,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 403 transitions, 6958 flow [2024-06-27 22:14:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:14:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:14:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2024-06-27 22:14:22,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-06-27 22:14:22,305 INFO L175 Difference]: Start difference. First operand has 371 places, 362 transitions, 5530 flow. Second operand 13 states and 213 transitions. [2024-06-27 22:14:22,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 403 transitions, 6958 flow [2024-06-27 22:14:24,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 403 transitions, 6922 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:14:24,711 INFO L231 Difference]: Finished difference. Result has 375 places, 362 transitions, 5551 flow [2024-06-27 22:14:24,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5494, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5551, PETRI_PLACES=375, PETRI_TRANSITIONS=362} [2024-06-27 22:14:24,712 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 335 predicate places. [2024-06-27 22:14:24,712 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 362 transitions, 5551 flow [2024-06-27 22:14:24,712 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:14:24,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:24,712 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:14:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 22:14:24,712 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:24,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 394383225, now seen corresponding path program 9 times [2024-06-27 22:14:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795728346] [2024-06-27 22:14:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:27,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:14:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795728346] [2024-06-27 22:14:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795728346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:14:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739759936] [2024-06-27 22:14:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:27,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:14:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:14:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:27,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:14:27,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 362 transitions, 5551 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:27,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:27,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:14:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:29,376 INFO L124 PetriNetUnfolderBase]: 2148/5156 cut-off events. [2024-06-27 22:14:29,377 INFO L125 PetriNetUnfolderBase]: For 307377/307392 co-relation queries the response was YES. [2024-06-27 22:14:29,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32675 conditions, 5156 events. 2148/5156 cut-off events. For 307377/307392 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 47552 event pairs, 1028 based on Foata normal form. 15/4757 useless extension candidates. Maximal degree in co-relation 32509. Up to 3696 conditions per place. [2024-06-27 22:14:29,446 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 249 selfloop transitions, 116 changer transitions 0/379 dead transitions. [2024-06-27 22:14:29,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 379 transitions, 6427 flow [2024-06-27 22:14:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:14:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:14:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-27 22:14:29,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-06-27 22:14:29,447 INFO L175 Difference]: Start difference. First operand has 375 places, 362 transitions, 5551 flow. Second operand 11 states and 188 transitions. [2024-06-27 22:14:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 379 transitions, 6427 flow [2024-06-27 22:14:31,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 6374 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:14:31,380 INFO L231 Difference]: Finished difference. Result has 375 places, 362 transitions, 5734 flow [2024-06-27 22:14:31,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5498, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5734, PETRI_PLACES=375, PETRI_TRANSITIONS=362} [2024-06-27 22:14:31,380 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 335 predicate places. [2024-06-27 22:14:31,380 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 362 transitions, 5734 flow [2024-06-27 22:14:31,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:31,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:31,381 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:14:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 22:14:31,381 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:31,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 649963213, now seen corresponding path program 10 times [2024-06-27 22:14:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183949784] [2024-06-27 22:14:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183949784] [2024-06-27 22:14:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183949784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:14:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464798041] [2024-06-27 22:14:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:14:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:14:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:34,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 362 transitions, 5734 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:14:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:36,086 INFO L124 PetriNetUnfolderBase]: 2624/6037 cut-off events. [2024-06-27 22:14:36,086 INFO L125 PetriNetUnfolderBase]: For 309974/309974 co-relation queries the response was YES. [2024-06-27 22:14:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37554 conditions, 6037 events. 2624/6037 cut-off events. For 309974/309974 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 55003 event pairs, 1180 based on Foata normal form. 6/5667 useless extension candidates. Maximal degree in co-relation 37387. Up to 4463 conditions per place. [2024-06-27 22:14:36,162 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 365 selfloop transitions, 21 changer transitions 0/395 dead transitions. [2024-06-27 22:14:36,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 395 transitions, 7048 flow [2024-06-27 22:14:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:14:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:14:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2024-06-27 22:14:36,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:14:36,164 INFO L175 Difference]: Start difference. First operand has 375 places, 362 transitions, 5734 flow. Second operand 12 states and 192 transitions. [2024-06-27 22:14:36,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 395 transitions, 7048 flow [2024-06-27 22:14:38,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 395 transitions, 6818 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:14:38,469 INFO L231 Difference]: Finished difference. Result has 378 places, 362 transitions, 5549 flow [2024-06-27 22:14:38,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5504, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5549, PETRI_PLACES=378, PETRI_TRANSITIONS=362} [2024-06-27 22:14:38,469 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 338 predicate places. [2024-06-27 22:14:38,469 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 362 transitions, 5549 flow [2024-06-27 22:14:38,469 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:14:38,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:38,470 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:14:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 22:14:38,470 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:38,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 401801835, now seen corresponding path program 11 times [2024-06-27 22:14:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362373665] [2024-06-27 22:14:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362373665] [2024-06-27 22:14:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362373665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:14:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975431470] [2024-06-27 22:14:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:40,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:14:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:14:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:14:40,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:14:40,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 362 transitions, 5549 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:40,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:40,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:14:40,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:41,963 INFO L124 PetriNetUnfolderBase]: 2289/5572 cut-off events. [2024-06-27 22:14:41,963 INFO L125 PetriNetUnfolderBase]: For 349753/349768 co-relation queries the response was YES. [2024-06-27 22:14:42,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35384 conditions, 5572 events. 2289/5572 cut-off events. For 349753/349768 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 52808 event pairs, 1116 based on Foata normal form. 13/5138 useless extension candidates. Maximal degree in co-relation 35216. Up to 3690 conditions per place. [2024-06-27 22:14:42,048 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 260 selfloop transitions, 112 changer transitions 0/387 dead transitions. [2024-06-27 22:14:42,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 387 transitions, 6790 flow [2024-06-27 22:14:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 22:14:42,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 22:14:42,049 INFO L175 Difference]: Start difference. First operand has 378 places, 362 transitions, 5549 flow. Second operand 10 states and 192 transitions. [2024-06-27 22:14:42,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 387 transitions, 6790 flow [2024-06-27 22:14:44,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 387 transitions, 6749 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:14:44,470 INFO L231 Difference]: Finished difference. Result has 378 places, 363 transitions, 5748 flow [2024-06-27 22:14:44,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5748, PETRI_PLACES=378, PETRI_TRANSITIONS=363} [2024-06-27 22:14:44,470 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 338 predicate places. [2024-06-27 22:14:44,470 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 363 transitions, 5748 flow [2024-06-27 22:14:44,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:44,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:44,470 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:14:44,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 22:14:44,470 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:44,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 649694443, now seen corresponding path program 12 times [2024-06-27 22:14:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:44,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798708428] [2024-06-27 22:14:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:47,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:14:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798708428] [2024-06-27 22:14:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798708428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:14:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408962540] [2024-06-27 22:14:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:14:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:14:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:47,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:47,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 363 transitions, 5748 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:14:47,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:47,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:47,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:49,200 INFO L124 PetriNetUnfolderBase]: 2641/6092 cut-off events. [2024-06-27 22:14:49,200 INFO L125 PetriNetUnfolderBase]: For 323259/323259 co-relation queries the response was YES. [2024-06-27 22:14:49,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37878 conditions, 6092 events. 2641/6092 cut-off events. For 323259/323259 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 55697 event pairs, 1238 based on Foata normal form. 8/5717 useless extension candidates. Maximal degree in co-relation 37709. Up to 4741 conditions per place. [2024-06-27 22:14:49,286 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 353 selfloop transitions, 26 changer transitions 0/388 dead transitions. [2024-06-27 22:14:49,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 388 transitions, 6700 flow [2024-06-27 22:14:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:14:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:14:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-27 22:14:49,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43287037037037035 [2024-06-27 22:14:49,287 INFO L175 Difference]: Start difference. First operand has 378 places, 363 transitions, 5748 flow. Second operand 12 states and 187 transitions. [2024-06-27 22:14:49,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 388 transitions, 6700 flow [2024-06-27 22:14:51,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 6494 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:14:51,832 INFO L231 Difference]: Finished difference. Result has 384 places, 363 transitions, 5598 flow [2024-06-27 22:14:51,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5542, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5598, PETRI_PLACES=384, PETRI_TRANSITIONS=363} [2024-06-27 22:14:51,832 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 344 predicate places. [2024-06-27 22:14:51,832 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 363 transitions, 5598 flow [2024-06-27 22:14:51,833 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:14:51,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:51,833 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:14:51,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 22:14:51,833 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:51,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash 401533065, now seen corresponding path program 13 times [2024-06-27 22:14:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705844731] [2024-06-27 22:14:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705844731] [2024-06-27 22:14:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705844731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:14:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90155435] [2024-06-27 22:14:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:55,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:14:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:14:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:14:55,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:14:55,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 363 transitions, 5598 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:55,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:55,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:14:55,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:57,093 INFO L124 PetriNetUnfolderBase]: 2225/5405 cut-off events. [2024-06-27 22:14:57,094 INFO L125 PetriNetUnfolderBase]: For 268883/268898 co-relation queries the response was YES. [2024-06-27 22:14:57,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33052 conditions, 5405 events. 2225/5405 cut-off events. For 268883/268898 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 50873 event pairs, 1100 based on Foata normal form. 15/4983 useless extension candidates. Maximal degree in co-relation 32882. Up to 3871 conditions per place. [2024-06-27 22:14:57,179 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 254 selfloop transitions, 112 changer transitions 0/380 dead transitions. [2024-06-27 22:14:57,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 380 transitions, 6476 flow [2024-06-27 22:14:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:14:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:14:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-27 22:14:57,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-27 22:14:57,180 INFO L175 Difference]: Start difference. First operand has 384 places, 363 transitions, 5598 flow. Second operand 11 states and 189 transitions. [2024-06-27 22:14:57,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 380 transitions, 6476 flow [2024-06-27 22:14:59,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 6426 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:14:59,246 INFO L231 Difference]: Finished difference. Result has 385 places, 363 transitions, 5776 flow [2024-06-27 22:14:59,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5776, PETRI_PLACES=385, PETRI_TRANSITIONS=363} [2024-06-27 22:14:59,247 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 345 predicate places. [2024-06-27 22:14:59,247 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 363 transitions, 5776 flow [2024-06-27 22:14:59,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:59,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:59,247 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:14:59,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 22:14:59,248 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:59,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 143147700, now seen corresponding path program 1 times [2024-06-27 22:14:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713317108] [2024-06-27 22:14:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713317108] [2024-06-27 22:15:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713317108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:01,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221298565] [2024-06-27 22:15:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:01,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:01,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:01,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 363 transitions, 5776 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:01,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:01,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:01,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:03,505 INFO L124 PetriNetUnfolderBase]: 2262/5486 cut-off events. [2024-06-27 22:15:03,505 INFO L125 PetriNetUnfolderBase]: For 262834/262849 co-relation queries the response was YES. [2024-06-27 22:15:03,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33788 conditions, 5486 events. 2262/5486 cut-off events. For 262834/262849 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51823 event pairs, 1086 based on Foata normal form. 12/5065 useless extension candidates. Maximal degree in co-relation 33617. Up to 3962 conditions per place. [2024-06-27 22:15:03,576 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 322 selfloop transitions, 56 changer transitions 0/392 dead transitions. [2024-06-27 22:15:03,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 392 transitions, 6854 flow [2024-06-27 22:15:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-06-27 22:15:03,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-06-27 22:15:03,578 INFO L175 Difference]: Start difference. First operand has 385 places, 363 transitions, 5776 flow. Second operand 11 states and 188 transitions. [2024-06-27 22:15:03,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 392 transitions, 6854 flow [2024-06-27 22:15:05,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 392 transitions, 6632 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:05,665 INFO L231 Difference]: Finished difference. Result has 387 places, 363 transitions, 5669 flow [2024-06-27 22:15:05,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5554, PETRI_DIFFERENCE_MINUEND_PLACES=376, 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=11, PETRI_FLOW=5669, PETRI_PLACES=387, PETRI_TRANSITIONS=363} [2024-06-27 22:15:05,666 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 347 predicate places. [2024-06-27 22:15:05,666 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 363 transitions, 5669 flow [2024-06-27 22:15:05,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:05,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:05,666 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:15:05,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 22:15:05,666 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:05,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -466942540, now seen corresponding path program 2 times [2024-06-27 22:15:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528811253] [2024-06-27 22:15:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:08,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528811253] [2024-06-27 22:15:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528811253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561981233] [2024-06-27 22:15:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:08,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:08,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:08,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 363 transitions, 5669 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:08,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:08,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:08,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:09,888 INFO L124 PetriNetUnfolderBase]: 2293/5608 cut-off events. [2024-06-27 22:15:09,888 INFO L125 PetriNetUnfolderBase]: For 267385/267400 co-relation queries the response was YES. [2024-06-27 22:15:09,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34163 conditions, 5608 events. 2293/5608 cut-off events. For 267385/267400 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 53357 event pairs, 1152 based on Foata normal form. 12/5171 useless extension candidates. Maximal degree in co-relation 33991. Up to 4198 conditions per place. [2024-06-27 22:15:09,968 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 321 selfloop transitions, 52 changer transitions 0/387 dead transitions. [2024-06-27 22:15:09,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 387 transitions, 6633 flow [2024-06-27 22:15:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-27 22:15:09,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-27 22:15:09,970 INFO L175 Difference]: Start difference. First operand has 387 places, 363 transitions, 5669 flow. Second operand 11 states and 183 transitions. [2024-06-27 22:15:09,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 387 transitions, 6633 flow [2024-06-27 22:15:12,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 387 transitions, 6522 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:12,056 INFO L231 Difference]: Finished difference. Result has 389 places, 363 transitions, 5665 flow [2024-06-27 22:15:12,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5558, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5665, PETRI_PLACES=389, PETRI_TRANSITIONS=363} [2024-06-27 22:15:12,057 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 349 predicate places. [2024-06-27 22:15:12,057 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 363 transitions, 5665 flow [2024-06-27 22:15:12,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:12,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:12,057 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:15:12,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 22:15:12,057 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:12,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:12,057 INFO L85 PathProgramCache]: Analyzing trace with hash -743003660, now seen corresponding path program 3 times [2024-06-27 22:15:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:12,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908188859] [2024-06-27 22:15:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908188859] [2024-06-27 22:15:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908188859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:14,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599272615] [2024-06-27 22:15:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:14,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:14,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 363 transitions, 5665 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:16,058 INFO L124 PetriNetUnfolderBase]: 2336/5704 cut-off events. [2024-06-27 22:15:16,058 INFO L125 PetriNetUnfolderBase]: For 276371/276385 co-relation queries the response was YES. [2024-06-27 22:15:16,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 5704 events. 2336/5704 cut-off events. For 276371/276385 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 54358 event pairs, 1049 based on Foata normal form. 6/5276 useless extension candidates. Maximal degree in co-relation 34738. Up to 3878 conditions per place. [2024-06-27 22:15:16,142 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 320 selfloop transitions, 65 changer transitions 0/399 dead transitions. [2024-06-27 22:15:16,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 399 transitions, 6863 flow [2024-06-27 22:15:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-27 22:15:16,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-06-27 22:15:16,143 INFO L175 Difference]: Start difference. First operand has 389 places, 363 transitions, 5665 flow. Second operand 11 states and 191 transitions. [2024-06-27 22:15:16,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 399 transitions, 6863 flow [2024-06-27 22:15:18,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 399 transitions, 6760 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:18,405 INFO L231 Difference]: Finished difference. Result has 394 places, 366 transitions, 5921 flow [2024-06-27 22:15:18,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5562, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5921, PETRI_PLACES=394, PETRI_TRANSITIONS=366} [2024-06-27 22:15:18,405 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 354 predicate places. [2024-06-27 22:15:18,405 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 366 transitions, 5921 flow [2024-06-27 22:15:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:18,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:18,405 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:15:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 22:15:18,405 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:18,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 955638184, now seen corresponding path program 4 times [2024-06-27 22:15:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040824673] [2024-06-27 22:15:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040824673] [2024-06-27 22:15:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040824673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397810940] [2024-06-27 22:15:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:20,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:20,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 366 transitions, 5921 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:20,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:20,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:20,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:22,481 INFO L124 PetriNetUnfolderBase]: 2465/6084 cut-off events. [2024-06-27 22:15:22,481 INFO L125 PetriNetUnfolderBase]: For 336010/336025 co-relation queries the response was YES. [2024-06-27 22:15:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37771 conditions, 6084 events. 2465/6084 cut-off events. For 336010/336025 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 59320 event pairs, 1294 based on Foata normal form. 14/5618 useless extension candidates. Maximal degree in co-relation 37594. Up to 4258 conditions per place. [2024-06-27 22:15:22,578 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 327 selfloop transitions, 55 changer transitions 0/396 dead transitions. [2024-06-27 22:15:22,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 396 transitions, 7257 flow [2024-06-27 22:15:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 22:15:22,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2024-06-27 22:15:22,580 INFO L175 Difference]: Start difference. First operand has 394 places, 366 transitions, 5921 flow. Second operand 10 states and 181 transitions. [2024-06-27 22:15:22,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 396 transitions, 7257 flow [2024-06-27 22:15:25,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 7062 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-27 22:15:25,530 INFO L231 Difference]: Finished difference. Result has 398 places, 366 transitions, 5839 flow [2024-06-27 22:15:25,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5726, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5839, PETRI_PLACES=398, PETRI_TRANSITIONS=366} [2024-06-27 22:15:25,530 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 358 predicate places. [2024-06-27 22:15:25,530 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 366 transitions, 5839 flow [2024-06-27 22:15:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:25,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:25,530 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:15:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 22:15:25,531 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:25,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -946227216, now seen corresponding path program 5 times [2024-06-27 22:15:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232510680] [2024-06-27 22:15:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:28,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:15:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232510680] [2024-06-27 22:15:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232510680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:28,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747013248] [2024-06-27 22:15:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:28,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:28,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:28,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 366 transitions, 5839 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:28,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:28,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:28,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:30,726 INFO L124 PetriNetUnfolderBase]: 2458/6077 cut-off events. [2024-06-27 22:15:30,726 INFO L125 PetriNetUnfolderBase]: For 292511/292526 co-relation queries the response was YES. [2024-06-27 22:15:30,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36884 conditions, 6077 events. 2458/6077 cut-off events. For 292511/292526 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 59197 event pairs, 1304 based on Foata normal form. 14/5610 useless extension candidates. Maximal degree in co-relation 36706. Up to 4549 conditions per place. [2024-06-27 22:15:30,800 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 321 selfloop transitions, 53 changer transitions 0/388 dead transitions. [2024-06-27 22:15:30,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 388 transitions, 6799 flow [2024-06-27 22:15:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:15:30,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:15:30,801 INFO L175 Difference]: Start difference. First operand has 398 places, 366 transitions, 5839 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:15:30,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 388 transitions, 6799 flow [2024-06-27 22:15:32,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 388 transitions, 6662 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 22:15:32,860 INFO L231 Difference]: Finished difference. Result has 400 places, 366 transitions, 5811 flow [2024-06-27 22:15:32,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5702, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5811, PETRI_PLACES=400, PETRI_TRANSITIONS=366} [2024-06-27 22:15:32,860 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 360 predicate places. [2024-06-27 22:15:32,861 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 366 transitions, 5811 flow [2024-06-27 22:15:32,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:32,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:32,861 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:15:32,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 22:15:32,861 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:32,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 525421396, now seen corresponding path program 6 times [2024-06-27 22:15:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33663452] [2024-06-27 22:15:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33663452] [2024-06-27 22:15:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33663452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479759970] [2024-06-27 22:15:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:35,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:35,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:35,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 366 transitions, 5811 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:35,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:35,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:35,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:37,074 INFO L124 PetriNetUnfolderBase]: 2449/6024 cut-off events. [2024-06-27 22:15:37,075 INFO L125 PetriNetUnfolderBase]: For 291300/291315 co-relation queries the response was YES. [2024-06-27 22:15:37,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36523 conditions, 6024 events. 2449/6024 cut-off events. For 291300/291315 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 58400 event pairs, 1278 based on Foata normal form. 14/5569 useless extension candidates. Maximal degree in co-relation 36345. Up to 4438 conditions per place. [2024-06-27 22:15:37,180 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 325 selfloop transitions, 56 changer transitions 0/395 dead transitions. [2024-06-27 22:15:37,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 395 transitions, 6823 flow [2024-06-27 22:15:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-27 22:15:37,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:15:37,181 INFO L175 Difference]: Start difference. First operand has 400 places, 366 transitions, 5811 flow. Second operand 11 states and 187 transitions. [2024-06-27 22:15:37,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 395 transitions, 6823 flow [2024-06-27 22:15:39,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 395 transitions, 6718 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:15:39,587 INFO L231 Difference]: Finished difference. Result has 405 places, 368 transitions, 5857 flow [2024-06-27 22:15:39,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5706, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5857, PETRI_PLACES=405, PETRI_TRANSITIONS=368} [2024-06-27 22:15:39,587 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 365 predicate places. [2024-06-27 22:15:39,588 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 368 transitions, 5857 flow [2024-06-27 22:15:39,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:39,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:39,588 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:15:39,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 22:15:39,588 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:39,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1875259966, now seen corresponding path program 7 times [2024-06-27 22:15:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593746614] [2024-06-27 22:15:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593746614] [2024-06-27 22:15:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593746614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019663564] [2024-06-27 22:15:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:42,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:42,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:42,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 368 transitions, 5857 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:42,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:42,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:44,128 INFO L124 PetriNetUnfolderBase]: 2480/6149 cut-off events. [2024-06-27 22:15:44,128 INFO L125 PetriNetUnfolderBase]: For 297182/297196 co-relation queries the response was YES. [2024-06-27 22:15:44,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37116 conditions, 6149 events. 2480/6149 cut-off events. For 297182/297196 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 60082 event pairs, 1358 based on Foata normal form. 13/5679 useless extension candidates. Maximal degree in co-relation 36935. Up to 4533 conditions per place. [2024-06-27 22:15:44,225 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 297 selfloop transitions, 79 changer transitions 0/390 dead transitions. [2024-06-27 22:15:44,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 390 transitions, 6821 flow [2024-06-27 22:15:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:15:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:15:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-27 22:15:44,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:15:44,226 INFO L175 Difference]: Start difference. First operand has 405 places, 368 transitions, 5857 flow. Second operand 11 states and 187 transitions. [2024-06-27 22:15:44,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 390 transitions, 6821 flow [2024-06-27 22:15:46,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 390 transitions, 6722 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:46,752 INFO L231 Difference]: Finished difference. Result has 409 places, 368 transitions, 5919 flow [2024-06-27 22:15:46,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5758, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5919, PETRI_PLACES=409, PETRI_TRANSITIONS=368} [2024-06-27 22:15:46,752 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 369 predicate places. [2024-06-27 22:15:46,752 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 368 transitions, 5919 flow [2024-06-27 22:15:46,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:46,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:46,752 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:15:46,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 22:15:46,753 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:46,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1881689056, now seen corresponding path program 8 times [2024-06-27 22:15:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280932484] [2024-06-27 22:15:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:49,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:15:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:49,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280932484] [2024-06-27 22:15:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280932484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307475944] [2024-06-27 22:15:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:49,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:49,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:49,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 368 transitions, 5919 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:49,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:49,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:49,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:51,123 INFO L124 PetriNetUnfolderBase]: 2517/6246 cut-off events. [2024-06-27 22:15:51,123 INFO L125 PetriNetUnfolderBase]: For 303912/303927 co-relation queries the response was YES. [2024-06-27 22:15:51,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37732 conditions, 6246 events. 2517/6246 cut-off events. For 303912/303927 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 61301 event pairs, 1364 based on Foata normal form. 13/5772 useless extension candidates. Maximal degree in co-relation 37550. Up to 4392 conditions per place. [2024-06-27 22:15:51,212 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 302 selfloop transitions, 81 changer transitions 0/397 dead transitions. [2024-06-27 22:15:51,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 397 transitions, 7021 flow [2024-06-27 22:15:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 22:15:51,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:15:51,213 INFO L175 Difference]: Start difference. First operand has 409 places, 368 transitions, 5919 flow. Second operand 10 states and 183 transitions. [2024-06-27 22:15:51,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 397 transitions, 7021 flow [2024-06-27 22:15:53,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 397 transitions, 6864 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:53,548 INFO L231 Difference]: Finished difference. Result has 410 places, 368 transitions, 5927 flow [2024-06-27 22:15:53,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5762, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5927, PETRI_PLACES=410, PETRI_TRANSITIONS=368} [2024-06-27 22:15:53,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 370 predicate places. [2024-06-27 22:15:53,549 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 368 transitions, 5927 flow [2024-06-27 22:15:53,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:15:53,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:53,549 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:15:53,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 22:15:53,549 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:53,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1653614926, now seen corresponding path program 9 times [2024-06-27 22:15:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614779672] [2024-06-27 22:15:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614779672] [2024-06-27 22:15:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614779672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:57,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:15:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605488979] [2024-06-27 22:15:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:57,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:15:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:15:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:15:58,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:15:58,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 368 transitions, 5927 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:58,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:58,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:15:58,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:00,095 INFO L124 PetriNetUnfolderBase]: 2547/6342 cut-off events. [2024-06-27 22:16:00,095 INFO L125 PetriNetUnfolderBase]: For 309258/309273 co-relation queries the response was YES. [2024-06-27 22:16:00,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38245 conditions, 6342 events. 2547/6342 cut-off events. For 309258/309273 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 62452 event pairs, 1433 based on Foata normal form. 13/5858 useless extension candidates. Maximal degree in co-relation 38062. Up to 4702 conditions per place. [2024-06-27 22:16:00,185 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 296 selfloop transitions, 80 changer transitions 0/390 dead transitions. [2024-06-27 22:16:00,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 390 transitions, 6891 flow [2024-06-27 22:16:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-06-27 22:16:00,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-27 22:16:00,186 INFO L175 Difference]: Start difference. First operand has 410 places, 368 transitions, 5927 flow. Second operand 11 states and 184 transitions. [2024-06-27 22:16:00,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 390 transitions, 6891 flow [2024-06-27 22:16:02,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 390 transitions, 6730 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:02,542 INFO L231 Difference]: Finished difference. Result has 413 places, 368 transitions, 5929 flow [2024-06-27 22:16:02,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5766, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5929, PETRI_PLACES=413, PETRI_TRANSITIONS=368} [2024-06-27 22:16:02,542 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 373 predicate places. [2024-06-27 22:16:02,542 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 368 transitions, 5929 flow [2024-06-27 22:16:02,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:02,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:02,542 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:16:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 22:16:02,542 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -563506828, now seen corresponding path program 10 times [2024-06-27 22:16:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955014019] [2024-06-27 22:16:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:05,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955014019] [2024-06-27 22:16:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955014019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:05,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:16:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841063733] [2024-06-27 22:16:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:05,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:16:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:16:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:16:05,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:16:05,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 368 transitions, 5929 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:05,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:05,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:16:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:07,576 INFO L124 PetriNetUnfolderBase]: 2577/6434 cut-off events. [2024-06-27 22:16:07,576 INFO L125 PetriNetUnfolderBase]: For 314205/314220 co-relation queries the response was YES. [2024-06-27 22:16:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38623 conditions, 6434 events. 2577/6434 cut-off events. For 314205/314220 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 63729 event pairs, 1478 based on Foata normal form. 13/5944 useless extension candidates. Maximal degree in co-relation 38439. Up to 4830 conditions per place. [2024-06-27 22:16:07,663 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 323 selfloop transitions, 51 changer transitions 0/388 dead transitions. [2024-06-27 22:16:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 388 transitions, 6883 flow [2024-06-27 22:16:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-27 22:16:07,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45707070707070707 [2024-06-27 22:16:07,664 INFO L175 Difference]: Start difference. First operand has 413 places, 368 transitions, 5929 flow. Second operand 11 states and 181 transitions. [2024-06-27 22:16:07,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 388 transitions, 6883 flow [2024-06-27 22:16:10,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 388 transitions, 6722 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:10,305 INFO L231 Difference]: Finished difference. Result has 415 places, 368 transitions, 5873 flow [2024-06-27 22:16:10,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5768, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5873, PETRI_PLACES=415, PETRI_TRANSITIONS=368} [2024-06-27 22:16:10,305 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 375 predicate places. [2024-06-27 22:16:10,305 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 368 transitions, 5873 flow [2024-06-27 22:16:10,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:10,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:10,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:10,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 22:16:10,306 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:10,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1580002674, now seen corresponding path program 11 times [2024-06-27 22:16:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686374047] [2024-06-27 22:16:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686374047] [2024-06-27 22:16:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686374047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:13,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:13,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:16:13,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166509031] [2024-06-27 22:16:13,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:13,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:16:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:13,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:16:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:16:13,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:16:13,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 368 transitions, 5873 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:13,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:13,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:16:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:15,260 INFO L124 PetriNetUnfolderBase]: 2607/6518 cut-off events. [2024-06-27 22:16:15,260 INFO L125 PetriNetUnfolderBase]: For 320238/320253 co-relation queries the response was YES. [2024-06-27 22:16:15,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38988 conditions, 6518 events. 2607/6518 cut-off events. For 320238/320253 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 64698 event pairs, 1489 based on Foata normal form. 13/6022 useless extension candidates. Maximal degree in co-relation 38803. Up to 4853 conditions per place. [2024-06-27 22:16:15,356 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 325 selfloop transitions, 53 changer transitions 0/392 dead transitions. [2024-06-27 22:16:15,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 392 transitions, 6921 flow [2024-06-27 22:16:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-27 22:16:15,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-27 22:16:15,357 INFO L175 Difference]: Start difference. First operand has 415 places, 368 transitions, 5873 flow. Second operand 11 states and 186 transitions. [2024-06-27 22:16:15,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 392 transitions, 6921 flow [2024-06-27 22:16:18,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 392 transitions, 6820 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:18,089 INFO L231 Difference]: Finished difference. Result has 417 places, 368 transitions, 5881 flow [2024-06-27 22:16:18,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5772, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5881, PETRI_PLACES=417, PETRI_TRANSITIONS=368} [2024-06-27 22:16:18,089 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 377 predicate places. [2024-06-27 22:16:18,089 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 368 transitions, 5881 flow [2024-06-27 22:16:18,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:18,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:18,089 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:16:18,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 22:16:18,090 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:18,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1334553702, now seen corresponding path program 12 times [2024-06-27 22:16:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214170089] [2024-06-27 22:16:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:21,709 INFO 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:16:21,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:21,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214170089] [2024-06-27 22:16:21,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214170089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:21,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:21,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:16:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104296061] [2024-06-27 22:16:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:21,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:16:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:16:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:16:22,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:22,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 368 transitions, 5881 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:16:22,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:22,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:22,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:24,403 INFO L124 PetriNetUnfolderBase]: 3095/7330 cut-off events. [2024-06-27 22:16:24,404 INFO L125 PetriNetUnfolderBase]: For 331353/331353 co-relation queries the response was YES. [2024-06-27 22:16:24,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43380 conditions, 7330 events. 3095/7330 cut-off events. For 331353/331353 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 70659 event pairs, 1678 based on Foata normal form. 6/6884 useless extension candidates. Maximal degree in co-relation 43194. Up to 5635 conditions per place. [2024-06-27 22:16:24,517 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 360 selfloop transitions, 28 changer transitions 0/397 dead transitions. [2024-06-27 22:16:24,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 397 transitions, 6871 flow [2024-06-27 22:16:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:16:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:16:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2024-06-27 22:16:24,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:16:24,519 INFO L175 Difference]: Start difference. First operand has 417 places, 368 transitions, 5881 flow. Second operand 12 states and 192 transitions. [2024-06-27 22:16:24,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 397 transitions, 6871 flow [2024-06-27 22:16:27,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 397 transitions, 6766 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:27,671 INFO L231 Difference]: Finished difference. Result has 420 places, 368 transitions, 5835 flow [2024-06-27 22:16:27,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5776, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5835, PETRI_PLACES=420, PETRI_TRANSITIONS=368} [2024-06-27 22:16:27,672 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 380 predicate places. [2024-06-27 22:16:27,672 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 368 transitions, 5835 flow [2024-06-27 22:16:27,672 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:16:27,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:27,673 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:16:27,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 22:16:27,673 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:27,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 67394218, now seen corresponding path program 13 times [2024-06-27 22:16:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629009929] [2024-06-27 22:16:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:30,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:16:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629009929] [2024-06-27 22:16:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629009929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951854886] [2024-06-27 22:16:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:30,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:16:30,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 368 transitions, 5835 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:16:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:32,409 INFO L124 PetriNetUnfolderBase]: 2667/6703 cut-off events. [2024-06-27 22:16:32,409 INFO L125 PetriNetUnfolderBase]: For 331275/331290 co-relation queries the response was YES. [2024-06-27 22:16:32,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39865 conditions, 6703 events. 2667/6703 cut-off events. For 331275/331290 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 67127 event pairs, 1582 based on Foata normal form. 13/6193 useless extension candidates. Maximal degree in co-relation 39678. Up to 4900 conditions per place. [2024-06-27 22:16:32,519 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 311 selfloop transitions, 65 changer transitions 0/391 dead transitions. [2024-06-27 22:16:32,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 391 transitions, 6831 flow [2024-06-27 22:16:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 22:16:32,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2024-06-27 22:16:32,520 INFO L175 Difference]: Start difference. First operand has 420 places, 368 transitions, 5835 flow. Second operand 10 states and 187 transitions. [2024-06-27 22:16:32,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 391 transitions, 6831 flow [2024-06-27 22:16:35,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 391 transitions, 6776 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:16:35,640 INFO L231 Difference]: Finished difference. Result has 420 places, 368 transitions, 5913 flow [2024-06-27 22:16:35,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5780, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5913, PETRI_PLACES=420, PETRI_TRANSITIONS=368} [2024-06-27 22:16:35,640 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 380 predicate places. [2024-06-27 22:16:35,640 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 368 transitions, 5913 flow [2024-06-27 22:16:35,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:35,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:35,641 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:16:35,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 22:16:35,641 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:35,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1750705104, now seen corresponding path program 14 times [2024-06-27 22:16:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243210771] [2024-06-27 22:16:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243210771] [2024-06-27 22:16:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243210771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:16:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149974763] [2024-06-27 22:16:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:16:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:16:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:16:38,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:16:38,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 368 transitions, 5913 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:38,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:38,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:16:38,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:40,243 INFO L124 PetriNetUnfolderBase]: 2705/6800 cut-off events. [2024-06-27 22:16:40,243 INFO L125 PetriNetUnfolderBase]: For 336871/336885 co-relation queries the response was YES. [2024-06-27 22:16:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40452 conditions, 6800 events. 2705/6800 cut-off events. For 336871/336885 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 68306 event pairs, 1601 based on Foata normal form. 13/6283 useless extension candidates. Maximal degree in co-relation 40264. Up to 5074 conditions per place. [2024-06-27 22:16:40,352 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 330 selfloop transitions, 51 changer transitions 0/395 dead transitions. [2024-06-27 22:16:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 395 transitions, 6917 flow [2024-06-27 22:16:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-27 22:16:40,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-27 22:16:40,353 INFO L175 Difference]: Start difference. First operand has 420 places, 368 transitions, 5913 flow. Second operand 11 states and 186 transitions. [2024-06-27 22:16:40,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 395 transitions, 6917 flow [2024-06-27 22:16:43,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 395 transitions, 6788 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:43,614 INFO L231 Difference]: Finished difference. Result has 425 places, 370 transitions, 5917 flow [2024-06-27 22:16:43,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5784, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5917, PETRI_PLACES=425, PETRI_TRANSITIONS=370} [2024-06-27 22:16:43,615 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 385 predicate places. [2024-06-27 22:16:43,615 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 370 transitions, 5917 flow [2024-06-27 22:16:43,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:43,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:43,615 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:16:43,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 22:16:43,615 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:43,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 137324720, now seen corresponding path program 15 times [2024-06-27 22:16:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:43,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387660157] [2024-06-27 22:16:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:46,046 INFO 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:16:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387660157] [2024-06-27 22:16:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387660157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503906149] [2024-06-27 22:16:46,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:46,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:46,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:16:46,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 370 transitions, 5917 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:16:46,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:46,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:16:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:48,456 INFO L124 PetriNetUnfolderBase]: 2735/6876 cut-off events. [2024-06-27 22:16:48,456 INFO L125 PetriNetUnfolderBase]: For 342175/342187 co-relation queries the response was YES. [2024-06-27 22:16:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40900 conditions, 6876 events. 2735/6876 cut-off events. For 342175/342187 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 69218 event pairs, 1650 based on Foata normal form. 13/6359 useless extension candidates. Maximal degree in co-relation 40709. Up to 5146 conditions per place. [2024-06-27 22:16:48,555 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 311 selfloop transitions, 65 changer transitions 0/390 dead transitions. [2024-06-27 22:16:48,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 390 transitions, 6875 flow [2024-06-27 22:16:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 22:16:48,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:16:48,556 INFO L175 Difference]: Start difference. First operand has 425 places, 370 transitions, 5917 flow. Second operand 10 states and 176 transitions. [2024-06-27 22:16:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 390 transitions, 6875 flow [2024-06-27 22:16:51,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 390 transitions, 6780 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:51,574 INFO L231 Difference]: Finished difference. Result has 428 places, 370 transitions, 5955 flow [2024-06-27 22:16:51,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5822, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5955, PETRI_PLACES=428, PETRI_TRANSITIONS=370} [2024-06-27 22:16:51,574 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 388 predicate places. [2024-06-27 22:16:51,574 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 370 transitions, 5955 flow [2024-06-27 22:16:51,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:16:51,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:51,574 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:16:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 22:16:51,574 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:51,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 137151740, now seen corresponding path program 16 times [2024-06-27 22:16:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789323701] [2024-06-27 22:16:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789323701] [2024-06-27 22:16:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789323701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:16:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270987028] [2024-06-27 22:16:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:54,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:16:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:54,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:16:54,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:16:54,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:16:54,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 370 transitions, 5955 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:54,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:54,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:16:54,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:57,230 INFO L124 PetriNetUnfolderBase]: 2765/6966 cut-off events. [2024-06-27 22:16:57,230 INFO L125 PetriNetUnfolderBase]: For 348165/348179 co-relation queries the response was YES. [2024-06-27 22:16:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41406 conditions, 6966 events. 2765/6966 cut-off events. For 348165/348179 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 70369 event pairs, 1660 based on Foata normal form. 13/6444 useless extension candidates. Maximal degree in co-relation 41214. Up to 5054 conditions per place. [2024-06-27 22:16:57,339 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 314 selfloop transitions, 69 changer transitions 0/397 dead transitions. [2024-06-27 22:16:57,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 397 transitions, 7051 flow [2024-06-27 22:16:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-27 22:16:57,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2024-06-27 22:16:57,340 INFO L175 Difference]: Start difference. First operand has 428 places, 370 transitions, 5955 flow. Second operand 11 states and 194 transitions. [2024-06-27 22:16:57,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 397 transitions, 7051 flow [2024-06-27 22:17:00,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 397 transitions, 6922 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:00,449 INFO L231 Difference]: Finished difference. Result has 431 places, 370 transitions, 5967 flow [2024-06-27 22:17:00,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5826, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5967, PETRI_PLACES=431, PETRI_TRANSITIONS=370} [2024-06-27 22:17:00,449 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 391 predicate places. [2024-06-27 22:17:00,449 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 370 transitions, 5967 flow [2024-06-27 22:17:00,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:00,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:00,450 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:17:00,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 22:17:00,450 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:00,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash 803454656, now seen corresponding path program 17 times [2024-06-27 22:17:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93866375] [2024-06-27 22:17:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:03,599 INFO 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:17:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93866375] [2024-06-27 22:17:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93866375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:03,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:17:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349802174] [2024-06-27 22:17:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:03,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:17:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:17:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:17:03,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:17:03,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 370 transitions, 5967 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:03,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:03,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:17:03,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:05,900 INFO L124 PetriNetUnfolderBase]: 2795/7080 cut-off events. [2024-06-27 22:17:05,901 INFO L125 PetriNetUnfolderBase]: For 353909/353924 co-relation queries the response was YES. [2024-06-27 22:17:05,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41922 conditions, 7080 events. 2795/7080 cut-off events. For 353909/353924 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 71777 event pairs, 1734 based on Foata normal form. 13/6544 useless extension candidates. Maximal degree in co-relation 41729. Up to 5201 conditions per place. [2024-06-27 22:17:06,007 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 285 selfloop transitions, 91 changer transitions 0/390 dead transitions. [2024-06-27 22:17:06,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 390 transitions, 6925 flow [2024-06-27 22:17:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-27 22:17:06,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-27 22:17:06,008 INFO L175 Difference]: Start difference. First operand has 431 places, 370 transitions, 5967 flow. Second operand 11 states and 186 transitions. [2024-06-27 22:17:06,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 390 transitions, 6925 flow [2024-06-27 22:17:09,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 390 transitions, 6788 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:17:09,060 INFO L231 Difference]: Finished difference. Result has 433 places, 370 transitions, 6015 flow [2024-06-27 22:17:09,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5830, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6015, PETRI_PLACES=433, PETRI_TRANSITIONS=370} [2024-06-27 22:17:09,061 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 393 predicate places. [2024-06-27 22:17:09,061 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 370 transitions, 6015 flow [2024-06-27 22:17:09,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:09,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:09,061 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:17:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 22:17:09,061 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:09,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 797025566, now seen corresponding path program 18 times [2024-06-27 22:17:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587982284] [2024-06-27 22:17:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:12,087 INFO 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:17:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587982284] [2024-06-27 22:17:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587982284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701423136] [2024-06-27 22:17:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:12,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:17:12,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 370 transitions, 6015 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:17:12,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:12,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:17:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:14,444 INFO L124 PetriNetUnfolderBase]: 2825/7146 cut-off events. [2024-06-27 22:17:14,444 INFO L125 PetriNetUnfolderBase]: For 360192/360207 co-relation queries the response was YES. [2024-06-27 22:17:14,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42390 conditions, 7146 events. 2825/7146 cut-off events. For 360192/360207 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 72665 event pairs, 1731 based on Foata normal form. 13/6612 useless extension candidates. Maximal degree in co-relation 42196. Up to 4919 conditions per place. [2024-06-27 22:17:14,545 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 260 selfloop transitions, 123 changer transitions 0/397 dead transitions. [2024-06-27 22:17:14,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 397 transitions, 7111 flow [2024-06-27 22:17:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-27 22:17:14,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49747474747474746 [2024-06-27 22:17:14,546 INFO L175 Difference]: Start difference. First operand has 433 places, 370 transitions, 6015 flow. Second operand 11 states and 197 transitions. [2024-06-27 22:17:14,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 397 transitions, 7111 flow [2024-06-27 22:17:17,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 397 transitions, 6939 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:17,592 INFO L231 Difference]: Finished difference. Result has 436 places, 370 transitions, 6092 flow [2024-06-27 22:17:17,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5843, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6092, PETRI_PLACES=436, PETRI_TRANSITIONS=370} [2024-06-27 22:17:17,592 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 396 predicate places. [2024-06-27 22:17:17,592 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 370 transitions, 6092 flow [2024-06-27 22:17:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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:17:17,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:17,593 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:17:17,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 22:17:17,593 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:17,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1025099696, now seen corresponding path program 19 times [2024-06-27 22:17:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:17,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965453057] [2024-06-27 22:17:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:19,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965453057] [2024-06-27 22:17:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965453057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:19,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274169836] [2024-06-27 22:17:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:17:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:17:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:17:19,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:17:19,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 370 transitions, 6092 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:19,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:19,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:17:19,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:21,977 INFO L124 PetriNetUnfolderBase]: 2826/7177 cut-off events. [2024-06-27 22:17:21,977 INFO L125 PetriNetUnfolderBase]: For 310873/310888 co-relation queries the response was YES. [2024-06-27 22:17:22,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41823 conditions, 7177 events. 2826/7177 cut-off events. For 310873/310888 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 73162 event pairs, 1769 based on Foata normal form. 13/6634 useless extension candidates. Maximal degree in co-relation 41628. Up to 5107 conditions per place. [2024-06-27 22:17:22,103 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 265 selfloop transitions, 112 changer transitions 0/392 dead transitions. [2024-06-27 22:17:22,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 392 transitions, 6824 flow [2024-06-27 22:17:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 22:17:22,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2024-06-27 22:17:22,104 INFO L175 Difference]: Start difference. First operand has 436 places, 370 transitions, 6092 flow. Second operand 10 states and 191 transitions. [2024-06-27 22:17:22,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 392 transitions, 6824 flow [2024-06-27 22:17:23,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 392 transitions, 6190 flow, removed 52 selfloop flow, removed 90 redundant places. [2024-06-27 22:17:23,899 INFO L231 Difference]: Finished difference. Result has 354 places, 369 transitions, 5440 flow [2024-06-27 22:17:23,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5216, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5440, PETRI_PLACES=354, PETRI_TRANSITIONS=369} [2024-06-27 22:17:23,899 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 314 predicate places. [2024-06-27 22:17:23,899 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 369 transitions, 5440 flow [2024-06-27 22:17:23,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:23,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:23,900 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:17:23,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 22:17:23,900 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:23,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -585850590, now seen corresponding path program 1 times [2024-06-27 22:17:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552930366] [2024-06-27 22:17:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:23,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552930366] [2024-06-27 22:17:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552930366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:23,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:23,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:17:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181905529] [2024-06-27 22:17:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:23,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:17:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:17:23,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:17:23,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:17:23,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 369 transitions, 5440 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:23,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:23,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:17:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:24,959 INFO L124 PetriNetUnfolderBase]: 2121/5549 cut-off events. [2024-06-27 22:17:24,959 INFO L125 PetriNetUnfolderBase]: For 115666/115671 co-relation queries the response was YES. [2024-06-27 22:17:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26778 conditions, 5549 events. 2121/5549 cut-off events. For 115666/115671 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 53568 event pairs, 522 based on Foata normal form. 420/5770 useless extension candidates. Maximal degree in co-relation 26664. Up to 1668 conditions per place. [2024-06-27 22:17:25,020 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 140 selfloop transitions, 81 changer transitions 0/296 dead transitions. [2024-06-27 22:17:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 296 transitions, 4742 flow [2024-06-27 22:17:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:17:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:17:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-27 22:17:25,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-06-27 22:17:25,021 INFO L175 Difference]: Start difference. First operand has 354 places, 369 transitions, 5440 flow. Second operand 5 states and 112 transitions. [2024-06-27 22:17:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 296 transitions, 4742 flow [2024-06-27 22:17:25,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 296 transitions, 3538 flow, removed 140 selfloop flow, removed 66 redundant places. [2024-06-27 22:17:25,618 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 3328 flow [2024-06-27 22:17:25,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3328, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2024-06-27 22:17:25,619 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 254 predicate places. [2024-06-27 22:17:25,619 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 3328 flow [2024-06-27 22:17:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:25,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:25,619 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:17:25,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 22:17:25,620 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:25,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1951964066, now seen corresponding path program 1 times [2024-06-27 22:17:25,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:25,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846286258] [2024-06-27 22:17:25,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:25,751 INFO 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:17:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846286258] [2024-06-27 22:17:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846286258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:17:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126981882] [2024-06-27 22:17:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:17:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:17:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:17:25,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 22:17:25,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 3328 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:25,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:25,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 22:17:25,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:26,466 INFO L124 PetriNetUnfolderBase]: 1629/4480 cut-off events. [2024-06-27 22:17:26,466 INFO L125 PetriNetUnfolderBase]: For 10023/10038 co-relation queries the response was YES. [2024-06-27 22:17:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15880 conditions, 4480 events. 1629/4480 cut-off events. For 10023/10038 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 43498 event pairs, 688 based on Foata normal form. 85/4295 useless extension candidates. Maximal degree in co-relation 15801. Up to 1690 conditions per place. [2024-06-27 22:17:26,503 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 45 selfloop transitions, 27 changer transitions 193/306 dead transitions. [2024-06-27 22:17:26,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 306 transitions, 3804 flow [2024-06-27 22:17:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:17:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:17:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-27 22:17:26,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 22:17:26,504 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 3328 flow. Second operand 7 states and 147 transitions. [2024-06-27 22:17:26,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 306 transitions, 3804 flow [2024-06-27 22:17:26,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 306 transitions, 3553 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:17:26,581 INFO L231 Difference]: Finished difference. Result has 298 places, 106 transitions, 934 flow [2024-06-27 22:17:26,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3077, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=934, PETRI_PLACES=298, PETRI_TRANSITIONS=106} [2024-06-27 22:17:26,581 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 258 predicate places. [2024-06-27 22:17:26,581 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 106 transitions, 934 flow [2024-06-27 22:17:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:26,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:26,581 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:17:26,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 22:17:26,582 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:26,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 490675502, now seen corresponding path program 2 times [2024-06-27 22:17:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988621540] [2024-06-27 22:17:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:26,719 INFO 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:17:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988621540] [2024-06-27 22:17:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988621540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:17:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796977705] [2024-06-27 22:17:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:26,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:17:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:17:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:17:26,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 22:17:26,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 106 transitions, 934 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:17:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 22:17:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:27,037 INFO L124 PetriNetUnfolderBase]: 603/1717 cut-off events. [2024-06-27 22:17:27,038 INFO L125 PetriNetUnfolderBase]: For 2122/2125 co-relation queries the response was YES. [2024-06-27 22:17:27,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 1717 events. 603/1717 cut-off events. For 2122/2125 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13938 event pairs, 310 based on Foata normal form. 51/1640 useless extension candidates. Maximal degree in co-relation 5263. Up to 574 conditions per place. [2024-06-27 22:17:27,050 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 28 selfloop transitions, 5 changer transitions 68/123 dead transitions. [2024-06-27 22:17:27,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 123 transitions, 1148 flow [2024-06-27 22:17:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:17:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:17:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 22:17:27,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2024-06-27 22:17:27,051 INFO L175 Difference]: Start difference. First operand has 298 places, 106 transitions, 934 flow. Second operand 8 states and 157 transitions. [2024-06-27 22:17:27,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 123 transitions, 1148 flow [2024-06-27 22:17:27,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 123 transitions, 838 flow, removed 19 selfloop flow, removed 37 redundant places. [2024-06-27 22:17:27,062 INFO L231 Difference]: Finished difference. Result has 167 places, 52 transitions, 284 flow [2024-06-27 22:17:27,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=284, PETRI_PLACES=167, PETRI_TRANSITIONS=52} [2024-06-27 22:17:27,062 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2024-06-27 22:17:27,063 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 52 transitions, 284 flow [2024-06-27 22:17:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:17:27,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:27,063 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:17:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 22:17:27,063 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:27,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1333436438, now seen corresponding path program 3 times [2024-06-27 22:17:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897713010] [2024-06-27 22:17:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:27,776 INFO 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:17:27,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897713010] [2024-06-27 22:17:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897713010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516978043] [2024-06-27 22:17:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:27,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:17:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:17:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:17:27,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-06-27 22:17:27,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 52 transitions, 284 flow. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:27,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:27,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-06-27 22:17:27,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:28,029 INFO L124 PetriNetUnfolderBase]: 190/564 cut-off events. [2024-06-27 22:17:28,029 INFO L125 PetriNetUnfolderBase]: For 406/409 co-relation queries the response was YES. [2024-06-27 22:17:28,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 564 events. 190/564 cut-off events. For 406/409 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3455 event pairs, 24 based on Foata normal form. 18/542 useless extension candidates. Maximal degree in co-relation 1494. Up to 135 conditions per place. [2024-06-27 22:17:28,032 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 18 selfloop transitions, 6 changer transitions 31/71 dead transitions. [2024-06-27 22:17:28,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 71 transitions, 426 flow [2024-06-27 22:17:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-27 22:17:28,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 22:17:28,033 INFO L175 Difference]: Start difference. First operand has 167 places, 52 transitions, 284 flow. Second operand 10 states and 198 transitions. [2024-06-27 22:17:28,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 71 transitions, 426 flow [2024-06-27 22:17:28,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 71 transitions, 388 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-27 22:17:28,035 INFO L231 Difference]: Finished difference. Result has 121 places, 34 transitions, 154 flow [2024-06-27 22:17:28,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=154, PETRI_PLACES=121, PETRI_TRANSITIONS=34} [2024-06-27 22:17:28,036 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-06-27 22:17:28,036 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 34 transitions, 154 flow [2024-06-27 22:17:28,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:28,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:28,036 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:17:28,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 22:17:28,036 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:28,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:28,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2144369182, now seen corresponding path program 4 times [2024-06-27 22:17:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202014853] [2024-06-27 22:17:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:17:28,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:17:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:17:28,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:17:28,109 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:17:28,110 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:17:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:17:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:17:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:17:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:17:28,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:17:28,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:17:28,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 22:17:28,113 INFO L445 BasicCegarLoop]: Path program histogram: [20, 20, 19, 13, 10, 7, 7, 7, 6, 6, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:28,118 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:17:28,119 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:17:28,186 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:17:28,186 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:17:28,187 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:17:28 BasicIcfg [2024-06-27 22:17:28,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:17:28,187 INFO L158 Benchmark]: Toolchain (without parser) took 526909.87ms. Allocated memory was 180.4MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 117.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-06-27 22:17:28,188 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:17:28,188 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:17:28,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.51ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 86.9MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-06-27 22:17:28,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.18ms. Allocated memory is still 180.4MB. Free memory was 86.9MB in the beginning and 83.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:17:28,189 INFO L158 Benchmark]: Boogie Preprocessor took 90.33ms. Allocated memory is still 180.4MB. Free memory was 83.1MB in the beginning and 79.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:17:28,189 INFO L158 Benchmark]: RCFGBuilder took 894.73ms. Allocated memory was 180.4MB in the beginning and 281.0MB in the end (delta: 100.7MB). Free memory was 79.3MB in the beginning and 216.1MB in the end (delta: -136.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-06-27 22:17:28,190 INFO L158 Benchmark]: TraceAbstraction took 525195.99ms. Allocated memory was 281.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 215.1MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-06-27 22:17:28,191 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.20ms. Allocated memory is still 180.4MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.51ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 86.9MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.18ms. Allocated memory is still 180.4MB. Free memory was 86.9MB in the beginning and 83.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.33ms. Allocated memory is still 180.4MB. Free memory was 83.1MB in the beginning and 79.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 894.73ms. Allocated memory was 180.4MB in the beginning and 281.0MB in the end (delta: 100.7MB). Free memory was 79.3MB in the beginning and 216.1MB in the end (delta: -136.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 525195.99ms. Allocated memory was 281.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 215.1MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t311=-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] [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t311=-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] [L823] 0 pthread_t t312; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t311=-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] [L824] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$read_delayed) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 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_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t311=-1, t312=0, 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] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$r_buff0_thd2=1, 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] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 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) [L785] 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)) [L786] 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)) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L796] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L741] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L825] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) x$read_delayed) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) y) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 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_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t311=-1, t312=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311=-1, t312=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 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) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311=-1, t312=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311=-1, t312=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] - UnprovableResult [Line: 19]: 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: 824]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 822]: 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: 525.0s, OverallIterations: 140, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 262.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7825 SdHoareTripleChecker+Valid, 50.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6576 mSDsluCounter, 2110 SdHoareTripleChecker+Invalid, 44.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1675 mSDsCounter, 1606 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64123 IncrementalHoareTripleChecker+Invalid, 65729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1606 mSolverCounterUnsat, 435 mSDtfsCounter, 64123 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 55.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6092occurred in iteration=134, InterpolantAutomatonStates: 1283, 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.7s SatisfiabilityAnalysisTime, 258.9s InterpolantComputationTime, 2225 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 116059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 139 InterpolantComputations, 139 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:17:28,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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