./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/mix026.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/mix026.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/mix026.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 19:28:17,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 19:28:17,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 19:28:17,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 19:28:17,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 19:28:17,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 19:28:17,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 19:28:17,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 19:28:17,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 19:28:17,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 19:28:17,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 19:28:17,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 19:28:17,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 19:28:17,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 19:28:17,481 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 19:28:17,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 19:28:17,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 19:28:17,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 19:28:17,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 19:28:17,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 19:28:17,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 19:28:17,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 19:28:17,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 19:28:17,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 19:28:17,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 19:28:17,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 19:28:17,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 19:28:17,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 19:28:17,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 19:28:17,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 19:28:17,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 19:28:17,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 19:28:17,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:28:17,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 19:28:17,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 19:28:17,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 19:28:17,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 19:28:17,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 19:28:17,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 19:28:17,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 19:28:17,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 19:28:17,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 19:28:17,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 19:28:17,489 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 19:28:17,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 19:28:17,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 19:28:17,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 19:28:17,699 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 19:28:17,700 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 19:28:17,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/mix026.oepc.yml/witness.yml [2024-06-03 19:28:17,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 19:28:17,842 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 19:28:17,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2024-06-03 19:28:18,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 19:28:19,102 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 19:28:19,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2024-06-03 19:28:19,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810ccf00e/131ebfe1903a4397a503ef7805e09d69/FLAGa91984f12 [2024-06-03 19:28:19,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810ccf00e/131ebfe1903a4397a503ef7805e09d69 [2024-06-03 19:28:19,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 19:28:19,125 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 19:28:19,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 19:28:19,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 19:28:19,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 19:28:19,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:28:17" (1/2) ... [2024-06-03 19:28:19,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf6fd8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:28:19, skipping insertion in model container [2024-06-03 19:28:19,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:28:17" (1/2) ... [2024-06-03 19:28:19,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c3f87ff and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:28:19, skipping insertion in model container [2024-06-03 19:28:19,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:28:19" (2/2) ... [2024-06-03 19:28:19,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf6fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19, skipping insertion in model container [2024-06-03 19:28:19,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:28:19" (2/2) ... [2024-06-03 19:28:19,135 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 19:28:19,228 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 19:28:19,229 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ((((((((((((((((((((((! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0) [2024-06-03 19:28:19,229 INFO L97 edCorrectnessWitness]: Location invariant before [L871-L871] ((((((((((((((((((((((! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0) [2024-06-03 19:28:19,229 INFO L97 edCorrectnessWitness]: Location invariant before [L873-L873] ((((((((((((((((((((((! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0) [2024-06-03 19:28:19,229 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ((((((((((((((((((((((! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || a$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0) [2024-06-03 19:28:19,230 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 19:28:19,231 INFO L106 edCorrectnessWitness]: ghost_update [L867-L867] multithreaded = 1; [2024-06-03 19:28:19,268 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 19:28:19,617 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:28:19,624 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 19:28:19,731 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:28:19,755 INFO L206 MainTranslator]: Completed translation [2024-06-03 19:28:19,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19 WrapperNode [2024-06-03 19:28:19,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 19:28:19,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 19:28:19,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 19:28:19,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 19:28:19,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,811 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-03 19:28:19,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 19:28:19,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 19:28:19,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 19:28:19,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 19:28:19,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,852 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-03 19:28:19,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 19:28:19,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 19:28:19,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 19:28:19,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 19:28:19,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (1/1) ... [2024-06-03 19:28:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:28:19,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:28:19,939 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-03 19:28:19,948 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-03 19:28:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 19:28:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 19:28:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 19:28:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 19:28:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 19:28:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 19:28:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 19:28:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 19:28:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-03 19:28:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-03 19:28:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 19:28:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 19:28:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 19:28:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 19:28:19,975 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 19:28:20,109 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 19:28:20,111 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 19:28:20,544 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 19:28:20,544 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 19:28:20,668 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 19:28:20,668 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 19:28:20,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:28:20 BoogieIcfgContainer [2024-06-03 19:28:20,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 19:28:20,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 19:28:20,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 19:28:20,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 19:28:20,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:28:17" (1/4) ... [2024-06-03 19:28:20,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3fb263 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 07:28:20, skipping insertion in model container [2024-06-03 19:28:20,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 07:28:19" (2/4) ... [2024-06-03 19:28:20,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3fb263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:28:20, skipping insertion in model container [2024-06-03 19:28:20,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:28:19" (3/4) ... [2024-06-03 19:28:20,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3fb263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:28:20, skipping insertion in model container [2024-06-03 19:28:20,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:28:20" (4/4) ... [2024-06-03 19:28:20,675 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2024-06-03 19:28:20,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 19:28:20,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-03 19:28:20,687 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 19:28:20,726 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 19:28:20,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-03 19:28:20,770 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-03 19:28:20,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:28:20,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 19:28:20,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-03 19:28:20,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-03 19:28:20,780 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 19:28:20,784 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;@953211b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 19:28:20,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-03 19:28:20,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 19:28:20,788 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 19:28:20,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:28:20,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:20,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 19:28:20,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:20,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -450440332, now seen corresponding path program 1 times [2024-06-03 19:28:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305264803] [2024-06-03 19:28:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:21,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-03 19:28:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305264803] [2024-06-03 19:28:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305264803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:21,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 19:28:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999800308] [2024-06-03 19:28:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:21,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 19:28:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 19:28:21,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 19:28:21,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-03 19:28:21,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:21,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:21,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-03 19:28:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:23,545 INFO L124 PetriNetUnfolderBase]: 9547/13263 cut-off events. [2024-06-03 19:28:23,546 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-06-03 19:28:23,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26597 conditions, 13263 events. 9547/13263 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 71816 event pairs, 7308 based on Foata normal form. 1/13076 useless extension candidates. Maximal degree in co-relation 26581. Up to 12953 conditions per place. [2024-06-03 19:28:23,607 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-03 19:28:23,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 235 flow [2024-06-03 19:28:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 19:28:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 19:28:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-06-03 19:28:23,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-06-03 19:28:23,618 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 96 transitions. [2024-06-03 19:28:23,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 235 flow [2024-06-03 19:28:23,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-03 19:28:23,626 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-03 19:28:23,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-03 19:28:23,629 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-03 19:28:23,630 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-03 19:28:23,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:23,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:23,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:23,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 19:28:23,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:23,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 918560787, now seen corresponding path program 1 times [2024-06-03 19:28:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957830619] [2024-06-03 19:28:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957830619] [2024-06-03 19:28:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957830619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:24,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 19:28:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126016178] [2024-06-03 19:28:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:24,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 19:28:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 19:28:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 19:28:24,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-03 19:28:24,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:24,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:24,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-03 19:28:24,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:25,815 INFO L124 PetriNetUnfolderBase]: 9537/13260 cut-off events. [2024-06-03 19:28:25,815 INFO L125 PetriNetUnfolderBase]: For 2494/2494 co-relation queries the response was YES. [2024-06-03 19:28:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30025 conditions, 13260 events. 9537/13260 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 72113 event pairs, 6489 based on Foata normal form. 4/13261 useless extension candidates. Maximal degree in co-relation 30010. Up to 12918 conditions per place. [2024-06-03 19:28:25,874 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-03 19:28:25,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 327 flow [2024-06-03 19:28:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 19:28:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 19:28:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-06-03 19:28:25,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-06-03 19:28:25,876 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 124 transitions. [2024-06-03 19:28:25,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 327 flow [2024-06-03 19:28:25,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:28:25,882 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-03 19:28:25,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-03 19:28:25,883 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-03 19:28:25,883 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-03 19:28:25,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:25,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:25,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:25,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 19:28:25,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:25,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2026321742, now seen corresponding path program 1 times [2024-06-03 19:28:25,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299152350] [2024-06-03 19:28:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299152350] [2024-06-03 19:28:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299152350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:28:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638060665] [2024-06-03 19:28:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:26,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:28:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:28:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:28:27,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-03 19:28:27,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-03 19:28:27,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:27,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-03 19:28:27,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:28,665 INFO L124 PetriNetUnfolderBase]: 11565/15994 cut-off events. [2024-06-03 19:28:28,665 INFO L125 PetriNetUnfolderBase]: For 8255/8255 co-relation queries the response was YES. [2024-06-03 19:28:28,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40047 conditions, 15994 events. 11565/15994 cut-off events. For 8255/8255 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87028 event pairs, 6611 based on Foata normal form. 4/15995 useless extension candidates. Maximal degree in co-relation 40030. Up to 15580 conditions per place. [2024-06-03 19:28:28,743 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 76 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-03 19:28:28,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 514 flow [2024-06-03 19:28:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:28:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:28:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-06-03 19:28:28,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550314465408805 [2024-06-03 19:28:28,745 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 6 states and 175 transitions. [2024-06-03 19:28:28,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 514 flow [2024-06-03 19:28:28,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 486 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 19:28:28,760 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 258 flow [2024-06-03 19:28:28,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-03 19:28:28,762 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-03 19:28:28,762 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 258 flow [2024-06-03 19:28:28,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-03 19:28:28,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:28,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:28,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 19:28:28,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:28,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1608536278, now seen corresponding path program 1 times [2024-06-03 19:28:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:28,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987144475] [2024-06-03 19:28:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:28,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987144475] [2024-06-03 19:28:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987144475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:28:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8485250] [2024-06-03 19:28:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:28:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:30,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:28:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:28:30,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-03 19:28:30,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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-03 19:28:30,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:30,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-03 19:28:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:31,820 INFO L124 PetriNetUnfolderBase]: 11549/15952 cut-off events. [2024-06-03 19:28:31,820 INFO L125 PetriNetUnfolderBase]: For 16707/16707 co-relation queries the response was YES. [2024-06-03 19:28:31,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44543 conditions, 15952 events. 11549/15952 cut-off events. For 16707/16707 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 86734 event pairs, 5646 based on Foata normal form. 8/15957 useless extension candidates. Maximal degree in co-relation 44524. Up to 15514 conditions per place. [2024-06-03 19:28:31,899 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 83 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2024-06-03 19:28:31,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 604 flow [2024-06-03 19:28:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-03 19:28:31,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5336927223719676 [2024-06-03 19:28:31,902 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 258 flow. Second operand 7 states and 198 transitions. [2024-06-03 19:28:31,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 604 flow [2024-06-03 19:28:31,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 565 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 19:28:31,908 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 291 flow [2024-06-03 19:28:31,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-03 19:28:31,910 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-03 19:28:31,910 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 291 flow [2024-06-03 19:28:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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-03 19:28:31,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:31,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:31,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 19:28:31,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:31,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1375156545, now seen corresponding path program 1 times [2024-06-03 19:28:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602591494] [2024-06-03 19:28:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602591494] [2024-06-03 19:28:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602591494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:28:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628713982] [2024-06-03 19:28:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:32,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:28:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:28:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:28:32,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:32,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:32,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:32,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:32,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:34,244 INFO L124 PetriNetUnfolderBase]: 11531/15944 cut-off events. [2024-06-03 19:28:34,244 INFO L125 PetriNetUnfolderBase]: For 26012/26012 co-relation queries the response was YES. [2024-06-03 19:28:34,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47672 conditions, 15944 events. 11531/15944 cut-off events. For 26012/26012 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 86693 event pairs, 6023 based on Foata normal form. 6/15947 useless extension candidates. Maximal degree in co-relation 47652. Up to 15565 conditions per place. [2024-06-03 19:28:34,338 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 67 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2024-06-03 19:28:34,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 517 flow [2024-06-03 19:28:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:28:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:28:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-03 19:28:34,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-03 19:28:34,340 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 291 flow. Second operand 5 states and 125 transitions. [2024-06-03 19:28:34,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 517 flow [2024-06-03 19:28:34,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 463 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 19:28:34,346 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 302 flow [2024-06-03 19:28:34,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-03 19:28:34,347 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-03 19:28:34,347 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 302 flow [2024-06-03 19:28:34,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:34,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:34,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:34,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 19:28:34,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:34,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1330164000, now seen corresponding path program 1 times [2024-06-03 19:28:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685142965] [2024-06-03 19:28:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685142965] [2024-06-03 19:28:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685142965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:35,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:35,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:28:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913536017] [2024-06-03 19:28:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:35,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:28:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:28:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:28:35,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:35,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 302 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-03 19:28:35,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:35,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:35,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:37,076 INFO L124 PetriNetUnfolderBase]: 11606/16057 cut-off events. [2024-06-03 19:28:37,076 INFO L125 PetriNetUnfolderBase]: For 36596/36596 co-relation queries the response was YES. [2024-06-03 19:28:37,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51809 conditions, 16057 events. 11606/16057 cut-off events. For 36596/36596 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87134 event pairs, 5741 based on Foata normal form. 6/16057 useless extension candidates. Maximal degree in co-relation 51787. Up to 15592 conditions per place. [2024-06-03 19:28:37,175 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 82 selfloop transitions, 21 changer transitions 0/109 dead transitions. [2024-06-03 19:28:37,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 717 flow [2024-06-03 19:28:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:28:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:28:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-06-03 19:28:37,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937106918238994 [2024-06-03 19:28:37,180 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 302 flow. Second operand 6 states and 157 transitions. [2024-06-03 19:28:37,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 717 flow [2024-06-03 19:28:37,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 663 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 19:28:37,187 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 424 flow [2024-06-03 19:28:37,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2024-06-03 19:28:37,187 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2024-06-03 19:28:37,188 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 424 flow [2024-06-03 19:28:37,188 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-03 19:28:37,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:37,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 19:28:37,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:37,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash -579972990, now seen corresponding path program 2 times [2024-06-03 19:28:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624828974] [2024-06-03 19:28:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624828974] [2024-06-03 19:28:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624828974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:38,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:38,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:28:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325921250] [2024-06-03 19:28:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:38,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:28:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:28:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:28:38,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:38,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 424 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-03 19:28:38,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:38,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:39,724 INFO L124 PetriNetUnfolderBase]: 11588/16038 cut-off events. [2024-06-03 19:28:39,724 INFO L125 PetriNetUnfolderBase]: For 50875/50875 co-relation queries the response was YES. [2024-06-03 19:28:39,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56454 conditions, 16038 events. 11588/16038 cut-off events. For 50875/50875 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87159 event pairs, 5856 based on Foata normal form. 6/16041 useless extension candidates. Maximal degree in co-relation 56430. Up to 15628 conditions per place. [2024-06-03 19:28:39,822 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 82 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2024-06-03 19:28:39,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 682 flow [2024-06-03 19:28:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:28:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:28:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-03 19:28:39,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46540880503144655 [2024-06-03 19:28:39,824 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 424 flow. Second operand 6 states and 148 transitions. [2024-06-03 19:28:39,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 682 flow [2024-06-03 19:28:39,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 636 flow, removed 22 selfloop flow, removed 1 redundant places. [2024-06-03 19:28:39,848 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 417 flow [2024-06-03 19:28:39,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-03 19:28:39,848 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2024-06-03 19:28:39,849 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 417 flow [2024-06-03 19:28:39,849 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-03 19:28:39,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:39,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:39,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 19:28:39,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:39,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1714470218, now seen corresponding path program 1 times [2024-06-03 19:28:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634534998] [2024-06-03 19:28:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634534998] [2024-06-03 19:28:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634534998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:28:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209606684] [2024-06-03 19:28:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:28:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:28:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:28:40,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:40,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 417 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:40,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:40,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:40,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:42,591 INFO L124 PetriNetUnfolderBase]: 11632/16092 cut-off events. [2024-06-03 19:28:42,591 INFO L125 PetriNetUnfolderBase]: For 58166/58166 co-relation queries the response was YES. [2024-06-03 19:28:42,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57275 conditions, 16092 events. 11632/16092 cut-off events. For 58166/58166 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87452 event pairs, 5768 based on Foata normal form. 6/16095 useless extension candidates. Maximal degree in co-relation 57248. Up to 15661 conditions per place. [2024-06-03 19:28:42,690 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 95 selfloop transitions, 18 changer transitions 0/119 dead transitions. [2024-06-03 19:28:42,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 119 transitions, 781 flow [2024-06-03 19:28:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-03 19:28:42,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477088948787062 [2024-06-03 19:28:42,691 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 417 flow. Second operand 7 states and 177 transitions. [2024-06-03 19:28:42,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 119 transitions, 781 flow [2024-06-03 19:28:42,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 734 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 19:28:42,717 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 463 flow [2024-06-03 19:28:42,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2024-06-03 19:28:42,718 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-03 19:28:42,718 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 463 flow [2024-06-03 19:28:42,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:42,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:42,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:42,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 19:28:42,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:42,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1118464484, now seen corresponding path program 2 times [2024-06-03 19:28:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:42,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984316601] [2024-06-03 19:28:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984316601] [2024-06-03 19:28:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984316601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:28:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823465253] [2024-06-03 19:28:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:43,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:28:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:28:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:28:43,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:43,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 463 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:43,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:43,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:43,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:45,230 INFO L124 PetriNetUnfolderBase]: 11707/16191 cut-off events. [2024-06-03 19:28:45,230 INFO L125 PetriNetUnfolderBase]: For 74849/74849 co-relation queries the response was YES. [2024-06-03 19:28:45,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61653 conditions, 16191 events. 11707/16191 cut-off events. For 74849/74849 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87925 event pairs, 5535 based on Foata normal form. 6/16189 useless extension candidates. Maximal degree in co-relation 61627. Up to 15603 conditions per place. [2024-06-03 19:28:45,327 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 88 selfloop transitions, 35 changer transitions 0/129 dead transitions. [2024-06-03 19:28:45,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 129 transitions, 955 flow [2024-06-03 19:28:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-06-03 19:28:45,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49326145552560646 [2024-06-03 19:28:45,353 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 463 flow. Second operand 7 states and 183 transitions. [2024-06-03 19:28:45,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 129 transitions, 955 flow [2024-06-03 19:28:45,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 894 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 19:28:45,388 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 583 flow [2024-06-03 19:28:45,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=583, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2024-06-03 19:28:45,389 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-06-03 19:28:45,389 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 583 flow [2024-06-03 19:28:45,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:45,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:45,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 19:28:45,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -781417678, now seen corresponding path program 3 times [2024-06-03 19:28:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667674628] [2024-06-03 19:28:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667674628] [2024-06-03 19:28:46,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667674628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:46,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:28:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136956906] [2024-06-03 19:28:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:46,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:28:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:28:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:28:46,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:46,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:46,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:46,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:46,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:47,998 INFO L124 PetriNetUnfolderBase]: 11689/16172 cut-off events. [2024-06-03 19:28:47,998 INFO L125 PetriNetUnfolderBase]: For 95369/95369 co-relation queries the response was YES. [2024-06-03 19:28:48,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65390 conditions, 16172 events. 11689/16172 cut-off events. For 95369/95369 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 87830 event pairs, 5775 based on Foata normal form. 6/16173 useless extension candidates. Maximal degree in co-relation 65363. Up to 15728 conditions per place. [2024-06-03 19:28:48,097 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 98 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2024-06-03 19:28:48,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 903 flow [2024-06-03 19:28:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-03 19:28:48,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636118598382749 [2024-06-03 19:28:48,099 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 583 flow. Second operand 7 states and 172 transitions. [2024-06-03 19:28:48,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 903 flow [2024-06-03 19:28:48,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 819 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-03 19:28:48,135 INFO L231 Difference]: Finished difference. Result has 82 places, 89 transitions, 546 flow [2024-06-03 19:28:48,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2024-06-03 19:28:48,136 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2024-06-03 19:28:48,136 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 546 flow [2024-06-03 19:28:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:48,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:48,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:48,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 19:28:48,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:48,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1547098024, now seen corresponding path program 1 times [2024-06-03 19:28:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727448844] [2024-06-03 19:28:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:49,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-03 19:28:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727448844] [2024-06-03 19:28:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727448844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:49,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:28:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197372915] [2024-06-03 19:28:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:49,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:28:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:28:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:28:49,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-03 19:28:49,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 546 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-03 19:28:49,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:49,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-03 19:28:49,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:51,594 INFO L124 PetriNetUnfolderBase]: 14193/19377 cut-off events. [2024-06-03 19:28:51,594 INFO L125 PetriNetUnfolderBase]: For 126421/126421 co-relation queries the response was YES. [2024-06-03 19:28:51,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78408 conditions, 19377 events. 14193/19377 cut-off events. For 126421/126421 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 103123 event pairs, 7033 based on Foata normal form. 6/19378 useless extension candidates. Maximal degree in co-relation 78379. Up to 19065 conditions per place. [2024-06-03 19:28:51,761 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 103 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2024-06-03 19:28:51,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 949 flow [2024-06-03 19:28:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-03 19:28:51,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444743935309973 [2024-06-03 19:28:51,763 INFO L175 Difference]: Start difference. First operand has 82 places, 89 transitions, 546 flow. Second operand 7 states and 165 transitions. [2024-06-03 19:28:51,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 949 flow [2024-06-03 19:28:51,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 883 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 19:28:51,839 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 618 flow [2024-06-03 19:28:51,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=618, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-03 19:28:51,839 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2024-06-03 19:28:51,839 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 618 flow [2024-06-03 19:28:51,840 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-03 19:28:51,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:51,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 19:28:51,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:51,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1050375204, now seen corresponding path program 1 times [2024-06-03 19:28:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080737841] [2024-06-03 19:28:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:52,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-03 19:28:52,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080737841] [2024-06-03 19:28:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080737841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:52,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:28:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805327462] [2024-06-03 19:28:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:52,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:28:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:28:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:28:52,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:52,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:52,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:52,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:52,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:54,467 INFO L124 PetriNetUnfolderBase]: 13432/18795 cut-off events. [2024-06-03 19:28:54,467 INFO L125 PetriNetUnfolderBase]: For 145799/145808 co-relation queries the response was YES. [2024-06-03 19:28:54,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80293 conditions, 18795 events. 13432/18795 cut-off events. For 145799/145808 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 104442 event pairs, 7113 based on Foata normal form. 11/18795 useless extension candidates. Maximal degree in co-relation 80262. Up to 18186 conditions per place. [2024-06-03 19:28:54,612 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 95 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2024-06-03 19:28:54,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 904 flow [2024-06-03 19:28:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:28:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:28:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-03 19:28:54,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-03 19:28:54,614 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 618 flow. Second operand 5 states and 120 transitions. [2024-06-03 19:28:54,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 904 flow [2024-06-03 19:28:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 834 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 19:28:54,676 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 625 flow [2024-06-03 19:28:54,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=625, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2024-06-03 19:28:54,677 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-06-03 19:28:54,677 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 625 flow [2024-06-03 19:28:54,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:54,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:54,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:54,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 19:28:54,678 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:54,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1608880255, now seen corresponding path program 1 times [2024-06-03 19:28:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609526741] [2024-06-03 19:28:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609526741] [2024-06-03 19:28:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609526741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:28:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611084881] [2024-06-03 19:28:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:55,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:28:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:28:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:28:55,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:55,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 625 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-03 19:28:55,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:55,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:55,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:58,088 INFO L124 PetriNetUnfolderBase]: 13913/19236 cut-off events. [2024-06-03 19:28:58,089 INFO L125 PetriNetUnfolderBase]: For 169793/169793 co-relation queries the response was YES. [2024-06-03 19:28:58,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85766 conditions, 19236 events. 13913/19236 cut-off events. For 169793/169793 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 106126 event pairs, 6803 based on Foata normal form. 6/19231 useless extension candidates. Maximal degree in co-relation 85734. Up to 18647 conditions per place. [2024-06-03 19:28:58,238 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 127 selfloop transitions, 26 changer transitions 0/160 dead transitions. [2024-06-03 19:28:58,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 160 transitions, 1135 flow [2024-06-03 19:28:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:28:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:28:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-03 19:28:58,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758909853249476 [2024-06-03 19:28:58,240 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 625 flow. Second operand 9 states and 227 transitions. [2024-06-03 19:28:58,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 160 transitions, 1135 flow [2024-06-03 19:28:58,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 160 transitions, 1088 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 19:28:58,482 INFO L231 Difference]: Finished difference. Result has 91 places, 104 transitions, 706 flow [2024-06-03 19:28:58,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2024-06-03 19:28:58,483 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-06-03 19:28:58,483 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 104 transitions, 706 flow [2024-06-03 19:28:58,483 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-03 19:28:58,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:58,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:58,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 19:28:58,484 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:58,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash 312661895, now seen corresponding path program 2 times [2024-06-03 19:28:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:58,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916254457] [2024-06-03 19:28:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:59,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916254457] [2024-06-03 19:28:59,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916254457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:59,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:59,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:28:59,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980081706] [2024-06-03 19:28:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:59,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:28:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:28:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:28:59,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:28:59,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 104 transitions, 706 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-03 19:28:59,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:59,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:28:59,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:02,115 INFO L124 PetriNetUnfolderBase]: 14135/19398 cut-off events. [2024-06-03 19:29:02,116 INFO L125 PetriNetUnfolderBase]: For 210248/210248 co-relation queries the response was YES. [2024-06-03 19:29:02,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91437 conditions, 19398 events. 14135/19398 cut-off events. For 210248/210248 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 106495 event pairs, 8278 based on Foata normal form. 6/19348 useless extension candidates. Maximal degree in co-relation 91404. Up to 18829 conditions per place. [2024-06-03 19:29:02,248 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 121 selfloop transitions, 44 changer transitions 0/172 dead transitions. [2024-06-03 19:29:02,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 172 transitions, 1363 flow [2024-06-03 19:29:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:29:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:29:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-03 19:29:02,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45073375262054505 [2024-06-03 19:29:02,250 INFO L175 Difference]: Start difference. First operand has 91 places, 104 transitions, 706 flow. Second operand 9 states and 215 transitions. [2024-06-03 19:29:02,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 172 transitions, 1363 flow [2024-06-03 19:29:02,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 172 transitions, 1244 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-03 19:29:02,331 INFO L231 Difference]: Finished difference. Result has 97 places, 129 transitions, 975 flow [2024-06-03 19:29:02,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=975, PETRI_PLACES=97, PETRI_TRANSITIONS=129} [2024-06-03 19:29:02,331 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 41 predicate places. [2024-06-03 19:29:02,331 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 129 transitions, 975 flow [2024-06-03 19:29:02,332 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-03 19:29:02,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:02,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:02,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 19:29:02,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:02,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1679660349, now seen corresponding path program 3 times [2024-06-03 19:29:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471458515] [2024-06-03 19:29:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471458515] [2024-06-03 19:29:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471458515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:29:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412594569] [2024-06-03 19:29:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:03,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:29:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:29:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:29:03,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:29:03,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 129 transitions, 975 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-03 19:29:03,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:03,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:29:03,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:06,133 INFO L124 PetriNetUnfolderBase]: 14628/20268 cut-off events. [2024-06-03 19:29:06,134 INFO L125 PetriNetUnfolderBase]: For 237562/237574 co-relation queries the response was YES. [2024-06-03 19:29:06,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100129 conditions, 20268 events. 14628/20268 cut-off events. For 237562/237574 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 112089 event pairs, 6270 based on Foata normal form. 14/20267 useless extension candidates. Maximal degree in co-relation 100091. Up to 19197 conditions per place. [2024-06-03 19:29:06,353 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 139 selfloop transitions, 100 changer transitions 0/246 dead transitions. [2024-06-03 19:29:06,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 246 transitions, 2232 flow [2024-06-03 19:29:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:29:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:29:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-03 19:29:06,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48218029350104824 [2024-06-03 19:29:06,355 INFO L175 Difference]: Start difference. First operand has 97 places, 129 transitions, 975 flow. Second operand 9 states and 230 transitions. [2024-06-03 19:29:06,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 246 transitions, 2232 flow [2024-06-03 19:29:06,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 246 transitions, 2035 flow, removed 56 selfloop flow, removed 2 redundant places. [2024-06-03 19:29:06,508 INFO L231 Difference]: Finished difference. Result has 107 places, 192 transitions, 1744 flow [2024-06-03 19:29:06,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1744, PETRI_PLACES=107, PETRI_TRANSITIONS=192} [2024-06-03 19:29:06,509 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 51 predicate places. [2024-06-03 19:29:06,509 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 192 transitions, 1744 flow [2024-06-03 19:29:06,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-03 19:29:06,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:06,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:06,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 19:29:06,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:06,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 999368929, now seen corresponding path program 1 times [2024-06-03 19:29:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947543072] [2024-06-03 19:29:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947543072] [2024-06-03 19:29:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947543072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:29:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082648316] [2024-06-03 19:29:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:07,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:29:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:29:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:29:07,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-03 19:29:07,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 192 transitions, 1744 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-03 19:29:07,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:07,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-03 19:29:07,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:10,244 INFO L124 PetriNetUnfolderBase]: 15221/20782 cut-off events. [2024-06-03 19:29:10,245 INFO L125 PetriNetUnfolderBase]: For 294166/294166 co-relation queries the response was YES. [2024-06-03 19:29:10,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109567 conditions, 20782 events. 15221/20782 cut-off events. For 294166/294166 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 110757 event pairs, 8929 based on Foata normal form. 3/20731 useless extension candidates. Maximal degree in co-relation 109524. Up to 20421 conditions per place. [2024-06-03 19:29:10,450 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 203 selfloop transitions, 31 changer transitions 0/239 dead transitions. [2024-06-03 19:29:10,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 239 transitions, 2497 flow [2024-06-03 19:29:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:29:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:29:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-03 19:29:10,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4474393530997305 [2024-06-03 19:29:10,452 INFO L175 Difference]: Start difference. First operand has 107 places, 192 transitions, 1744 flow. Second operand 7 states and 166 transitions. [2024-06-03 19:29:10,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 239 transitions, 2497 flow [2024-06-03 19:29:10,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 239 transitions, 2399 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-03 19:29:10,645 INFO L231 Difference]: Finished difference. Result has 111 places, 205 transitions, 1923 flow [2024-06-03 19:29:10,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1923, PETRI_PLACES=111, PETRI_TRANSITIONS=205} [2024-06-03 19:29:10,646 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 55 predicate places. [2024-06-03 19:29:10,646 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 205 transitions, 1923 flow [2024-06-03 19:29:10,648 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-03 19:29:10,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:10,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 19:29:10,649 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:10,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1486167937, now seen corresponding path program 4 times [2024-06-03 19:29:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291156571] [2024-06-03 19:29:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:11,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-03 19:29:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291156571] [2024-06-03 19:29:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291156571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:29:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259590345] [2024-06-03 19:29:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:29:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:29:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:29:11,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:29:11,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 205 transitions, 1923 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-03 19:29:11,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:11,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:29:11,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:14,801 INFO L124 PetriNetUnfolderBase]: 14694/20192 cut-off events. [2024-06-03 19:29:14,802 INFO L125 PetriNetUnfolderBase]: For 323685/323700 co-relation queries the response was YES. [2024-06-03 19:29:14,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111407 conditions, 20192 events. 14694/20192 cut-off events. For 323685/323700 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 111118 event pairs, 7770 based on Foata normal form. 19/20166 useless extension candidates. Maximal degree in co-relation 111362. Up to 19476 conditions per place. [2024-06-03 19:29:14,970 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 197 selfloop transitions, 58 changer transitions 0/262 dead transitions. [2024-06-03 19:29:14,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 262 transitions, 2871 flow [2024-06-03 19:29:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:29:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:29:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-03 19:29:14,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-03 19:29:14,972 INFO L175 Difference]: Start difference. First operand has 111 places, 205 transitions, 1923 flow. Second operand 8 states and 200 transitions. [2024-06-03 19:29:14,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 262 transitions, 2871 flow [2024-06-03 19:29:15,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 262 transitions, 2772 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-03 19:29:15,159 INFO L231 Difference]: Finished difference. Result has 115 places, 213 transitions, 2152 flow [2024-06-03 19:29:15,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2152, PETRI_PLACES=115, PETRI_TRANSITIONS=213} [2024-06-03 19:29:15,160 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 59 predicate places. [2024-06-03 19:29:15,160 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 213 transitions, 2152 flow [2024-06-03 19:29:15,160 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-03 19:29:15,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:15,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:15,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 19:29:15,161 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:15,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1786487134, now seen corresponding path program 1 times [2024-06-03 19:29:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065732455] [2024-06-03 19:29:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065732455] [2024-06-03 19:29:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065732455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:29:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557058636] [2024-06-03 19:29:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:16,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:29:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:29:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:29:16,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-03 19:29:16,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 213 transitions, 2152 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-03 19:29:16,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:16,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-03 19:29:16,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:19,468 INFO L124 PetriNetUnfolderBase]: 16388/22338 cut-off events. [2024-06-03 19:29:19,468 INFO L125 PetriNetUnfolderBase]: For 433248/433481 co-relation queries the response was YES. [2024-06-03 19:29:19,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128844 conditions, 22338 events. 16388/22338 cut-off events. For 433248/433481 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 119218 event pairs, 9949 based on Foata normal form. 117/22414 useless extension candidates. Maximal degree in co-relation 128797. Up to 21931 conditions per place. [2024-06-03 19:29:19,651 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 213 selfloop transitions, 23 changer transitions 0/248 dead transitions. [2024-06-03 19:29:19,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 2894 flow [2024-06-03 19:29:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:29:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:29:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-03 19:29:19,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449685534591195 [2024-06-03 19:29:19,652 INFO L175 Difference]: Start difference. First operand has 115 places, 213 transitions, 2152 flow. Second operand 6 states and 143 transitions. [2024-06-03 19:29:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 2894 flow [2024-06-03 19:29:19,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 248 transitions, 2766 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-03 19:29:19,869 INFO L231 Difference]: Finished difference. Result has 119 places, 227 transitions, 2257 flow [2024-06-03 19:29:19,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2257, PETRI_PLACES=119, PETRI_TRANSITIONS=227} [2024-06-03 19:29:19,870 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-03 19:29:19,870 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 227 transitions, 2257 flow [2024-06-03 19:29:19,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-03 19:29:19,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:19,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:19,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 19:29:19,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:19,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1038507989, now seen corresponding path program 1 times [2024-06-03 19:29:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904283588] [2024-06-03 19:29:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904283588] [2024-06-03 19:29:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904283588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:29:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268080982] [2024-06-03 19:29:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:21,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:29:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:29:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:29:21,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:29:21,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 227 transitions, 2257 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-03 19:29:21,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:21,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:29:21,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:25,318 INFO L124 PetriNetUnfolderBase]: 15687/21915 cut-off events. [2024-06-03 19:29:25,318 INFO L125 PetriNetUnfolderBase]: For 437636/437804 co-relation queries the response was YES. [2024-06-03 19:29:25,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132060 conditions, 21915 events. 15687/21915 cut-off events. For 437636/437804 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 123738 event pairs, 6583 based on Foata normal form. 42/21905 useless extension candidates. Maximal degree in co-relation 132009. Up to 20299 conditions per place. [2024-06-03 19:29:25,499 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 266 selfloop transitions, 84 changer transitions 0/360 dead transitions. [2024-06-03 19:29:25,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 360 transitions, 3860 flow [2024-06-03 19:29:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:29:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:29:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 307 transitions. [2024-06-03 19:29:25,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827044025157233 [2024-06-03 19:29:25,502 INFO L175 Difference]: Start difference. First operand has 119 places, 227 transitions, 2257 flow. Second operand 12 states and 307 transitions. [2024-06-03 19:29:25,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 360 transitions, 3860 flow [2024-06-03 19:29:25,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 360 transitions, 3810 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-03 19:29:25,969 INFO L231 Difference]: Finished difference. Result has 135 places, 274 transitions, 2993 flow [2024-06-03 19:29:25,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2993, PETRI_PLACES=135, PETRI_TRANSITIONS=274} [2024-06-03 19:29:25,970 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 79 predicate places. [2024-06-03 19:29:25,970 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 274 transitions, 2993 flow [2024-06-03 19:29:25,971 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-03 19:29:25,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:25,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 19:29:25,972 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:26,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2063474953, now seen corresponding path program 2 times [2024-06-03 19:29:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145397563] [2024-06-03 19:29:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145397563] [2024-06-03 19:29:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145397563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:29:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105871517] [2024-06-03 19:29:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:27,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:29:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:29:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:29:27,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:29:27,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 274 transitions, 2993 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-03 19:29:27,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:27,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:29:27,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:31,250 INFO L124 PetriNetUnfolderBase]: 17121/23837 cut-off events. [2024-06-03 19:29:31,251 INFO L125 PetriNetUnfolderBase]: For 559547/559734 co-relation queries the response was YES. [2024-06-03 19:29:31,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154186 conditions, 23837 events. 17121/23837 cut-off events. For 559547/559734 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 136131 event pairs, 7561 based on Foata normal form. 44/23679 useless extension candidates. Maximal degree in co-relation 154127. Up to 21919 conditions per place. [2024-06-03 19:29:31,483 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 286 selfloop transitions, 102 changer transitions 0/398 dead transitions. [2024-06-03 19:29:31,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 398 transitions, 4909 flow [2024-06-03 19:29:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:29:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:29:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions. [2024-06-03 19:29:31,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48713550600343053 [2024-06-03 19:29:31,485 INFO L175 Difference]: Start difference. First operand has 135 places, 274 transitions, 2993 flow. Second operand 11 states and 284 transitions. [2024-06-03 19:29:31,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 398 transitions, 4909 flow [2024-06-03 19:29:32,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 398 transitions, 4799 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-03 19:29:32,060 INFO L231 Difference]: Finished difference. Result has 147 places, 321 transitions, 3952 flow [2024-06-03 19:29:32,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2921, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3952, PETRI_PLACES=147, PETRI_TRANSITIONS=321} [2024-06-03 19:29:32,060 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 91 predicate places. [2024-06-03 19:29:32,060 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 321 transitions, 3952 flow [2024-06-03 19:29:32,061 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-03 19:29:32,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:29:32,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:29:32,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 19:29:32,061 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:29:32,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:29:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1725819097, now seen corresponding path program 3 times [2024-06-03 19:29:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:29:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573560914] [2024-06-03 19:29:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:29:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:29:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:29:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:29:32,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:29:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573560914] [2024-06-03 19:29:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573560914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:29:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:29:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:29:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264452444] [2024-06-03 19:29:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:29:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:29:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:29:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:29:32,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:29:32,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-03 19:29:32,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 321 transitions, 3952 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:29:32,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:29:32,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-03 19:29:32,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:29:37,903 INFO L124 PetriNetUnfolderBase]: 19248/27003 cut-off events. [2024-06-03 19:29:37,903 INFO L125 PetriNetUnfolderBase]: For 742143/742373 co-relation queries the response was YES. [2024-06-03 19:29:38,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187190 conditions, 27003 events. 19248/27003 cut-off events. For 742143/742373 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 159341 event pairs, 7185 based on Foata normal form. 74/26828 useless extension candidates. Maximal degree in co-relation 187124. Up to 22289 conditions per place. [2024-06-03 19:29:38,223 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 269 selfloop transitions, 157 changer transitions 0/436 dead transitions. [2024-06-03 19:29:38,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 436 transitions, 6312 flow [2024-06-03 19:29:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:29:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:29:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-06-03 19:29:38,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018867924528302 [2024-06-03 19:29:38,224 INFO L175 Difference]: Start difference. First operand has 147 places, 321 transitions, 3952 flow. Second operand 10 states and 266 transitions. [2024-06-03 19:29:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 436 transitions, 6312 flow