./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/safe015_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i ./goblint.2024-05-07_14-17-48.files/protection/safe015_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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:38:31,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:38:31,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:38:31,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:38:31,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:38:31,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:38:31,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:38:31,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:38:31,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:38:31,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:38:31,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:38:31,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:38:31,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:38:31,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:38:31,677 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:38:31,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:38:31,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:38:31,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:38:31,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:38:31,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:38:31,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:38:31,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:38:31,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:38:31,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:38:31,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:38:31,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:38:31,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:38:31,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:38:31,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:38:31,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:38:31,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:38:31,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:38:31,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:38:31,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:38:31,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:38:31,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:38:31,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:38:31,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:38:31,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:38:31,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:38:31,694 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:38:31,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:38:31,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:38:31,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 13:38:31,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:38:31,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:38:31,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:38:31,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:38:31,910 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:38:31,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2024-05-12 13:38:32,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:38:33,197 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:38:33,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2024-05-12 13:38:33,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df50225a/0afea0c9daba483c866fc305de786a94/FLAGd9f640bd0 [2024-05-12 13:38:33,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df50225a/0afea0c9daba483c866fc305de786a94 [2024-05-12 13:38:33,222 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:38:33,223 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:38:33,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/safe015_power.opt.yml/witness.yml [2024-05-12 13:38:33,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:38:33,391 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:38:33,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:38:33,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:38:33,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:38:33,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:38:33" (1/2) ... [2024-05-12 13:38:33,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc67b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:38:33, skipping insertion in model container [2024-05-12 13:38:33,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:38:33" (1/2) ... [2024-05-12 13:38:33,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e69615e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:38:33, skipping insertion in model container [2024-05-12 13:38:33,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:38:33" (2/2) ... [2024-05-12 13:38:33,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc67b0d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:33, skipping insertion in model container [2024-05-12 13:38:33,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:38:33" (2/2) ... [2024-05-12 13:38:33,399 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:38:33,525 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:38:33,526 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-05-12 13:38:33,526 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-05-12 13:38:33,526 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2))) [2024-05-12 13:38:33,527 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:38:33,527 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-05-12 13:38:33,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:38:33,736 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i[994,1007] [2024-05-12 13:38:33,908 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:38:33,924 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:38:33,950 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i[994,1007] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:38:34,026 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:38:34,053 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:38:34,053 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34 WrapperNode [2024-05-12 13:38:34,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:38:34,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:38:34,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:38:34,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:38:34,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,099 INFO L138 Inliner]: procedures = 176, calls = 122, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 282 [2024-05-12 13:38:34,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:38:34,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:38:34,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:38:34,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:38:34,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,147 INFO L175 MemorySlicer]: Split 71 memory accesses to 5 slices as follows [2, 66, 1, 1, 1]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 14 writes are split as follows [0, 11, 1, 1, 1]. [2024-05-12 13:38:34,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:38:34,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:38:34,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:38:34,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:38:34,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (1/1) ... [2024-05-12 13:38:34,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:38:34,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:38:34,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 13:38:34,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 13:38:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:38:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:38:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:38:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:38:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 13:38:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:38:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:38:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:38:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:38:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:38:34,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:38:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:38:34,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:38:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 13:38:34,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 13:38:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:38:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:38:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:38:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:38:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 13:38:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:38:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:38:34,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:38:34,253 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:38:34,411 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:38:34,413 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:38:34,926 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:38:34,927 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:38:35,406 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:38:35,406 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:38:35,407 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:38:35 BoogieIcfgContainer [2024-05-12 13:38:35,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:38:35,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:38:35,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:38:35,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:38:35,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:38:33" (1/4) ... [2024-05-12 13:38:35,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c4a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:38:35, skipping insertion in model container [2024-05-12 13:38:35,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:38:33" (2/4) ... [2024-05-12 13:38:35,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c4a1b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:38:35, skipping insertion in model container [2024-05-12 13:38:35,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:38:34" (3/4) ... [2024-05-12 13:38:35,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c4a1b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:38:35, skipping insertion in model container [2024-05-12 13:38:35,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:38:35" (4/4) ... [2024-05-12 13:38:35,414 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2024-05-12 13:38:35,427 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:38:35,427 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:38:35,428 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:38:35,483 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:38:35,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:38:35,577 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 13:38:35,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:38:35,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 13:38:35,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:38:35,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 41 transitions, 91 flow [2024-05-12 13:38:35,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:38:35,637 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;@4a2503b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:38:35,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:38:35,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:38:35,659 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:38:35,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:38:35,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:35,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:38:35,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:35,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash -46860139, now seen corresponding path program 1 times [2024-05-12 13:38:35,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:35,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899286049] [2024-05-12 13:38:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:35,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899286049] [2024-05-12 13:38:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899286049] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:38,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:38:38,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87043422] [2024-05-12 13:38:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:38,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:38:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:38:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:38:38,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:38,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:38,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:38,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:38,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:39,624 INFO L124 PetriNetUnfolderBase]: 3535/5476 cut-off events. [2024-05-12 13:38:39,624 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-05-12 13:38:39,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10640 conditions, 5476 events. 3535/5476 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31557 event pairs, 2200 based on Foata normal form. 0/5470 useless extension candidates. Maximal degree in co-relation 10625. Up to 5073 conditions per place. [2024-05-12 13:38:39,651 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 40 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-05-12 13:38:39,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 225 flow [2024-05-12 13:38:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:38:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:38:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-05-12 13:38:39,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2024-05-12 13:38:39,662 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 91 flow. Second operand 4 states and 101 transitions. [2024-05-12 13:38:39,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 225 flow [2024-05-12 13:38:39,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 13:38:39,667 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 142 flow [2024-05-12 13:38:39,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-05-12 13:38:39,671 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-05-12 13:38:39,671 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 142 flow [2024-05-12 13:38:39,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:39,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:39,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:39,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:38:39,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:39,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2082874444, now seen corresponding path program 1 times [2024-05-12 13:38:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:39,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710853559] [2024-05-12 13:38:39,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710853559] [2024-05-12 13:38:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710853559] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:41,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:38:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087138792] [2024-05-12 13:38:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:38:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:38:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:38:41,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:41,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:38:41,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:41,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:41,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:42,885 INFO L124 PetriNetUnfolderBase]: 3537/5470 cut-off events. [2024-05-12 13:38:42,885 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2024-05-12 13:38:42,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 5470 events. 3537/5470 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31787 event pairs, 1528 based on Foata normal form. 0/5462 useless extension candidates. Maximal degree in co-relation 11653. Up to 5025 conditions per place. [2024-05-12 13:38:42,910 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 45 selfloop transitions, 16 changer transitions 0/70 dead transitions. [2024-05-12 13:38:42,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 326 flow [2024-05-12 13:38:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:38:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:38:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-05-12 13:38:42,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191489361702127 [2024-05-12 13:38:42,913 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 142 flow. Second operand 5 states and 122 transitions. [2024-05-12 13:38:42,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 326 flow [2024-05-12 13:38:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 326 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 13:38:42,914 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 234 flow [2024-05-12 13:38:42,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-05-12 13:38:42,915 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-05-12 13:38:42,915 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 234 flow [2024-05-12 13:38:42,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:38:42,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:42,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:42,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:38:42,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:42,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2082486634, now seen corresponding path program 2 times [2024-05-12 13:38:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873648340] [2024-05-12 13:38:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873648340] [2024-05-12 13:38:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873648340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:38:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045749940] [2024-05-12 13:38:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:44,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:38:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:44,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:38:44,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:38:44,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:44,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:38:44,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:44,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:44,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:46,051 INFO L124 PetriNetUnfolderBase]: 3535/5477 cut-off events. [2024-05-12 13:38:46,052 INFO L125 PetriNetUnfolderBase]: For 2197/2197 co-relation queries the response was YES. [2024-05-12 13:38:46,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12739 conditions, 5477 events. 3535/5477 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31669 event pairs, 1669 based on Foata normal form. 2/5478 useless extension candidates. Maximal degree in co-relation 12719. Up to 5024 conditions per place. [2024-05-12 13:38:46,077 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 54 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-05-12 13:38:46,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 418 flow [2024-05-12 13:38:46,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:38:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:38:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-05-12 13:38:46,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5617021276595745 [2024-05-12 13:38:46,080 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 234 flow. Second operand 5 states and 132 transitions. [2024-05-12 13:38:46,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 418 flow [2024-05-12 13:38:46,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 408 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 13:38:46,101 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 257 flow [2024-05-12 13:38:46,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-05-12 13:38:46,102 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-05-12 13:38:46,102 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 257 flow [2024-05-12 13:38:46,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:38:46,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:46,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:38:46,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:46,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash -144992126, now seen corresponding path program 1 times [2024-05-12 13:38:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592144631] [2024-05-12 13:38:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592144631] [2024-05-12 13:38:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592144631] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:38:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393355732] [2024-05-12 13:38:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:47,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:38:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:38:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:38:47,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:47,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:47,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:47,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:47,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:48,741 INFO L124 PetriNetUnfolderBase]: 3587/5556 cut-off events. [2024-05-12 13:38:48,741 INFO L125 PetriNetUnfolderBase]: For 1388/1390 co-relation queries the response was YES. [2024-05-12 13:38:48,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 5556 events. 3587/5556 cut-off events. For 1388/1390 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32172 event pairs, 2030 based on Foata normal form. 0/5525 useless extension candidates. Maximal degree in co-relation 12354. Up to 5152 conditions per place. [2024-05-12 13:38:48,766 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 50 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2024-05-12 13:38:48,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 436 flow [2024-05-12 13:38:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:38:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:38:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 13:38:48,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2024-05-12 13:38:48,770 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 257 flow. Second operand 6 states and 134 transitions. [2024-05-12 13:38:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 436 flow [2024-05-12 13:38:48,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 392 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 13:38:48,774 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 298 flow [2024-05-12 13:38:48,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-05-12 13:38:48,775 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-05-12 13:38:48,775 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 298 flow [2024-05-12 13:38:48,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:48,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:48,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:48,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:38:48,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:48,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1043693169, now seen corresponding path program 1 times [2024-05-12 13:38:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505974503] [2024-05-12 13:38:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505974503] [2024-05-12 13:38:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505974503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:50,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:50,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:38:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361672407] [2024-05-12 13:38:50,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:50,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:38:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:38:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:38:50,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:51,903 INFO L124 PetriNetUnfolderBase]: 3603/5582 cut-off events. [2024-05-12 13:38:51,904 INFO L125 PetriNetUnfolderBase]: For 2259/2261 co-relation queries the response was YES. [2024-05-12 13:38:51,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13068 conditions, 5582 events. 3603/5582 cut-off events. For 2259/2261 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32319 event pairs, 1695 based on Foata normal form. 8/5588 useless extension candidates. Maximal degree in co-relation 13042. Up to 5118 conditions per place. [2024-05-12 13:38:51,945 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 60 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2024-05-12 13:38:51,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 552 flow [2024-05-12 13:38:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:38:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:38:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 13:38:51,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-05-12 13:38:51,948 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 298 flow. Second operand 7 states and 167 transitions. [2024-05-12 13:38:51,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 552 flow [2024-05-12 13:38:51,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 548 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 13:38:51,955 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 410 flow [2024-05-12 13:38:51,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-05-12 13:38:51,959 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-05-12 13:38:51,959 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 410 flow [2024-05-12 13:38:51,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:51,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:51,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:51,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:38:51,960 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:51,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1898409439, now seen corresponding path program 2 times [2024-05-12 13:38:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385763546] [2024-05-12 13:38:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385763546] [2024-05-12 13:38:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385763546] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:38:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173642768] [2024-05-12 13:38:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:53,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:38:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:38:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:38:53,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:53,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:53,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:53,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:55,300 INFO L124 PetriNetUnfolderBase]: 3611/5589 cut-off events. [2024-05-12 13:38:55,300 INFO L125 PetriNetUnfolderBase]: For 4198/4200 co-relation queries the response was YES. [2024-05-12 13:38:55,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 5589 events. 3611/5589 cut-off events. For 4198/4200 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32523 event pairs, 1552 based on Foata normal form. 8/5592 useless extension candidates. Maximal degree in co-relation 14256. Up to 5121 conditions per place. [2024-05-12 13:38:55,354 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 51 selfloop transitions, 33 changer transitions 0/93 dead transitions. [2024-05-12 13:38:55,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 666 flow [2024-05-12 13:38:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:38:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:38:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-05-12 13:38:55,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-05-12 13:38:55,356 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 410 flow. Second operand 8 states and 176 transitions. [2024-05-12 13:38:55,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 666 flow [2024-05-12 13:38:55,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 628 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 13:38:55,362 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 510 flow [2024-05-12 13:38:55,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-05-12 13:38:55,364 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2024-05-12 13:38:55,365 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 510 flow [2024-05-12 13:38:55,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:55,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:55,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:55,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:38:55,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:55,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1897955165, now seen corresponding path program 1 times [2024-05-12 13:38:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556426487] [2024-05-12 13:38:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:38:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:38:57,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:38:57,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556426487] [2024-05-12 13:38:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556426487] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:38:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:38:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:38:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386795410] [2024-05-12 13:38:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:38:57,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:38:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:38:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:38:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:38:57,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:38:57,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 510 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:57,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:38:57,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:38:57,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:38:58,848 INFO L124 PetriNetUnfolderBase]: 3613/5599 cut-off events. [2024-05-12 13:38:58,849 INFO L125 PetriNetUnfolderBase]: For 6859/6863 co-relation queries the response was YES. [2024-05-12 13:38:58,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15304 conditions, 5599 events. 3613/5599 cut-off events. For 6859/6863 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32262 event pairs, 1894 based on Foata normal form. 3/5599 useless extension candidates. Maximal degree in co-relation 15271. Up to 5132 conditions per place. [2024-05-12 13:38:58,879 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 78 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-05-12 13:38:58,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 887 flow [2024-05-12 13:38:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:38:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:38:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 13:38:58,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-05-12 13:38:58,881 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 510 flow. Second operand 7 states and 162 transitions. [2024-05-12 13:38:58,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 887 flow [2024-05-12 13:38:58,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 826 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-05-12 13:38:58,887 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 638 flow [2024-05-12 13:38:58,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=638, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-05-12 13:38:58,888 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-05-12 13:38:58,888 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 638 flow [2024-05-12 13:38:58,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:38:58,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:38:58,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:38:58,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:38:58,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:38:58,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:38:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 169858546, now seen corresponding path program 1 times [2024-05-12 13:38:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:38:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234219780] [2024-05-12 13:38:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:38:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:38:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234219780] [2024-05-12 13:39:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234219780] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430690022] [2024-05-12 13:39:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:01,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:01,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:01,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 638 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:01,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:02,984 INFO L124 PetriNetUnfolderBase]: 3599/5578 cut-off events. [2024-05-12 13:39:02,984 INFO L125 PetriNetUnfolderBase]: For 9135/9184 co-relation queries the response was YES. [2024-05-12 13:39:02,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 5578 events. 3599/5578 cut-off events. For 9135/9184 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32266 event pairs, 1453 based on Foata normal form. 2/5565 useless extension candidates. Maximal degree in co-relation 16457. Up to 5112 conditions per place. [2024-05-12 13:39:03,039 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 75 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-05-12 13:39:03,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 886 flow [2024-05-12 13:39:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-05-12 13:39:03,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45592705167173253 [2024-05-12 13:39:03,053 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 638 flow. Second operand 7 states and 150 transitions. [2024-05-12 13:39:03,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 886 flow [2024-05-12 13:39:03,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 108 transitions, 846 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-05-12 13:39:03,068 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 675 flow [2024-05-12 13:39:03,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2024-05-12 13:39:03,071 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-05-12 13:39:03,071 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 675 flow [2024-05-12 13:39:03,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:03,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:03,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:39:03,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:03,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1838251988, now seen corresponding path program 2 times [2024-05-12 13:39:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910524645] [2024-05-12 13:39:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910524645] [2024-05-12 13:39:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910524645] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334887870] [2024-05-12 13:39:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:05,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:05,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:05,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:05,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:05,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:06,896 INFO L124 PetriNetUnfolderBase]: 3602/5595 cut-off events. [2024-05-12 13:39:06,897 INFO L125 PetriNetUnfolderBase]: For 9661/9718 co-relation queries the response was YES. [2024-05-12 13:39:06,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16639 conditions, 5595 events. 3602/5595 cut-off events. For 9661/9718 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32338 event pairs, 1613 based on Foata normal form. 4/5587 useless extension candidates. Maximal degree in co-relation 16599. Up to 5120 conditions per place. [2024-05-12 13:39:06,923 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 85 selfloop transitions, 24 changer transitions 0/118 dead transitions. [2024-05-12 13:39:06,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 118 transitions, 975 flow [2024-05-12 13:39:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 13:39:06,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-05-12 13:39:06,925 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 675 flow. Second operand 7 states and 162 transitions. [2024-05-12 13:39:06,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 118 transitions, 975 flow [2024-05-12 13:39:06,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 118 transitions, 919 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:39:06,934 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 715 flow [2024-05-12 13:39:06,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2024-05-12 13:39:06,934 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-05-12 13:39:06,934 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 715 flow [2024-05-12 13:39:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:06,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:06,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:06,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:39:06,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:06,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2026831178, now seen corresponding path program 3 times [2024-05-12 13:39:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112297041] [2024-05-12 13:39:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112297041] [2024-05-12 13:39:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112297041] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096552708] [2024-05-12 13:39:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:09,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:09,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:09,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 715 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:09,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:09,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:09,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:11,078 INFO L124 PetriNetUnfolderBase]: 3602/5595 cut-off events. [2024-05-12 13:39:11,078 INFO L125 PetriNetUnfolderBase]: For 10886/10935 co-relation queries the response was YES. [2024-05-12 13:39:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16972 conditions, 5595 events. 3602/5595 cut-off events. For 10886/10935 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32394 event pairs, 1442 based on Foata normal form. 2/5585 useless extension candidates. Maximal degree in co-relation 16930. Up to 5119 conditions per place. [2024-05-12 13:39:11,113 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 97 selfloop transitions, 30 changer transitions 0/136 dead transitions. [2024-05-12 13:39:11,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 136 transitions, 1148 flow [2024-05-12 13:39:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 13:39:11,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 13:39:11,115 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 715 flow. Second operand 7 states and 173 transitions. [2024-05-12 13:39:11,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 136 transitions, 1148 flow [2024-05-12 13:39:11,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 1078 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:39:11,126 INFO L231 Difference]: Finished difference. Result has 104 places, 111 transitions, 848 flow [2024-05-12 13:39:11,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=104, PETRI_TRANSITIONS=111} [2024-05-12 13:39:11,127 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2024-05-12 13:39:11,127 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 111 transitions, 848 flow [2024-05-12 13:39:11,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:11,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:11,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:11,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:39:11,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:11,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2026324328, now seen corresponding path program 4 times [2024-05-12 13:39:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852982160] [2024-05-12 13:39:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852982160] [2024-05-12 13:39:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852982160] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939754238] [2024-05-12 13:39:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:13,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:13,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:13,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:13,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 111 transitions, 848 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:13,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:13,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:13,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:15,216 INFO L124 PetriNetUnfolderBase]: 3601/5592 cut-off events. [2024-05-12 13:39:15,216 INFO L125 PetriNetUnfolderBase]: For 12457/12534 co-relation queries the response was YES. [2024-05-12 13:39:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17346 conditions, 5592 events. 3601/5592 cut-off events. For 12457/12534 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32502 event pairs, 1015 based on Foata normal form. 2/5582 useless extension candidates. Maximal degree in co-relation 17300. Up to 5059 conditions per place. [2024-05-12 13:39:15,247 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 106 selfloop transitions, 32 changer transitions 0/147 dead transitions. [2024-05-12 13:39:15,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 147 transitions, 1239 flow [2024-05-12 13:39:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-05-12 13:39:15,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 13:39:15,249 INFO L175 Difference]: Start difference. First operand has 104 places, 111 transitions, 848 flow. Second operand 7 states and 182 transitions. [2024-05-12 13:39:15,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 147 transitions, 1239 flow [2024-05-12 13:39:15,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 147 transitions, 1182 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 13:39:15,265 INFO L231 Difference]: Finished difference. Result has 105 places, 113 transitions, 874 flow [2024-05-12 13:39:15,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=874, PETRI_PLACES=105, PETRI_TRANSITIONS=113} [2024-05-12 13:39:15,266 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-05-12 13:39:15,266 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 113 transitions, 874 flow [2024-05-12 13:39:15,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:15,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:15,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:15,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:39:15,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:15,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1277707004, now seen corresponding path program 1 times [2024-05-12 13:39:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015843284] [2024-05-12 13:39:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015843284] [2024-05-12 13:39:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015843284] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:16,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:39:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868283001] [2024-05-12 13:39:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:16,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:39:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:39:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:39:16,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:16,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 113 transitions, 874 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:16,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:16,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:18,411 INFO L124 PetriNetUnfolderBase]: 4051/6223 cut-off events. [2024-05-12 13:39:18,411 INFO L125 PetriNetUnfolderBase]: For 13790/13899 co-relation queries the response was YES. [2024-05-12 13:39:18,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19586 conditions, 6223 events. 4051/6223 cut-off events. For 13790/13899 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 36492 event pairs, 1786 based on Foata normal form. 0/6032 useless extension candidates. Maximal degree in co-relation 19542. Up to 5806 conditions per place. [2024-05-12 13:39:18,442 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 103 selfloop transitions, 20 changer transitions 0/131 dead transitions. [2024-05-12 13:39:18,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 1229 flow [2024-05-12 13:39:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:39:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:39:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-05-12 13:39:18,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48226950354609927 [2024-05-12 13:39:18,444 INFO L175 Difference]: Start difference. First operand has 105 places, 113 transitions, 874 flow. Second operand 6 states and 136 transitions. [2024-05-12 13:39:18,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 1229 flow [2024-05-12 13:39:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1132 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:39:18,461 INFO L231 Difference]: Finished difference. Result has 105 places, 124 transitions, 945 flow [2024-05-12 13:39:18,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=105, PETRI_TRANSITIONS=124} [2024-05-12 13:39:18,461 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-05-12 13:39:18,461 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 124 transitions, 945 flow [2024-05-12 13:39:18,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:18,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:18,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:39:18,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:18,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1292950310, now seen corresponding path program 1 times [2024-05-12 13:39:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:18,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155149614] [2024-05-12 13:39:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:20,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-05-12 13:39:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155149614] [2024-05-12 13:39:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155149614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470127023] [2024-05-12 13:39:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:20,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:20,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:20,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 124 transitions, 945 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 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-05-12 13:39:20,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:20,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:20,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:21,742 INFO L124 PetriNetUnfolderBase]: 3719/5797 cut-off events. [2024-05-12 13:39:21,742 INFO L125 PetriNetUnfolderBase]: For 13746/13758 co-relation queries the response was YES. [2024-05-12 13:39:21,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18796 conditions, 5797 events. 3719/5797 cut-off events. For 13746/13758 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 34458 event pairs, 1543 based on Foata normal form. 8/5802 useless extension candidates. Maximal degree in co-relation 18751. Up to 5316 conditions per place. [2024-05-12 13:39:21,771 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 104 selfloop transitions, 33 changer transitions 0/145 dead transitions. [2024-05-12 13:39:21,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 1315 flow [2024-05-12 13:39:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:39:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:39:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-05-12 13:39:21,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 13:39:21,774 INFO L175 Difference]: Start difference. First operand has 105 places, 124 transitions, 945 flow. Second operand 6 states and 144 transitions. [2024-05-12 13:39:21,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 1315 flow [2024-05-12 13:39:21,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 1295 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-05-12 13:39:21,818 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 1058 flow [2024-05-12 13:39:21,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1058, PETRI_PLACES=111, PETRI_TRANSITIONS=128} [2024-05-12 13:39:21,819 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2024-05-12 13:39:21,819 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 1058 flow [2024-05-12 13:39:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 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-05-12 13:39:21,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:21,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:21,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:39:21,820 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:21,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1219842980, now seen corresponding path program 1 times [2024-05-12 13:39:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836474689] [2024-05-12 13:39:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:21,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836474689] [2024-05-12 13:39:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836474689] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:23,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119939437] [2024-05-12 13:39:23,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:23,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:23,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:23,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 1058 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:23,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:23,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:23,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:25,862 INFO L124 PetriNetUnfolderBase]: 3854/6017 cut-off events. [2024-05-12 13:39:25,863 INFO L125 PetriNetUnfolderBase]: For 14990/14998 co-relation queries the response was YES. [2024-05-12 13:39:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19722 conditions, 6017 events. 3854/6017 cut-off events. For 14990/14998 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 36041 event pairs, 1276 based on Foata normal form. 3/6020 useless extension candidates. Maximal degree in co-relation 19673. Up to 5373 conditions per place. [2024-05-12 13:39:25,899 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 115 selfloop transitions, 58 changer transitions 0/181 dead transitions. [2024-05-12 13:39:25,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 181 transitions, 1719 flow [2024-05-12 13:39:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:39:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:39:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 13:39:25,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2024-05-12 13:39:25,903 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 1058 flow. Second operand 8 states and 194 transitions. [2024-05-12 13:39:25,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 181 transitions, 1719 flow [2024-05-12 13:39:25,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 181 transitions, 1625 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-05-12 13:39:25,926 INFO L231 Difference]: Finished difference. Result has 118 places, 147 transitions, 1314 flow [2024-05-12 13:39:25,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1314, PETRI_PLACES=118, PETRI_TRANSITIONS=147} [2024-05-12 13:39:25,927 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2024-05-12 13:39:25,927 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1314 flow [2024-05-12 13:39:25,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:25,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:25,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:39:25,928 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:25,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2027123216, now seen corresponding path program 2 times [2024-05-12 13:39:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138328812] [2024-05-12 13:39:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138328812] [2024-05-12 13:39:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138328812] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:28,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185380587] [2024-05-12 13:39:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:28,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:28,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1314 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:28,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:28,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:28,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:29,984 INFO L124 PetriNetUnfolderBase]: 3802/5930 cut-off events. [2024-05-12 13:39:29,985 INFO L125 PetriNetUnfolderBase]: For 20700/20706 co-relation queries the response was YES. [2024-05-12 13:39:30,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21165 conditions, 5930 events. 3802/5930 cut-off events. For 20700/20706 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35351 event pairs, 1288 based on Foata normal form. 3/5933 useless extension candidates. Maximal degree in co-relation 21113. Up to 5283 conditions per place. [2024-05-12 13:39:30,026 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 124 selfloop transitions, 63 changer transitions 0/195 dead transitions. [2024-05-12 13:39:30,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 195 transitions, 2048 flow [2024-05-12 13:39:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:39:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:39:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-05-12 13:39:30,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2024-05-12 13:39:30,030 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 1314 flow. Second operand 8 states and 190 transitions. [2024-05-12 13:39:30,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 195 transitions, 2048 flow [2024-05-12 13:39:30,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 195 transitions, 1932 flow, removed 43 selfloop flow, removed 2 redundant places. [2024-05-12 13:39:30,070 INFO L231 Difference]: Finished difference. Result has 126 places, 159 transitions, 1501 flow [2024-05-12 13:39:30,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1501, PETRI_PLACES=126, PETRI_TRANSITIONS=159} [2024-05-12 13:39:30,071 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 75 predicate places. [2024-05-12 13:39:30,072 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1501 flow [2024-05-12 13:39:30,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:30,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:30,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:30,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:39:30,073 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:30,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1426257410, now seen corresponding path program 3 times [2024-05-12 13:39:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074060555] [2024-05-12 13:39:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074060555] [2024-05-12 13:39:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074060555] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:31,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048308309] [2024-05-12 13:39:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:31,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:32,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:32,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 1501 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:32,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:32,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:32,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:34,292 INFO L124 PetriNetUnfolderBase]: 3804/5934 cut-off events. [2024-05-12 13:39:34,293 INFO L125 PetriNetUnfolderBase]: For 21626/21632 co-relation queries the response was YES. [2024-05-12 13:39:34,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21421 conditions, 5934 events. 3804/5934 cut-off events. For 21626/21632 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35378 event pairs, 1289 based on Foata normal form. 3/5937 useless extension candidates. Maximal degree in co-relation 21365. Up to 5285 conditions per place. [2024-05-12 13:39:34,333 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 112 selfloop transitions, 73 changer transitions 0/193 dead transitions. [2024-05-12 13:39:34,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 193 transitions, 2133 flow [2024-05-12 13:39:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:39:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:39:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2024-05-12 13:39:34,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47044917257683216 [2024-05-12 13:39:34,335 INFO L175 Difference]: Start difference. First operand has 126 places, 159 transitions, 1501 flow. Second operand 9 states and 199 transitions. [2024-05-12 13:39:34,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 193 transitions, 2133 flow [2024-05-12 13:39:34,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 2012 flow, removed 48 selfloop flow, removed 2 redundant places. [2024-05-12 13:39:34,379 INFO L231 Difference]: Finished difference. Result has 134 places, 165 transitions, 1644 flow [2024-05-12 13:39:34,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1644, PETRI_PLACES=134, PETRI_TRANSITIONS=165} [2024-05-12 13:39:34,381 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 83 predicate places. [2024-05-12 13:39:34,382 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 165 transitions, 1644 flow [2024-05-12 13:39:34,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:34,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:34,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:34,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:39:34,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:34,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -501479397, now seen corresponding path program 1 times [2024-05-12 13:39:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270792281] [2024-05-12 13:39:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270792281] [2024-05-12 13:39:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270792281] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824319207] [2024-05-12 13:39:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:36,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:36,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 165 transitions, 1644 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:36,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:36,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:36,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:37,911 INFO L124 PetriNetUnfolderBase]: 4113/6320 cut-off events. [2024-05-12 13:39:37,911 INFO L125 PetriNetUnfolderBase]: For 23374/23419 co-relation queries the response was YES. [2024-05-12 13:39:37,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23229 conditions, 6320 events. 4113/6320 cut-off events. For 23374/23419 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 37216 event pairs, 1666 based on Foata normal form. 8/6322 useless extension candidates. Maximal degree in co-relation 23169. Up to 5827 conditions per place. [2024-05-12 13:39:37,955 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 145 selfloop transitions, 44 changer transitions 0/197 dead transitions. [2024-05-12 13:39:37,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 197 transitions, 2285 flow [2024-05-12 13:39:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 13:39:37,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513677811550152 [2024-05-12 13:39:37,957 INFO L175 Difference]: Start difference. First operand has 134 places, 165 transitions, 1644 flow. Second operand 7 states and 169 transitions. [2024-05-12 13:39:37,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 197 transitions, 2285 flow [2024-05-12 13:39:38,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 197 transitions, 2083 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-05-12 13:39:38,013 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1784 flow [2024-05-12 13:39:38,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1784, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2024-05-12 13:39:38,014 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 87 predicate places. [2024-05-12 13:39:38,014 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1784 flow [2024-05-12 13:39:38,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:38,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:38,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:38,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:39:38,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:38,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1043833191, now seen corresponding path program 1 times [2024-05-12 13:39:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958588582] [2024-05-12 13:39:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:39,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958588582] [2024-05-12 13:39:39,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958588582] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:39,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:39,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:39,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704311050] [2024-05-12 13:39:39,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:39,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:39,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:39,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:39,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:39,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1784 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:39,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:39,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:39,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:41,765 INFO L124 PetriNetUnfolderBase]: 4010/6249 cut-off events. [2024-05-12 13:39:41,766 INFO L125 PetriNetUnfolderBase]: For 30016/30202 co-relation queries the response was YES. [2024-05-12 13:39:41,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24713 conditions, 6249 events. 4010/6249 cut-off events. For 30016/30202 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37338 event pairs, 1415 based on Foata normal form. 6/6199 useless extension candidates. Maximal degree in co-relation 24650. Up to 5507 conditions per place. [2024-05-12 13:39:41,809 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 141 selfloop transitions, 83 changer transitions 0/232 dead transitions. [2024-05-12 13:39:41,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 232 transitions, 2628 flow [2024-05-12 13:39:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-05-12 13:39:41,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-05-12 13:39:41,811 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1784 flow. Second operand 7 states and 178 transitions. [2024-05-12 13:39:41,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 232 transitions, 2628 flow [2024-05-12 13:39:41,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 232 transitions, 2526 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 13:39:41,860 INFO L231 Difference]: Finished difference. Result has 143 places, 193 transitions, 2052 flow [2024-05-12 13:39:41,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2052, PETRI_PLACES=143, PETRI_TRANSITIONS=193} [2024-05-12 13:39:41,860 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2024-05-12 13:39:41,860 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 193 transitions, 2052 flow [2024-05-12 13:39:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:41,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:41,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:39:41,861 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:41,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -484159077, now seen corresponding path program 2 times [2024-05-12 13:39:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180488110] [2024-05-12 13:39:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180488110] [2024-05-12 13:39:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180488110] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:43,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059838264] [2024-05-12 13:39:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:43,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:43,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:43,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:43,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 193 transitions, 2052 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:43,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:43,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:43,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:45,381 INFO L124 PetriNetUnfolderBase]: 4196/6440 cut-off events. [2024-05-12 13:39:45,381 INFO L125 PetriNetUnfolderBase]: For 31900/31949 co-relation queries the response was YES. [2024-05-12 13:39:45,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25932 conditions, 6440 events. 4196/6440 cut-off events. For 31900/31949 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 37832 event pairs, 1687 based on Foata normal form. 11/6444 useless extension candidates. Maximal degree in co-relation 25867. Up to 5930 conditions per place. [2024-05-12 13:39:45,421 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 151 selfloop transitions, 69 changer transitions 0/228 dead transitions. [2024-05-12 13:39:45,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 228 transitions, 2896 flow [2024-05-12 13:39:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:39:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:39:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-05-12 13:39:45,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 13:39:45,423 INFO L175 Difference]: Start difference. First operand has 143 places, 193 transitions, 2052 flow. Second operand 8 states and 180 transitions. [2024-05-12 13:39:45,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 228 transitions, 2896 flow [2024-05-12 13:39:45,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 228 transitions, 2719 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-05-12 13:39:45,485 INFO L231 Difference]: Finished difference. Result has 149 places, 213 transitions, 2360 flow [2024-05-12 13:39:45,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2360, PETRI_PLACES=149, PETRI_TRANSITIONS=213} [2024-05-12 13:39:45,486 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 98 predicate places. [2024-05-12 13:39:45,486 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 213 transitions, 2360 flow [2024-05-12 13:39:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:45,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:45,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:45,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:39:45,487 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:45,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1280008551, now seen corresponding path program 2 times [2024-05-12 13:39:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730016231] [2024-05-12 13:39:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730016231] [2024-05-12 13:39:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730016231] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135805662] [2024-05-12 13:39:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:47,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:47,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:47,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 213 transitions, 2360 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:47,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:47,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:47,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:49,236 INFO L124 PetriNetUnfolderBase]: 4021/6251 cut-off events. [2024-05-12 13:39:49,236 INFO L125 PetriNetUnfolderBase]: For 37973/38271 co-relation queries the response was YES. [2024-05-12 13:39:49,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26253 conditions, 6251 events. 4021/6251 cut-off events. For 37973/38271 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37150 event pairs, 1394 based on Foata normal form. 16/6204 useless extension candidates. Maximal degree in co-relation 26186. Up to 5504 conditions per place. [2024-05-12 13:39:49,276 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 162 selfloop transitions, 90 changer transitions 0/260 dead transitions. [2024-05-12 13:39:49,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 260 transitions, 3231 flow [2024-05-12 13:39:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 13:39:49,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 13:39:49,278 INFO L175 Difference]: Start difference. First operand has 149 places, 213 transitions, 2360 flow. Second operand 7 states and 173 transitions. [2024-05-12 13:39:49,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 260 transitions, 3231 flow [2024-05-12 13:39:49,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 260 transitions, 3065 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-05-12 13:39:49,336 INFO L231 Difference]: Finished difference. Result has 153 places, 217 transitions, 2520 flow [2024-05-12 13:39:49,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2520, PETRI_PLACES=153, PETRI_TRANSITIONS=217} [2024-05-12 13:39:49,336 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 102 predicate places. [2024-05-12 13:39:49,336 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 217 transitions, 2520 flow [2024-05-12 13:39:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:49,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:49,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:49,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:39:49,337 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:49,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1279769541, now seen corresponding path program 3 times [2024-05-12 13:39:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356625398] [2024-05-12 13:39:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356625398] [2024-05-12 13:39:51,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356625398] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:51,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:51,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870653011] [2024-05-12 13:39:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:51,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:51,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:51,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:51,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:51,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 217 transitions, 2520 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:51,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:51,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:51,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:52,984 INFO L124 PetriNetUnfolderBase]: 4019/6240 cut-off events. [2024-05-12 13:39:52,984 INFO L125 PetriNetUnfolderBase]: For 39263/39558 co-relation queries the response was YES. [2024-05-12 13:39:53,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26334 conditions, 6240 events. 4019/6240 cut-off events. For 39263/39558 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37055 event pairs, 1402 based on Foata normal form. 12/6187 useless extension candidates. Maximal degree in co-relation 26264. Up to 5504 conditions per place. [2024-05-12 13:39:53,040 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 151 selfloop transitions, 93 changer transitions 0/252 dead transitions. [2024-05-12 13:39:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 252 transitions, 3230 flow [2024-05-12 13:39:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 13:39:53,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2024-05-12 13:39:53,043 INFO L175 Difference]: Start difference. First operand has 153 places, 217 transitions, 2520 flow. Second operand 7 states and 164 transitions. [2024-05-12 13:39:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 252 transitions, 3230 flow [2024-05-12 13:39:53,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 252 transitions, 2918 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-05-12 13:39:53,122 INFO L231 Difference]: Finished difference. Result has 154 places, 220 transitions, 2476 flow [2024-05-12 13:39:53,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2476, PETRI_PLACES=154, PETRI_TRANSITIONS=220} [2024-05-12 13:39:53,123 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 103 predicate places. [2024-05-12 13:39:53,123 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 220 transitions, 2476 flow [2024-05-12 13:39:53,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:53,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:53,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:53,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:39:53,124 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:53,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash -494806213, now seen corresponding path program 1 times [2024-05-12 13:39:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:53,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962398997] [2024-05-12 13:39:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962398997] [2024-05-12 13:39:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962398997] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:39:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787739652] [2024-05-12 13:39:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:54,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:39:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:39:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:39:54,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:54,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 220 transitions, 2476 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:54,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:54,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:54,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:39:57,028 INFO L124 PetriNetUnfolderBase]: 4199/6458 cut-off events. [2024-05-12 13:39:57,028 INFO L125 PetriNetUnfolderBase]: For 38092/38151 co-relation queries the response was YES. [2024-05-12 13:39:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 6458 events. 4199/6458 cut-off events. For 38092/38151 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 37848 event pairs, 1607 based on Foata normal form. 3/6455 useless extension candidates. Maximal degree in co-relation 27124. Up to 5941 conditions per place. [2024-05-12 13:39:57,090 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 194 selfloop transitions, 43 changer transitions 0/245 dead transitions. [2024-05-12 13:39:57,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 245 transitions, 3116 flow [2024-05-12 13:39:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:39:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:39:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 13:39:57,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2024-05-12 13:39:57,092 INFO L175 Difference]: Start difference. First operand has 154 places, 220 transitions, 2476 flow. Second operand 7 states and 164 transitions. [2024-05-12 13:39:57,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 245 transitions, 3116 flow [2024-05-12 13:39:57,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 245 transitions, 2937 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-05-12 13:39:57,180 INFO L231 Difference]: Finished difference. Result has 159 places, 229 transitions, 2517 flow [2024-05-12 13:39:57,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2517, PETRI_PLACES=159, PETRI_TRANSITIONS=229} [2024-05-12 13:39:57,181 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 108 predicate places. [2024-05-12 13:39:57,181 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 229 transitions, 2517 flow [2024-05-12 13:39:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:57,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:39:57,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:39:57,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:39:57,182 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:39:57,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:39:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 823079909, now seen corresponding path program 1 times [2024-05-12 13:39:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:39:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832985840] [2024-05-12 13:39:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:39:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:39:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:39:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:39:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:39:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832985840] [2024-05-12 13:39:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832985840] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:39:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:39:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:39:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743073933] [2024-05-12 13:39:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:39:59,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:39:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:39:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:39:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:39:59,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:39:59,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 229 transitions, 2517 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:39:59,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:39:59,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:39:59,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:01,294 INFO L124 PetriNetUnfolderBase]: 4025/6260 cut-off events. [2024-05-12 13:40:01,294 INFO L125 PetriNetUnfolderBase]: For 40456/40880 co-relation queries the response was YES. [2024-05-12 13:40:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26745 conditions, 6260 events. 4025/6260 cut-off events. For 40456/40880 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37125 event pairs, 1535 based on Foata normal form. 4/6211 useless extension candidates. Maximal degree in co-relation 26672. Up to 5778 conditions per place. [2024-05-12 13:40:01,341 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 211 selfloop transitions, 20 changer transitions 0/239 dead transitions. [2024-05-12 13:40:01,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 239 transitions, 3048 flow [2024-05-12 13:40:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:40:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:40:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-05-12 13:40:01,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45288753799392095 [2024-05-12 13:40:01,342 INFO L175 Difference]: Start difference. First operand has 159 places, 229 transitions, 2517 flow. Second operand 7 states and 149 transitions. [2024-05-12 13:40:01,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 239 transitions, 3048 flow [2024-05-12 13:40:01,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 239 transitions, 2977 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-05-12 13:40:01,423 INFO L231 Difference]: Finished difference. Result has 164 places, 231 transitions, 2533 flow [2024-05-12 13:40:01,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2533, PETRI_PLACES=164, PETRI_TRANSITIONS=231} [2024-05-12 13:40:01,423 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 113 predicate places. [2024-05-12 13:40:01,424 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 231 transitions, 2533 flow [2024-05-12 13:40:01,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:01,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:01,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:01,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:40:01,424 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:40:01,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -484146181, now seen corresponding path program 1 times [2024-05-12 13:40:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855121038] [2024-05-12 13:40:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:40:01,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:40:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:40:01,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:40:01,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:40:01,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-05-12 13:40:01,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-05-12 13:40:01,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 13:40:01,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-12 13:40:01,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 13:40:01,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 13:40:01,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-05-12 13:40:01,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:40:01,535 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:01,538 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:40:01,539 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:40:01,573 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,583 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,583 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,583 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,587 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,587 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,588 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,589 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,589 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:40:01,595 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-05-12 13:40:01,609 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 13:40:01,609 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 13:40:01,610 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:40:01 BasicIcfg [2024-05-12 13:40:01,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:40:01,610 INFO L158 Benchmark]: Toolchain (without parser) took 88219.90ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 113.7MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 612.3MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,611 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:40:01,611 INFO L158 Benchmark]: Witness Parser took 4.53ms. Allocated memory is still 197.1MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:40:01,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.96ms. Allocated memory is still 197.1MB. Free memory was 113.5MB in the beginning and 125.3MB in the end (delta: -11.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.20ms. Allocated memory is still 197.1MB. Free memory was 125.3MB in the beginning and 122.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,611 INFO L158 Benchmark]: Boogie Preprocessor took 82.60ms. Allocated memory is still 197.1MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,612 INFO L158 Benchmark]: RCFGBuilder took 1224.43ms. Allocated memory is still 197.1MB. Free memory was 115.7MB in the beginning and 81.3MB in the end (delta: 34.3MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,612 INFO L158 Benchmark]: TraceAbstraction took 86201.07ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 81.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 577.0MB. Max. memory is 16.1GB. [2024-05-12 13:40:01,613 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.15ms. Allocated memory is still 111.1MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.53ms. Allocated memory is still 197.1MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.96ms. Allocated memory is still 197.1MB. Free memory was 113.5MB in the beginning and 125.3MB in the end (delta: -11.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.20ms. Allocated memory is still 197.1MB. Free memory was 125.3MB in the beginning and 122.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.60ms. Allocated memory is still 197.1MB. Free memory was 121.2MB in the beginning and 115.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1224.43ms. Allocated memory is still 197.1MB. Free memory was 115.7MB in the beginning and 81.3MB in the end (delta: 34.3MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * TraceAbstraction took 86201.07ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 81.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 577.0MB. 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: 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: 859]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; VAL [__unbuffered_cnt=0, __unbuffered_p0_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, t2124={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 //@ ghost multithreaded = 1; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, t2124={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t2125; [L856] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, t2124={6:0}, t2125={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 __unbuffered_p2_EAX$read_delayed_var [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L856] 0 x [L857] 0 pthread_t t2126; [L858] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, t2124={6:0}, t2125={7:0}, t2126={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L858] 0 x [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] EXPR 3 \read(x) [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, t2124={6:0}, t2125={7:0}, t2126={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 856]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 86.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1040 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4945 IncrementalHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 66 mSDtfsCounter, 4945 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2533occurred in iteration=23, InterpolantAutomatonStates: 157, 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, 45.6s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 34289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-05-12 13:40:01,651 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