./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.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/safe007_power.opt-thin001_power.opt.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/safe007_power.opt-thin001_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe007_power.opt-thin001_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --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-04 15:33:55,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:33:56,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:33:56,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:33:56,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:33:56,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:33:56,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:33:56,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:33:56,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:33:56,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:33:56,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:33:56,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:33:56,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:33:56,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:33:56,069 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:33:56,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:33:56,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:33:56,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:33:56,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:33:56,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:33:56,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:33:56,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:33:56,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:33:56,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:33:56,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:33:56,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:33:56,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:33:56,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:33:56,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:33:56,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:33:56,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:33:56,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:33:56,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:33:56,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:33:56,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:33:56,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:33:56,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:33:56,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:33:56,079 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-04 15:33:56,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:33:56,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:33:56,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:33:56,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:33:56,286 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:33:56,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-06-04 15:33:57,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:33:57,642 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:33:57,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2024-06-04 15:33:57,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd8fc5f/ceb183dfcb4e4be7a3a090cd3c7bfdfe/FLAG60a7e7ef3 [2024-06-04 15:33:57,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd8fc5f/ceb183dfcb4e4be7a3a090cd3c7bfdfe [2024-06-04 15:33:57,674 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:33:57,675 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:33:57,675 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/safe007_power.opt-thin001_power.opt.yml/witness.yml [2024-06-04 15:33:57,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:33:57,856 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:33:57,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:33:57,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:33:57,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:33:57,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:33:57" (1/2) ... [2024-06-04 15:33:57,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1915bb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:33:57, skipping insertion in model container [2024-06-04 15:33:57,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:33:57" (1/2) ... [2024-06-04 15:33:57,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4378cd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:33:57, skipping insertion in model container [2024-06-04 15:33:57,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:33:57" (2/2) ... [2024-06-04 15:33:57,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1915bb52 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:57, skipping insertion in model container [2024-06-04 15:33:57,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:33:57" (2/2) ... [2024-06-04 15:33:57,864 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:33:57,969 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:33:57,970 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-04 15:33:57,971 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-04 15:33:57,971 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & y) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-04 15:33:57,971 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:33:57,971 INFO L106 edCorrectnessWitness]: ghost_update [L851-L851] multithreaded = 1; [2024-06-04 15:33:58,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:33:58,285 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:33:58,294 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:33:58,399 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:33:58,465 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:33:58,466 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58 WrapperNode [2024-06-04 15:33:58,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:33:58,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:33:58,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:33:58,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:33:58,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,530 INFO L138 Inliner]: procedures = 175, calls = 84, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 252 [2024-06-04 15:33:58,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:33:58,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:33:58,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:33:58,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:33:58,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,559 INFO L175 MemorySlicer]: Split 42 memory accesses to 2 slices as follows [2, 40]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-04 15:33:58,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:33:58,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:33:58,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:33:58,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:33:58,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (1/1) ... [2024-06-04 15:33:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:33:58,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:33:58,638 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-04 15:33:58,676 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-04 15:33:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:33:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:33:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:33:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:33:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:33:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:33:58,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:33:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:33:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:33:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:33:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:33:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:33:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:33:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:33:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:33:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:33:58,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:33:58,704 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:33:58,847 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:33:58,848 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:33:59,287 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:33:59,288 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:33:59,619 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:33:59,619 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:33:59,619 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:33:59 BoogieIcfgContainer [2024-06-04 15:33:59,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:33:59,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:33:59,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:33:59,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:33:59,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:33:57" (1/4) ... [2024-06-04 15:33:59,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f48d9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:33:59, skipping insertion in model container [2024-06-04 15:33:59,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:33:57" (2/4) ... [2024-06-04 15:33:59,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f48d9d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:33:59, skipping insertion in model container [2024-06-04 15:33:59,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:33:58" (3/4) ... [2024-06-04 15:33:59,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f48d9d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:33:59, skipping insertion in model container [2024-06-04 15:33:59,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:33:59" (4/4) ... [2024-06-04 15:33:59,627 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2024-06-04 15:33:59,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:33:59,641 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:33:59,641 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:33:59,731 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:33:59,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:33:59,788 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 15:33:59,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:33:59,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:33:59,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 15:33:59,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 15:33:59,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:33:59,854 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;@6af5925d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:33:59,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:33:59,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:33:59,872 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:33:59,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:33:59,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:33:59,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:33:59,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:33:59,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:33:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -967696099, now seen corresponding path program 1 times [2024-06-04 15:33:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:33:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480657737] [2024-06-04 15:33:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:33:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:02,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:02,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480657737] [2024-06-04 15:34:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480657737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:34:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808158717] [2024-06-04 15:34:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:02,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:34:02,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:34:02,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:34:02,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:34:02,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:02,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:02,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:34:02,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:02,705 INFO L124 PetriNetUnfolderBase]: 557/890 cut-off events. [2024-06-04 15:34:02,706 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-04 15:34:02,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 890 events. 557/890 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3915 event pairs, 292 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1805. Up to 865 conditions per place. [2024-06-04 15:34:02,713 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 15:34:02,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-04 15:34:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:34:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:34:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-06-04 15:34:02,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-04 15:34:02,724 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 80 transitions. [2024-06-04 15:34:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-04 15:34:02,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:02,728 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-04 15:34:02,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-04 15:34:02,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-04 15:34:02,732 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-04 15:34:02,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:02,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:02,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:02,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:34:02,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:02,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -812498076, now seen corresponding path program 1 times [2024-06-04 15:34:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909533634] [2024-06-04 15:34:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909533634] [2024-06-04 15:34:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909533634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:04,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:04,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:04,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63875266] [2024-06-04 15:34:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:04,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:04,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:04,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:04,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:04,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:04,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:05,670 INFO L124 PetriNetUnfolderBase]: 872/1362 cut-off events. [2024-06-04 15:34:05,671 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-06-04 15:34:05,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3066 conditions, 1362 events. 872/1362 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5928 event pairs, 296 based on Foata normal form. 0/1355 useless extension candidates. Maximal degree in co-relation 3050. Up to 1301 conditions per place. [2024-06-04 15:34:05,677 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 37 selfloop transitions, 15 changer transitions 0/58 dead transitions. [2024-06-04 15:34:05,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 288 flow [2024-06-04 15:34:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-04 15:34:05,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-04 15:34:05,679 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 6 states and 101 transitions. [2024-06-04 15:34:05,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 288 flow [2024-06-04 15:34:05,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:34:05,681 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 230 flow [2024-06-04 15:34:05,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-06-04 15:34:05,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-06-04 15:34:05,682 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 230 flow [2024-06-04 15:34:05,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:05,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:05,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:05,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:34:05,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:05,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash -803243646, now seen corresponding path program 2 times [2024-06-04 15:34:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054463313] [2024-06-04 15:34:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054463313] [2024-06-04 15:34:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054463313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:07,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:07,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838591931] [2024-06-04 15:34:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:07,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:07,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:07,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:07,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:07,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:07,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:07,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:08,046 INFO L124 PetriNetUnfolderBase]: 873/1364 cut-off events. [2024-06-04 15:34:08,046 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2024-06-04 15:34:08,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1364 events. 873/1364 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5973 event pairs, 297 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 3440. Up to 1302 conditions per place. [2024-06-04 15:34:08,053 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 37 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2024-06-04 15:34:08,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 380 flow [2024-06-04 15:34:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-04 15:34:08,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:34:08,055 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 230 flow. Second operand 5 states and 90 transitions. [2024-06-04 15:34:08,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 380 flow [2024-06-04 15:34:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 378 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-04 15:34:08,057 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 283 flow [2024-06-04 15:34:08,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-04 15:34:08,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-04 15:34:08,058 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 283 flow [2024-06-04 15:34:08,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:08,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:08,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:08,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:34:08,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:08,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -803232486, now seen corresponding path program 3 times [2024-06-04 15:34:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990584326] [2024-06-04 15:34:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990584326] [2024-06-04 15:34:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990584326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:09,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932694741] [2024-06-04 15:34:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:09,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:09,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:09,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:09,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:09,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:10,352 INFO L124 PetriNetUnfolderBase]: 872/1363 cut-off events. [2024-06-04 15:34:10,352 INFO L125 PetriNetUnfolderBase]: For 631/634 co-relation queries the response was YES. [2024-06-04 15:34:10,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1363 events. 872/1363 cut-off events. For 631/634 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5949 event pairs, 292 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 3480. Up to 1301 conditions per place. [2024-06-04 15:34:10,360 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2024-06-04 15:34:10,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 445 flow [2024-06-04 15:34:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-04 15:34:10,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-04 15:34:10,362 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 283 flow. Second operand 5 states and 95 transitions. [2024-06-04 15:34:10,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 445 flow [2024-06-04 15:34:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 416 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:10,368 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 307 flow [2024-06-04 15:34:10,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-04 15:34:10,369 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2024-06-04 15:34:10,369 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 307 flow [2024-06-04 15:34:10,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:10,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:10,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:10,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:34:10,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:10,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -813136388, now seen corresponding path program 1 times [2024-06-04 15:34:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067083635] [2024-06-04 15:34:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067083635] [2024-06-04 15:34:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067083635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572708932] [2024-06-04 15:34:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:11,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:34:11,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:11,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:11,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:34:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:12,277 INFO L124 PetriNetUnfolderBase]: 768/1275 cut-off events. [2024-06-04 15:34:12,278 INFO L125 PetriNetUnfolderBase]: For 585/594 co-relation queries the response was YES. [2024-06-04 15:34:12,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3194 conditions, 1275 events. 768/1275 cut-off events. For 585/594 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5856 event pairs, 311 based on Foata normal form. 5/1239 useless extension candidates. Maximal degree in co-relation 3168. Up to 1215 conditions per place. [2024-06-04 15:34:12,284 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 37 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2024-06-04 15:34:12,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 443 flow [2024-06-04 15:34:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-04 15:34:12,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-04 15:34:12,289 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 307 flow. Second operand 5 states and 92 transitions. [2024-06-04 15:34:12,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 443 flow [2024-06-04 15:34:12,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 420 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:12,296 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 357 flow [2024-06-04 15:34:12,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-04 15:34:12,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-04 15:34:12,298 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 357 flow [2024-06-04 15:34:12,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:12,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:12,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:34:12,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:12,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1177020673, now seen corresponding path program 1 times [2024-06-04 15:34:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:12,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140072711] [2024-06-04 15:34:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140072711] [2024-06-04 15:34:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140072711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:14,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856396909] [2024-06-04 15:34:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:14,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:14,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:14,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 357 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:14,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:14,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:15,241 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-04 15:34:15,241 INFO L125 PetriNetUnfolderBase]: For 766/789 co-relation queries the response was YES. [2024-06-04 15:34:15,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3649 conditions, 1366 events. 873/1366 cut-off events. For 766/789 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5969 event pairs, 295 based on Foata normal form. 4/1366 useless extension candidates. Maximal degree in co-relation 3619. Up to 1301 conditions per place. [2024-06-04 15:34:15,248 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 44 selfloop transitions, 19 changer transitions 0/69 dead transitions. [2024-06-04 15:34:15,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 525 flow [2024-06-04 15:34:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 15:34:15,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 15:34:15,250 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 357 flow. Second operand 6 states and 100 transitions. [2024-06-04 15:34:15,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 525 flow [2024-06-04 15:34:15,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:15,253 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 395 flow [2024-06-04 15:34:15,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-04 15:34:15,255 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-04 15:34:15,255 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 395 flow [2024-06-04 15:34:15,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:15,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:15,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:15,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:34:15,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:15,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1187745433, now seen corresponding path program 2 times [2024-06-04 15:34:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179471065] [2024-06-04 15:34:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179471065] [2024-06-04 15:34:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179471065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:17,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406902399] [2024-06-04 15:34:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:17,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:17,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:17,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:17,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:17,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:17,896 INFO L124 PetriNetUnfolderBase]: 874/1369 cut-off events. [2024-06-04 15:34:17,897 INFO L125 PetriNetUnfolderBase]: For 912/938 co-relation queries the response was YES. [2024-06-04 15:34:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3680 conditions, 1369 events. 874/1369 cut-off events. For 912/938 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5986 event pairs, 293 based on Foata normal form. 6/1373 useless extension candidates. Maximal degree in co-relation 3649. Up to 1305 conditions per place. [2024-06-04 15:34:17,903 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 51 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-04 15:34:17,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 583 flow [2024-06-04 15:34:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 15:34:17,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 15:34:17,905 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 395 flow. Second operand 6 states and 106 transitions. [2024-06-04 15:34:17,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 583 flow [2024-06-04 15:34:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 544 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:17,908 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 402 flow [2024-06-04 15:34:17,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-06-04 15:34:17,909 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-04 15:34:17,909 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 402 flow [2024-06-04 15:34:17,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:17,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:17,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:17,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:34:17,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:17,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1188133243, now seen corresponding path program 3 times [2024-06-04 15:34:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969647915] [2024-06-04 15:34:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969647915] [2024-06-04 15:34:19,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969647915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:19,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:19,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:34:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649346808] [2024-06-04 15:34:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:34:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:34:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:34:20,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:20,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 402 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:20,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:20,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:20,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:20,515 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-04 15:34:20,515 INFO L125 PetriNetUnfolderBase]: For 914/940 co-relation queries the response was YES. [2024-06-04 15:34:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1366 events. 873/1366 cut-off events. For 914/940 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5986 event pairs, 186 based on Foata normal form. 6/1370 useless extension candidates. Maximal degree in co-relation 3637. Up to 1266 conditions per place. [2024-06-04 15:34:20,522 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 56 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-06-04 15:34:20,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 608 flow [2024-06-04 15:34:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 15:34:20,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-04 15:34:20,525 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 402 flow. Second operand 6 states and 110 transitions. [2024-06-04 15:34:20,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 608 flow [2024-06-04 15:34:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 556 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 15:34:20,528 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 394 flow [2024-06-04 15:34:20,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-06-04 15:34:20,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-04 15:34:20,530 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 394 flow [2024-06-04 15:34:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:20,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:20,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:20,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:34:20,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:20,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2106214085, now seen corresponding path program 1 times [2024-06-04 15:34:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628854528] [2024-06-04 15:34:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628854528] [2024-06-04 15:34:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628854528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:22,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:22,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:34:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463797896] [2024-06-04 15:34:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:22,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:34:22,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:34:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:34:22,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:22,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:22,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:22,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:22,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:22,929 INFO L124 PetriNetUnfolderBase]: 916/1434 cut-off events. [2024-06-04 15:34:22,929 INFO L125 PetriNetUnfolderBase]: For 1180/1187 co-relation queries the response was YES. [2024-06-04 15:34:22,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 1434 events. 916/1434 cut-off events. For 1180/1187 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6361 event pairs, 309 based on Foata normal form. 4/1410 useless extension candidates. Maximal degree in co-relation 3941. Up to 1372 conditions per place. [2024-06-04 15:34:22,938 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 18 changer transitions 0/77 dead transitions. [2024-06-04 15:34:22,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 607 flow [2024-06-04 15:34:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 15:34:22,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 15:34:22,940 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 394 flow. Second operand 6 states and 106 transitions. [2024-06-04 15:34:22,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 607 flow [2024-06-04 15:34:22,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 548 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 15:34:22,943 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 418 flow [2024-06-04 15:34:22,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-06-04 15:34:22,945 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-04 15:34:22,945 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 418 flow [2024-06-04 15:34:22,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:22,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:22,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:22,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:34:22,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:22,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2106207575, now seen corresponding path program 2 times [2024-06-04 15:34:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335003797] [2024-06-04 15:34:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335003797] [2024-06-04 15:34:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335003797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:34:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324822771] [2024-06-04 15:34:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:24,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:34:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:34:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:34:24,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:24,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 418 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:24,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:24,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:25,282 INFO L124 PetriNetUnfolderBase]: 914/1431 cut-off events. [2024-06-04 15:34:25,283 INFO L125 PetriNetUnfolderBase]: For 1247/1249 co-relation queries the response was YES. [2024-06-04 15:34:25,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 1431 events. 914/1431 cut-off events. For 1247/1249 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6330 event pairs, 311 based on Foata normal form. 0/1402 useless extension candidates. Maximal degree in co-relation 3983. Up to 1370 conditions per place. [2024-06-04 15:34:25,293 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 21 changer transitions 0/77 dead transitions. [2024-06-04 15:34:25,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 627 flow [2024-06-04 15:34:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 15:34:25,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 15:34:25,294 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 418 flow. Second operand 6 states and 100 transitions. [2024-06-04 15:34:25,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 627 flow [2024-06-04 15:34:25,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 599 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:25,297 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 513 flow [2024-06-04 15:34:25,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-06-04 15:34:25,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-04 15:34:25,299 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 513 flow [2024-06-04 15:34:25,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:25,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:25,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:34:25,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:25,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash -519341369, now seen corresponding path program 1 times [2024-06-04 15:34:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:25,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400479388] [2024-06-04 15:34:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400479388] [2024-06-04 15:34:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400479388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:34:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626949437] [2024-06-04 15:34:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:34:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:34:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:34:27,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:34:27,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 513 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:27,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:27,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:34:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:27,919 INFO L124 PetriNetUnfolderBase]: 829/1356 cut-off events. [2024-06-04 15:34:27,920 INFO L125 PetriNetUnfolderBase]: For 1346/1365 co-relation queries the response was YES. [2024-06-04 15:34:27,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 1356 events. 829/1356 cut-off events. For 1346/1365 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6124 event pairs, 306 based on Foata normal form. 14/1341 useless extension candidates. Maximal degree in co-relation 3863. Up to 1291 conditions per place. [2024-06-04 15:34:27,927 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 23 changer transitions 0/82 dead transitions. [2024-06-04 15:34:27,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 713 flow [2024-06-04 15:34:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:34:27,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:34:27,928 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 513 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:34:27,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 713 flow [2024-06-04 15:34:27,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 693 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:27,933 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 589 flow [2024-06-04 15:34:27,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2024-06-04 15:34:27,933 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2024-06-04 15:34:27,933 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 589 flow [2024-06-04 15:34:27,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:27,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:27,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:27,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:34:27,935 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:27,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -529725823, now seen corresponding path program 1 times [2024-06-04 15:34:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910715745] [2024-06-04 15:34:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910715745] [2024-06-04 15:34:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910715745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:34:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983112510] [2024-06-04 15:34:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:29,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:34:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:29,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:34:29,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:34:29,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-04 15:34:29,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:29,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:29,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-04 15:34:29,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:29,938 INFO L124 PetriNetUnfolderBase]: 1138/1827 cut-off events. [2024-06-04 15:34:29,938 INFO L125 PetriNetUnfolderBase]: For 2205/2265 co-relation queries the response was YES. [2024-06-04 15:34:29,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5155 conditions, 1827 events. 1138/1827 cut-off events. For 2205/2265 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8543 event pairs, 719 based on Foata normal form. 9/1820 useless extension candidates. Maximal degree in co-relation 5119. Up to 1743 conditions per place. [2024-06-04 15:34:29,948 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 52 selfloop transitions, 20 changer transitions 0/86 dead transitions. [2024-06-04 15:34:29,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 804 flow [2024-06-04 15:34:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:34:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:34:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-04 15:34:29,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-04 15:34:29,951 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 589 flow. Second operand 5 states and 93 transitions. [2024-06-04 15:34:29,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 804 flow [2024-06-04 15:34:29,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 742 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:29,955 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 654 flow [2024-06-04 15:34:29,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=654, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-06-04 15:34:29,955 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-04 15:34:29,955 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 654 flow [2024-06-04 15:34:29,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:29,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:29,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:34:29,956 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:29,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -518995409, now seen corresponding path program 2 times [2024-06-04 15:34:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858529903] [2024-06-04 15:34:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858529903] [2024-06-04 15:34:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858529903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:34:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174241575] [2024-06-04 15:34:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:31,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:34:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:34:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:34:31,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:34:31,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 654 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:31,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:34:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:32,328 INFO L124 PetriNetUnfolderBase]: 835/1391 cut-off events. [2024-06-04 15:34:32,328 INFO L125 PetriNetUnfolderBase]: For 2016/2040 co-relation queries the response was YES. [2024-06-04 15:34:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1391 events. 835/1391 cut-off events. For 2016/2040 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6542 event pairs, 461 based on Foata normal form. 11/1377 useless extension candidates. Maximal degree in co-relation 4388. Up to 1297 conditions per place. [2024-06-04 15:34:32,335 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-04 15:34:32,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 850 flow [2024-06-04 15:34:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:34:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:34:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-04 15:34:32,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-04 15:34:32,337 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 654 flow. Second operand 6 states and 104 transitions. [2024-06-04 15:34:32,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 850 flow [2024-06-04 15:34:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:32,341 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 730 flow [2024-06-04 15:34:32,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2024-06-04 15:34:32,341 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2024-06-04 15:34:32,341 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 730 flow [2024-06-04 15:34:32,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:32,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:32,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:32,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:34:32,342 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:32,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -518983319, now seen corresponding path program 3 times [2024-06-04 15:34:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649729952] [2024-06-04 15:34:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:33,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:33,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649729952] [2024-06-04 15:34:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649729952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:33,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:34:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890620678] [2024-06-04 15:34:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:33,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:34:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:34:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:34:34,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:34:34,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 730 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:34,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:34,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:34:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:34,699 INFO L124 PetriNetUnfolderBase]: 835/1386 cut-off events. [2024-06-04 15:34:34,700 INFO L125 PetriNetUnfolderBase]: For 2721/2745 co-relation queries the response was YES. [2024-06-04 15:34:34,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 1386 events. 835/1386 cut-off events. For 2721/2745 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6508 event pairs, 433 based on Foata normal form. 11/1374 useless extension candidates. Maximal degree in co-relation 4638. Up to 1279 conditions per place. [2024-06-04 15:34:34,709 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-04 15:34:34,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 105 transitions, 1050 flow [2024-06-04 15:34:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-04 15:34:34,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-04 15:34:34,710 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 730 flow. Second operand 7 states and 121 transitions. [2024-06-04 15:34:34,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 105 transitions, 1050 flow [2024-06-04 15:34:34,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 958 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:34,715 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 835 flow [2024-06-04 15:34:34,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=835, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2024-06-04 15:34:34,716 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-04 15:34:34,716 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 835 flow [2024-06-04 15:34:34,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:34,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:34,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:34,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:34:34,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:34,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1091400830, now seen corresponding path program 1 times [2024-06-04 15:34:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:34,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819249011] [2024-06-04 15:34:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819249011] [2024-06-04 15:34:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819249011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:37,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:37,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288784128] [2024-06-04 15:34:37,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:37,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:37,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:37,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:37,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:34:37,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 835 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:34:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:38,139 INFO L124 PetriNetUnfolderBase]: 832/1383 cut-off events. [2024-06-04 15:34:38,140 INFO L125 PetriNetUnfolderBase]: For 3389/3419 co-relation queries the response was YES. [2024-06-04 15:34:38,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 1383 events. 832/1383 cut-off events. For 3389/3419 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6500 event pairs, 409 based on Foata normal form. 17/1400 useless extension candidates. Maximal degree in co-relation 4791. Up to 1248 conditions per place. [2024-06-04 15:34:38,148 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 42 changer transitions 0/114 dead transitions. [2024-06-04 15:34:38,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 114 transitions, 1143 flow [2024-06-04 15:34:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:34:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:34:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 15:34:38,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-04 15:34:38,149 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 835 flow. Second operand 8 states and 137 transitions. [2024-06-04 15:34:38,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 114 transitions, 1143 flow [2024-06-04 15:34:38,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 1061 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:38,178 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 926 flow [2024-06-04 15:34:38,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=926, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2024-06-04 15:34:38,179 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-04 15:34:38,179 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 926 flow [2024-06-04 15:34:38,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:38,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:38,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:34:38,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:38,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1142420838, now seen corresponding path program 1 times [2024-06-04 15:34:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334293781] [2024-06-04 15:34:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334293781] [2024-06-04 15:34:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334293781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100395855] [2024-06-04 15:34:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:40,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:40,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:40,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 926 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:40,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:40,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:40,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:41,153 INFO L124 PetriNetUnfolderBase]: 933/1482 cut-off events. [2024-06-04 15:34:41,153 INFO L125 PetriNetUnfolderBase]: For 4038/4050 co-relation queries the response was YES. [2024-06-04 15:34:41,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 1482 events. 933/1482 cut-off events. For 4038/4050 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6834 event pairs, 315 based on Foata normal form. 7/1489 useless extension candidates. Maximal degree in co-relation 5325. Up to 1354 conditions per place. [2024-06-04 15:34:41,166 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 91 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2024-06-04 15:34:41,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 122 transitions, 1260 flow [2024-06-04 15:34:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 15:34:41,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-04 15:34:41,168 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 926 flow. Second operand 7 states and 122 transitions. [2024-06-04 15:34:41,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 122 transitions, 1260 flow [2024-06-04 15:34:41,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 122 transitions, 1191 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:41,176 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 956 flow [2024-06-04 15:34:41,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=956, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2024-06-04 15:34:41,192 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-04 15:34:41,192 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 956 flow [2024-06-04 15:34:41,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:41,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:41,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:41,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:34:41,193 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:41,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1142181828, now seen corresponding path program 2 times [2024-06-04 15:34:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:41,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280855876] [2024-06-04 15:34:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280855876] [2024-06-04 15:34:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280855876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657768607] [2024-06-04 15:34:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:43,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:43,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:43,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 956 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:43,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:43,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:43,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:44,150 INFO L124 PetriNetUnfolderBase]: 936/1485 cut-off events. [2024-06-04 15:34:44,151 INFO L125 PetriNetUnfolderBase]: For 4560/4572 co-relation queries the response was YES. [2024-06-04 15:34:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1485 events. 936/1485 cut-off events. For 4560/4572 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6850 event pairs, 403 based on Foata normal form. 7/1492 useless extension candidates. Maximal degree in co-relation 5435. Up to 1402 conditions per place. [2024-06-04 15:34:44,159 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 89 selfloop transitions, 25 changer transitions 0/119 dead transitions. [2024-06-04 15:34:44,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 1239 flow [2024-06-04 15:34:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:34:44,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:34:44,162 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 956 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:34:44,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 1239 flow [2024-06-04 15:34:44,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 1179 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 15:34:44,170 INFO L231 Difference]: Finished difference. Result has 104 places, 111 transitions, 978 flow [2024-06-04 15:34:44,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=978, PETRI_PLACES=104, PETRI_TRANSITIONS=111} [2024-06-04 15:34:44,171 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-04 15:34:44,171 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 111 transitions, 978 flow [2024-06-04 15:34:44,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:44,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:44,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:44,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:34:44,172 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:44,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1142501934, now seen corresponding path program 1 times [2024-06-04 15:34:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:44,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778741289] [2024-06-04 15:34:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:45,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778741289] [2024-06-04 15:34:45,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778741289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052649221] [2024-06-04 15:34:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:45,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:45,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 111 transitions, 978 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:45,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:45,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:46,927 INFO L124 PetriNetUnfolderBase]: 942/1497 cut-off events. [2024-06-04 15:34:46,927 INFO L125 PetriNetUnfolderBase]: For 4989/5019 co-relation queries the response was YES. [2024-06-04 15:34:46,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1497 events. 942/1497 cut-off events. For 4989/5019 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6974 event pairs, 409 based on Foata normal form. 16/1513 useless extension candidates. Maximal degree in co-relation 5522. Up to 1367 conditions per place. [2024-06-04 15:34:46,935 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 39 changer transitions 0/130 dead transitions. [2024-06-04 15:34:46,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 1394 flow [2024-06-04 15:34:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 15:34:46,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-04 15:34:46,961 INFO L175 Difference]: Start difference. First operand has 104 places, 111 transitions, 978 flow. Second operand 7 states and 122 transitions. [2024-06-04 15:34:46,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 1394 flow [2024-06-04 15:34:46,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 130 transitions, 1333 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 15:34:46,973 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1128 flow [2024-06-04 15:34:46,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1128, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-04 15:34:46,973 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-04 15:34:46,974 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1128 flow [2024-06-04 15:34:46,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:46,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:46,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:46,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 15:34:46,976 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:46,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1142513094, now seen corresponding path program 2 times [2024-06-04 15:34:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:46,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527338924] [2024-06-04 15:34:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:48,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527338924] [2024-06-04 15:34:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527338924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755514287] [2024-06-04 15:34:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:48,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:48,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1128 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:48,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:48,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:48,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:49,848 INFO L124 PetriNetUnfolderBase]: 957/1523 cut-off events. [2024-06-04 15:34:49,848 INFO L125 PetriNetUnfolderBase]: For 6433/6463 co-relation queries the response was YES. [2024-06-04 15:34:49,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6034 conditions, 1523 events. 957/1523 cut-off events. For 6433/6463 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7136 event pairs, 408 based on Foata normal form. 16/1539 useless extension candidates. Maximal degree in co-relation 5982. Up to 1383 conditions per place. [2024-06-04 15:34:49,856 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 43 changer transitions 0/140 dead transitions. [2024-06-04 15:34:49,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 140 transitions, 1599 flow [2024-06-04 15:34:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-04 15:34:49,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-04 15:34:49,879 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1128 flow. Second operand 7 states and 125 transitions. [2024-06-04 15:34:49,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 140 transitions, 1599 flow [2024-06-04 15:34:49,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 140 transitions, 1511 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-04 15:34:49,890 INFO L231 Difference]: Finished difference. Result has 114 places, 128 transitions, 1227 flow [2024-06-04 15:34:49,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1227, PETRI_PLACES=114, PETRI_TRANSITIONS=128} [2024-06-04 15:34:49,890 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-04 15:34:49,891 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 128 transitions, 1227 flow [2024-06-04 15:34:49,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:49,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:49,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:49,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 15:34:49,891 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:49,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1135925718, now seen corresponding path program 3 times [2024-06-04 15:34:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593315709] [2024-06-04 15:34:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:51,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:51,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593315709] [2024-06-04 15:34:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593315709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:51,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031129659] [2024-06-04 15:34:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:51,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:51,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:51,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:51,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:51,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 128 transitions, 1227 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:51,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:51,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:51,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:52,658 INFO L124 PetriNetUnfolderBase]: 954/1515 cut-off events. [2024-06-04 15:34:52,659 INFO L125 PetriNetUnfolderBase]: For 6352/6358 co-relation queries the response was YES. [2024-06-04 15:34:52,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5979 conditions, 1515 events. 954/1515 cut-off events. For 6352/6358 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7028 event pairs, 400 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 5924. Up to 1428 conditions per place. [2024-06-04 15:34:52,667 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 108 selfloop transitions, 24 changer transitions 0/137 dead transitions. [2024-06-04 15:34:52,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1549 flow [2024-06-04 15:34:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-04 15:34:52,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 15:34:52,669 INFO L175 Difference]: Start difference. First operand has 114 places, 128 transitions, 1227 flow. Second operand 7 states and 112 transitions. [2024-06-04 15:34:52,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1549 flow [2024-06-04 15:34:52,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 1479 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 15:34:52,678 INFO L231 Difference]: Finished difference. Result has 118 places, 130 transitions, 1244 flow [2024-06-04 15:34:52,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1244, PETRI_PLACES=118, PETRI_TRANSITIONS=130} [2024-06-04 15:34:52,679 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-04 15:34:52,679 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 130 transitions, 1244 flow [2024-06-04 15:34:52,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:52,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:52,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:52,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 15:34:52,679 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:52,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1136048664, now seen corresponding path program 3 times [2024-06-04 15:34:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511621566] [2024-06-04 15:34:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511621566] [2024-06-04 15:34:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511621566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061300077] [2024-06-04 15:34:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:54,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:54,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 130 transitions, 1244 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:54,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:54,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:55,585 INFO L124 PetriNetUnfolderBase]: 956/1517 cut-off events. [2024-06-04 15:34:55,585 INFO L125 PetriNetUnfolderBase]: For 6933/6969 co-relation queries the response was YES. [2024-06-04 15:34:55,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 1517 events. 956/1517 cut-off events. For 6933/6969 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7081 event pairs, 409 based on Foata normal form. 22/1539 useless extension candidates. Maximal degree in co-relation 5953. Up to 1425 conditions per place. [2024-06-04 15:34:55,594 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 105 selfloop transitions, 28 changer transitions 0/138 dead transitions. [2024-06-04 15:34:55,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 1568 flow [2024-06-04 15:34:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 15:34:55,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-04 15:34:55,595 INFO L175 Difference]: Start difference. First operand has 118 places, 130 transitions, 1244 flow. Second operand 7 states and 113 transitions. [2024-06-04 15:34:55,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 1568 flow [2024-06-04 15:34:55,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 138 transitions, 1501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 15:34:55,605 INFO L231 Difference]: Finished difference. Result has 120 places, 133 transitions, 1283 flow [2024-06-04 15:34:55,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1283, PETRI_PLACES=120, PETRI_TRANSITIONS=133} [2024-06-04 15:34:55,606 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-04 15:34:55,606 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 133 transitions, 1283 flow [2024-06-04 15:34:55,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:55,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:55,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:55,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 15:34:55,607 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:55,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1135928694, now seen corresponding path program 4 times [2024-06-04 15:34:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082501617] [2024-06-04 15:34:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:34:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:34:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:34:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082501617] [2024-06-04 15:34:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082501617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:34:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:34:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:34:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061875084] [2024-06-04 15:34:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:34:57,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:34:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:34:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:34:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:34:57,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:34:57,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 133 transitions, 1283 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:57,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:34:57,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:34:57,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:34:58,358 INFO L124 PetriNetUnfolderBase]: 954/1520 cut-off events. [2024-06-04 15:34:58,359 INFO L125 PetriNetUnfolderBase]: For 7185/7209 co-relation queries the response was YES. [2024-06-04 15:34:58,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 1520 events. 954/1520 cut-off events. For 7185/7209 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7100 event pairs, 409 based on Foata normal form. 11/1530 useless extension candidates. Maximal degree in co-relation 5980. Up to 1378 conditions per place. [2024-06-04 15:34:58,367 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 55 changer transitions 0/146 dead transitions. [2024-06-04 15:34:58,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 1725 flow [2024-06-04 15:34:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:34:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:34:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:34:58,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:34:58,368 INFO L175 Difference]: Start difference. First operand has 120 places, 133 transitions, 1283 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:34:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 1725 flow [2024-06-04 15:34:58,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 146 transitions, 1649 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 15:34:58,383 INFO L231 Difference]: Finished difference. Result has 122 places, 139 transitions, 1409 flow [2024-06-04 15:34:58,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1409, PETRI_PLACES=122, PETRI_TRANSITIONS=139} [2024-06-04 15:34:58,384 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2024-06-04 15:34:58,384 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 139 transitions, 1409 flow [2024-06-04 15:34:58,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:34:58,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:34:58,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:34:58,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 15:34:58,385 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:34:58,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:34:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1146225654, now seen corresponding path program 5 times [2024-06-04 15:34:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:34:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808211999] [2024-06-04 15:34:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:34:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:34:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808211999] [2024-06-04 15:35:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808211999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:35:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989264180] [2024-06-04 15:35:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:00,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:35:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:35:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:35:00,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:35:00,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 1409 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:00,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:00,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:35:00,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:01,373 INFO L124 PetriNetUnfolderBase]: 952/1515 cut-off events. [2024-06-04 15:35:01,373 INFO L125 PetriNetUnfolderBase]: For 7676/7706 co-relation queries the response was YES. [2024-06-04 15:35:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6079 conditions, 1515 events. 952/1515 cut-off events. For 7676/7706 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7080 event pairs, 406 based on Foata normal form. 16/1531 useless extension candidates. Maximal degree in co-relation 6021. Up to 1388 conditions per place. [2024-06-04 15:35:01,381 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 50 changer transitions 0/147 dead transitions. [2024-06-04 15:35:01,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 147 transitions, 1751 flow [2024-06-04 15:35:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:35:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:35:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 15:35:01,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-04 15:35:01,383 INFO L175 Difference]: Start difference. First operand has 122 places, 139 transitions, 1409 flow. Second operand 8 states and 134 transitions. [2024-06-04 15:35:01,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 147 transitions, 1751 flow [2024-06-04 15:35:01,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 1663 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-04 15:35:01,394 INFO L231 Difference]: Finished difference. Result has 127 places, 139 transitions, 1435 flow [2024-06-04 15:35:01,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1435, PETRI_PLACES=127, PETRI_TRANSITIONS=139} [2024-06-04 15:35:01,396 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-04 15:35:01,396 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 139 transitions, 1435 flow [2024-06-04 15:35:01,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:01,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:01,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:01,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 15:35:01,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:01,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1146232164, now seen corresponding path program 6 times [2024-06-04 15:35:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410515415] [2024-06-04 15:35:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410515415] [2024-06-04 15:35:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410515415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:35:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341048260] [2024-06-04 15:35:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:03,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:35:03,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:35:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:35:03,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 15:35:03,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 139 transitions, 1435 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:03,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:03,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 15:35:03,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:04,015 INFO L124 PetriNetUnfolderBase]: 950/1512 cut-off events. [2024-06-04 15:35:04,015 INFO L125 PetriNetUnfolderBase]: For 7822/7852 co-relation queries the response was YES. [2024-06-04 15:35:04,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 1512 events. 950/1512 cut-off events. For 7822/7852 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7066 event pairs, 409 based on Foata normal form. 16/1528 useless extension candidates. Maximal degree in co-relation 6044. Up to 1386 conditions per place. [2024-06-04 15:35:04,024 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 98 selfloop transitions, 42 changer transitions 0/145 dead transitions. [2024-06-04 15:35:04,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1739 flow [2024-06-04 15:35:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:35:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:35:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 15:35:04,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 15:35:04,025 INFO L175 Difference]: Start difference. First operand has 127 places, 139 transitions, 1435 flow. Second operand 6 states and 108 transitions. [2024-06-04 15:35:04,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1739 flow [2024-06-04 15:35:04,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 145 transitions, 1601 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 15:35:04,035 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 1391 flow [2024-06-04 15:35:04,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1391, PETRI_PLACES=125, PETRI_TRANSITIONS=139} [2024-06-04 15:35:04,035 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-04 15:35:04,035 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 1391 flow [2024-06-04 15:35:04,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:04,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:04,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:04,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 15:35:04,036 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:04,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -870800762, now seen corresponding path program 1 times [2024-06-04 15:35:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343441236] [2024-06-04 15:35:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343441236] [2024-06-04 15:35:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343441236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:35:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960099201] [2024-06-04 15:35:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:05,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:35:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:35:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:35:06,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:35:06,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 1391 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:06,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:06,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:35:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:06,742 INFO L124 PetriNetUnfolderBase]: 856/1420 cut-off events. [2024-06-04 15:35:06,743 INFO L125 PetriNetUnfolderBase]: For 8682/8712 co-relation queries the response was YES. [2024-06-04 15:35:06,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 1420 events. 856/1420 cut-off events. For 8682/8712 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6673 event pairs, 401 based on Foata normal form. 19/1439 useless extension candidates. Maximal degree in co-relation 5802. Up to 1330 conditions per place. [2024-06-04 15:35:06,750 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 107 selfloop transitions, 31 changer transitions 0/145 dead transitions. [2024-06-04 15:35:06,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1718 flow [2024-06-04 15:35:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:35:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:35:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 15:35:06,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-04 15:35:06,752 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 1391 flow. Second operand 8 states and 130 transitions. [2024-06-04 15:35:06,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1718 flow [2024-06-04 15:35:06,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 1634 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-04 15:35:06,762 INFO L231 Difference]: Finished difference. Result has 128 places, 141 transitions, 1412 flow [2024-06-04 15:35:06,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=128, PETRI_TRANSITIONS=141} [2024-06-04 15:35:06,763 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-04 15:35:06,763 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 1412 flow [2024-06-04 15:35:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:06,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:06,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:06,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 15:35:06,764 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:06,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -538333202, now seen corresponding path program 2 times [2024-06-04 15:35:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024004430] [2024-06-04 15:35:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024004430] [2024-06-04 15:35:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024004430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:35:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607263623] [2024-06-04 15:35:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:08,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:35:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:35:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:35:09,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:35:09,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 1412 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:09,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:09,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:35:09,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:09,623 INFO L124 PetriNetUnfolderBase]: 860/1428 cut-off events. [2024-06-04 15:35:09,624 INFO L125 PetriNetUnfolderBase]: For 9660/9690 co-relation queries the response was YES. [2024-06-04 15:35:09,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 1428 events. 860/1428 cut-off events. For 9660/9690 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6712 event pairs, 401 based on Foata normal form. 19/1447 useless extension candidates. Maximal degree in co-relation 5979. Up to 1330 conditions per place. [2024-06-04 15:35:09,632 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 104 selfloop transitions, 36 changer transitions 0/147 dead transitions. [2024-06-04 15:35:09,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 147 transitions, 1747 flow [2024-06-04 15:35:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:35:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:35:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 15:35:09,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-04 15:35:09,634 INFO L175 Difference]: Start difference. First operand has 128 places, 141 transitions, 1412 flow. Second operand 7 states and 117 transitions. [2024-06-04 15:35:09,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 147 transitions, 1747 flow [2024-06-04 15:35:09,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 147 transitions, 1658 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 15:35:09,646 INFO L231 Difference]: Finished difference. Result has 129 places, 143 transitions, 1445 flow [2024-06-04 15:35:09,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1445, PETRI_PLACES=129, PETRI_TRANSITIONS=143} [2024-06-04 15:35:09,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-04 15:35:09,647 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 143 transitions, 1445 flow [2024-06-04 15:35:09,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:09,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:09,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:09,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 15:35:09,647 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:09,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash -526714712, now seen corresponding path program 3 times [2024-06-04 15:35:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:09,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128827657] [2024-06-04 15:35:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128827657] [2024-06-04 15:35:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128827657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:35:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567879093] [2024-06-04 15:35:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:11,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:35:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:11,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:35:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:35:11,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:35:11,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 1445 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:11,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:11,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:35:11,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:12,499 INFO L124 PetriNetUnfolderBase]: 864/1440 cut-off events. [2024-06-04 15:35:12,499 INFO L125 PetriNetUnfolderBase]: For 10765/10795 co-relation queries the response was YES. [2024-06-04 15:35:12,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6211 conditions, 1440 events. 864/1440 cut-off events. For 10765/10795 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6845 event pairs, 397 based on Foata normal form. 19/1459 useless extension candidates. Maximal degree in co-relation 6149. Up to 1324 conditions per place. [2024-06-04 15:35:12,508 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 112 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2024-06-04 15:35:12,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 1811 flow [2024-06-04 15:35:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:35:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:35:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 15:35:12,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-04 15:35:12,509 INFO L175 Difference]: Start difference. First operand has 129 places, 143 transitions, 1445 flow. Second operand 8 states and 133 transitions. [2024-06-04 15:35:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 1811 flow [2024-06-04 15:35:12,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 152 transitions, 1701 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-04 15:35:12,523 INFO L231 Difference]: Finished difference. Result has 132 places, 145 transitions, 1456 flow [2024-06-04 15:35:12,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=132, PETRI_TRANSITIONS=145} [2024-06-04 15:35:12,524 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-04 15:35:12,524 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 145 transitions, 1456 flow [2024-06-04 15:35:12,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:12,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:12,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:12,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 15:35:12,525 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:12,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -526311092, now seen corresponding path program 4 times [2024-06-04 15:35:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422139207] [2024-06-04 15:35:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422139207] [2024-06-04 15:35:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422139207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 15:35:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67806714] [2024-06-04 15:35:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:15,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 15:35:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 15:35:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 15:35:15,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:35:15,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 145 transitions, 1456 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:15,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:15,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:35:15,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:16,338 INFO L124 PetriNetUnfolderBase]: 868/1450 cut-off events. [2024-06-04 15:35:16,338 INFO L125 PetriNetUnfolderBase]: For 10772/10802 co-relation queries the response was YES. [2024-06-04 15:35:16,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1450 events. 868/1450 cut-off events. For 10772/10802 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6925 event pairs, 395 based on Foata normal form. 19/1469 useless extension candidates. Maximal degree in co-relation 6187. Up to 1302 conditions per place. [2024-06-04 15:35:16,347 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 46 changer transitions 0/156 dead transitions. [2024-06-04 15:35:16,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 156 transitions, 1834 flow [2024-06-04 15:35:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:35:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:35:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-04 15:35:16,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-04 15:35:16,349 INFO L175 Difference]: Start difference. First operand has 132 places, 145 transitions, 1456 flow. Second operand 9 states and 150 transitions. [2024-06-04 15:35:16,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 156 transitions, 1834 flow [2024-06-04 15:35:16,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 156 transitions, 1737 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 15:35:16,363 INFO L231 Difference]: Finished difference. Result has 135 places, 147 transitions, 1505 flow [2024-06-04 15:35:16,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=135, PETRI_TRANSITIONS=147} [2024-06-04 15:35:16,363 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-04 15:35:16,364 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 1505 flow [2024-06-04 15:35:16,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:16,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:16,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:16,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 15:35:16,364 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:16,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -526297142, now seen corresponding path program 5 times [2024-06-04 15:35:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629171317] [2024-06-04 15:35:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:35:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:35:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:35:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629171317] [2024-06-04 15:35:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629171317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:35:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:35:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 15:35:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446228869] [2024-06-04 15:35:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:35:18,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 15:35:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:35:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 15:35:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 15:35:18,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-04 15:35:18,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 1505 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:18,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:35:18,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-04 15:35:18,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:35:19,605 INFO L124 PetriNetUnfolderBase]: 864/1446 cut-off events. [2024-06-04 15:35:19,605 INFO L125 PetriNetUnfolderBase]: For 10762/10792 co-relation queries the response was YES. [2024-06-04 15:35:19,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6252 conditions, 1446 events. 864/1446 cut-off events. For 10762/10792 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6958 event pairs, 365 based on Foata normal form. 19/1465 useless extension candidates. Maximal degree in co-relation 6188. Up to 1236 conditions per place. [2024-06-04 15:35:19,614 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 111 selfloop transitions, 46 changer transitions 0/164 dead transitions. [2024-06-04 15:35:19,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 1953 flow [2024-06-04 15:35:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:35:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:35:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 15:35:19,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 15:35:19,615 INFO L175 Difference]: Start difference. First operand has 135 places, 147 transitions, 1505 flow. Second operand 8 states and 141 transitions. [2024-06-04 15:35:19,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 1953 flow [2024-06-04 15:35:19,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 164 transitions, 1821 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-04 15:35:19,632 INFO L231 Difference]: Finished difference. Result has 137 places, 152 transitions, 1577 flow [2024-06-04 15:35:19,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1577, PETRI_PLACES=137, PETRI_TRANSITIONS=152} [2024-06-04 15:35:19,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-04 15:35:19,633 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 152 transitions, 1577 flow [2024-06-04 15:35:19,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:35:19,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:35:19,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:35:19,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 15:35:19,633 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:35:19,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:35:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2034655328, now seen corresponding path program 1 times [2024-06-04 15:35:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:35:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877823595] [2024-06-04 15:35:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:35:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:35:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:35:19,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:35:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:35:19,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:35:19,702 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:35:19,703 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:35:19,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:35:19,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:35:19,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:35:19,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:35:19,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:35:19,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 15:35:19,706 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-06-04 15:35:19,709 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:35:19,709 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:35:19,731 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,736 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,736 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,736 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,736 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,737 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,737 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,737 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,738 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,738 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,739 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,740 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:35:19,747 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:35:19,754 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:35:19,754 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:35:19,755 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:35:19 BasicIcfg [2024-06-04 15:35:19,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:35:19,755 INFO L158 Benchmark]: Toolchain (without parser) took 81898.73ms. Allocated memory was 130.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 86.0MB in the beginning and 912.8MB in the end (delta: -826.8MB). Peak memory consumption was 402.9MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,755 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:35:19,755 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:35:19,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.77ms. Allocated memory is still 130.0MB. Free memory was 86.0MB in the beginning and 94.5MB in the end (delta: -8.4MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.47ms. Allocated memory is still 130.0MB. Free memory was 94.5MB in the beginning and 90.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,756 INFO L158 Benchmark]: Boogie Preprocessor took 47.40ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 86.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,756 INFO L158 Benchmark]: RCFGBuilder took 1040.24ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 86.1MB in the beginning and 77.3MB in the end (delta: 8.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,756 INFO L158 Benchmark]: TraceAbstraction took 80133.11ms. Allocated memory was 184.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.2MB in the beginning and 912.8MB in the end (delta: -836.6MB). Peak memory consumption was 337.8MB. Max. memory is 16.1GB. [2024-06-04 15:35:19,757 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.77ms. Allocated memory is still 130.0MB. Free memory was 86.0MB in the beginning and 94.5MB in the end (delta: -8.4MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.47ms. Allocated memory is still 130.0MB. Free memory was 94.5MB in the beginning and 90.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.40ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 86.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1040.24ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 86.1MB in the beginning and 77.3MB in the end (delta: 8.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * TraceAbstraction took 80133.11ms. Allocated memory was 184.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.2MB in the beginning and 912.8MB in the end (delta: -836.6MB). Peak memory consumption was 337.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 856]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L851] 0 //@ ghost multithreaded = 1; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t1941; [L853] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-1, t1941=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 y [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L853] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 pthread_t t1942; [L855] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-1, t1941=0, t1942=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 y [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L855] 0 __unbuffered_p2_EAX$read_delayed_var [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L856] 0 //@ assert ((((((((((((((((((((((((((((((((((!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (y$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (((0 <= z) && (z <= 1)) && ((z == 0) || (z == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &y)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1940=-1, t1941=0, t1942=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] - UnprovableResult [Line: 853]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 79.9s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1525 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1267 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6488 IncrementalHoareTripleChecker+Invalid, 6678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 111 mSDtfsCounter, 6488 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1577occurred in iteration=29, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.5s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 39133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-04 15:35:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE