./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:02:29,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:02:29,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:02:29,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:02:29,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:02:29,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:02:29,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:02:29,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:02:29,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:02:29,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:02:29,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:02:29,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:02:29,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:02:29,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:02:29,204 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:02:29,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:02:29,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:02:29,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:02:29,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:02:29,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:02:29,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:02:29,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:02:29,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:02:29,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:02:29,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:02:29,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:02:29,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:02:29,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:02:29,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:02:29,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:02:29,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:02:29,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:02:29,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:02:29,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:02:29,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:02:29,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:02:29,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:02:29,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:02:29,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:02:29,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:02:29,213 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:02:29,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:02:29,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:02:29,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:02:29,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:02:29,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:02:29,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:02:29,512 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:02:29,512 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:02:29,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_rmo.oepc.yml/witness.yml [2024-06-28 02:02:29,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:02:29,802 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:02:29,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2024-06-28 02:02:30,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:02:31,237 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:02:31,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2024-06-28 02:02:31,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80990d12a/d4a4c159e2cd496b810076ca8842abe6/FLAG09f61e5f2 [2024-06-28 02:02:31,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80990d12a/d4a4c159e2cd496b810076ca8842abe6 [2024-06-28 02:02:31,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:02:31,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:02:31,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:02:31,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:02:31,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:02:31,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:02:29" (1/2) ... [2024-06-28 02:02:31,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257dbdc9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:02:31, skipping insertion in model container [2024-06-28 02:02:31,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:02:29" (1/2) ... [2024-06-28 02:02:31,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@43fd425 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:02:31, skipping insertion in model container [2024-06-28 02:02:31,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:02:31" (2/2) ... [2024-06-28 02:02:31,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257dbdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:31, skipping insertion in model container [2024-06-28 02:02:31,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:02:31" (2/2) ... [2024-06-28 02:02:31,292 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:02:31,491 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:02:31,492 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:02:31,492 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:02:31,492 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:02:31,492 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:02:31,493 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:02:31,493 INFO L106 edCorrectnessWitness]: ghost_update [L852-L852] multithreaded = 1; [2024-06-28 02:02:31,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:02:31,721 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2024-06-28 02:02:31,933 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:02:31,946 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:02:32,012 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i[993,1006] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:02:32,148 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:02:32,183 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:02:32,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32 WrapperNode [2024-06-28 02:02:32,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:02:32,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:02:32,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:02:32,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:02:32,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,278 INFO L138 Inliner]: procedures = 176, calls = 117, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 329 [2024-06-28 02:02:32,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:02:32,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:02:32,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:02:32,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:02:32,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,329 INFO L175 MemorySlicer]: Split 72 memory accesses to 2 slices as follows [2, 70]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-28 02:02:32,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:02:32,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:02:32,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:02:32,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:02:32,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (1/1) ... [2024-06-28 02:02:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:02:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:02:32,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:02:32,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:02:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:02:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:02:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:02:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:02:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:02:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:02:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:02:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:02:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:02:32,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:02:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:02:32,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:02:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:02:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:02:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:02:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:02:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:02:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:02:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:02:32,441 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:02:32,606 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:02:32,608 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:02:33,199 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:02:33,199 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:02:33,924 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:02:33,924 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:02:33,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:02:33 BoogieIcfgContainer [2024-06-28 02:02:33,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:02:33,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:02:33,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:02:33,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:02:33,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:02:29" (1/4) ... [2024-06-28 02:02:33,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b337c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:02:33, skipping insertion in model container [2024-06-28 02:02:33,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:02:31" (2/4) ... [2024-06-28 02:02:33,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:02:33, skipping insertion in model container [2024-06-28 02:02:33,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:02:32" (3/4) ... [2024-06-28 02:02:33,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:02:33, skipping insertion in model container [2024-06-28 02:02:33,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:02:33" (4/4) ... [2024-06-28 02:02:33,934 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2024-06-28 02:02:33,952 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:02:33,952 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 02:02:33,952 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:02:34,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:02:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:02:34,106 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-28 02:02:34,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:02:34,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 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/47 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-28 02:02:34,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:02:34,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 112 flow [2024-06-28 02:02:34,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:02:34,140 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;@9889753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:02:34,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 02:02:34,147 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:02:34,147 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:02:34,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:02:34,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:34,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:02:34,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:34,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 916754341, now seen corresponding path program 1 times [2024-06-28 02:02:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143621152] [2024-06-28 02:02:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143621152] [2024-06-28 02:02:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143621152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:02:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218682467] [2024-06-28 02:02:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:36,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:02:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:02:36,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:02:36,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-28 02:02:36,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:36,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:36,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-28 02:02:36,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:40,751 INFO L124 PetriNetUnfolderBase]: 15016/21237 cut-off events. [2024-06-28 02:02:40,751 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-06-28 02:02:40,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41633 conditions, 21237 events. 15016/21237 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 129298 event pairs, 10750 based on Foata normal form. 0/20611 useless extension candidates. Maximal degree in co-relation 41620. Up to 20120 conditions per place. [2024-06-28 02:02:40,902 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 56 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-06-28 02:02:40,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 289 flow [2024-06-28 02:02:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:02:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:02:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-06-28 02:02:40,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-06-28 02:02:40,915 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 112 flow. Second operand 3 states and 111 transitions. [2024-06-28 02:02:40,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 289 flow [2024-06-28 02:02:40,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:02:40,923 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 154 flow [2024-06-28 02:02:40,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-06-28 02:02:40,929 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-06-28 02:02:40,929 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 154 flow [2024-06-28 02:02:40,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:40,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:40,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:40,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:02:40,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:40,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 532665412, now seen corresponding path program 1 times [2024-06-28 02:02:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146514025] [2024-06-28 02:02:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146514025] [2024-06-28 02:02:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146514025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:02:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974252842] [2024-06-28 02:02:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:44,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:02:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:44,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:02:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:02:44,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-28 02:02:44,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:44,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:44,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-28 02:02:44,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:47,527 INFO L124 PetriNetUnfolderBase]: 15006/20430 cut-off events. [2024-06-28 02:02:47,527 INFO L125 PetriNetUnfolderBase]: For 3747/3755 co-relation queries the response was YES. [2024-06-28 02:02:47,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46161 conditions, 20430 events. 15006/20430 cut-off events. For 3747/3755 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 116102 event pairs, 8671 based on Foata normal form. 7/20434 useless extension candidates. Maximal degree in co-relation 46149. Up to 20065 conditions per place. [2024-06-28 02:02:47,681 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 77 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-28 02:02:47,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 452 flow [2024-06-28 02:02:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:02:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:02:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-06-28 02:02:47,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-06-28 02:02:47,690 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 154 flow. Second operand 4 states and 150 transitions. [2024-06-28 02:02:47,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 452 flow [2024-06-28 02:02:47,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:02:47,696 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 237 flow [2024-06-28 02:02:47,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-28 02:02:47,701 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-06-28 02:02:47,705 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 237 flow [2024-06-28 02:02:47,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:47,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:47,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:02:47,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:47,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash -667240120, now seen corresponding path program 1 times [2024-06-28 02:02:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684017034] [2024-06-28 02:02:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684017034] [2024-06-28 02:02:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684017034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:02:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552894958] [2024-06-28 02:02:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:02:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:02:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:02:51,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-28 02:02:51,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:51,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:51,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-28 02:02:51,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:54,609 INFO L124 PetriNetUnfolderBase]: 18209/24511 cut-off events. [2024-06-28 02:02:54,610 INFO L125 PetriNetUnfolderBase]: For 14144/14144 co-relation queries the response was YES. [2024-06-28 02:02:54,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62229 conditions, 24511 events. 18209/24511 cut-off events. For 14144/14144 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 137553 event pairs, 7737 based on Foata normal form. 7/24515 useless extension candidates. Maximal degree in co-relation 62214. Up to 24085 conditions per place. [2024-06-28 02:02:54,763 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 120 selfloop transitions, 21 changer transitions 0/150 dead transitions. [2024-06-28 02:02:54,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 810 flow [2024-06-28 02:02:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:02:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:02:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-06-28 02:02:54,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807017543859649 [2024-06-28 02:02:54,767 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 237 flow. Second operand 5 states and 194 transitions. [2024-06-28 02:02:54,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 810 flow [2024-06-28 02:02:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:02:54,814 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 432 flow [2024-06-28 02:02:54,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2024-06-28 02:02:54,816 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2024-06-28 02:02:54,816 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 432 flow [2024-06-28 02:02:54,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:54,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:54,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:02:54,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:54,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1267585849, now seen corresponding path program 1 times [2024-06-28 02:02:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077670207] [2024-06-28 02:02:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077670207] [2024-06-28 02:02:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077670207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:58,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:02:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306171316] [2024-06-28 02:02:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:02:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:02:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:02:58,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-28 02:02:58,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 432 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:58,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:58,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-28 02:02:58,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:02,474 INFO L124 PetriNetUnfolderBase]: 18535/24981 cut-off events. [2024-06-28 02:03:02,474 INFO L125 PetriNetUnfolderBase]: For 30856/30856 co-relation queries the response was YES. [2024-06-28 02:03:02,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73445 conditions, 24981 events. 18535/24981 cut-off events. For 30856/30856 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 141333 event pairs, 5896 based on Foata normal form. 32/25010 useless extension candidates. Maximal degree in co-relation 73425. Up to 24129 conditions per place. [2024-06-28 02:03:02,652 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 138 selfloop transitions, 24 changer transitions 0/171 dead transitions. [2024-06-28 02:03:02,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 171 transitions, 1027 flow [2024-06-28 02:03:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-28 02:03:02,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6695906432748538 [2024-06-28 02:03:02,655 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 432 flow. Second operand 6 states and 229 transitions. [2024-06-28 02:03:02,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 171 transitions, 1027 flow [2024-06-28 02:03:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 171 transitions, 1023 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:03:02,682 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 505 flow [2024-06-28 02:03:02,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-28 02:03:02,684 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2024-06-28 02:03:02,684 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 505 flow [2024-06-28 02:03:02,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:02,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:02,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:02,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:03:02,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:02,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash -390746901, now seen corresponding path program 1 times [2024-06-28 02:03:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788474809] [2024-06-28 02:03:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788474809] [2024-06-28 02:03:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788474809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:04,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:04,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:03:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985504934] [2024-06-28 02:03:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:03:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:03:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:03:04,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:07,854 INFO L124 PetriNetUnfolderBase]: 18526/26124 cut-off events. [2024-06-28 02:03:07,854 INFO L125 PetriNetUnfolderBase]: For 42450/42450 co-relation queries the response was YES. [2024-06-28 02:03:07,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79393 conditions, 26124 events. 18526/26124 cut-off events. For 42450/42450 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 160085 event pairs, 8356 based on Foata normal form. 3/26125 useless extension candidates. Maximal degree in co-relation 79369. Up to 24751 conditions per place. [2024-06-28 02:03:08,102 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 103 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2024-06-28 02:03:08,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 864 flow [2024-06-28 02:03:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:03:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:03:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-06-28 02:03:08,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228070175438596 [2024-06-28 02:03:08,105 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 505 flow. Second operand 5 states and 149 transitions. [2024-06-28 02:03:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 864 flow [2024-06-28 02:03:08,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 805 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:03:08,130 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 561 flow [2024-06-28 02:03:08,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2024-06-28 02:03:08,132 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places. [2024-06-28 02:03:08,132 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 561 flow [2024-06-28 02:03:08,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:08,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:08,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:03:08,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:08,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2135759482, now seen corresponding path program 1 times [2024-06-28 02:03:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:08,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564736541] [2024-06-28 02:03:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564736541] [2024-06-28 02:03:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564736541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:11,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:11,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173909388] [2024-06-28 02:03:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:11,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:11,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 561 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-06-28 02:03:11,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:11,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:11,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:15,022 INFO L124 PetriNetUnfolderBase]: 18568/25206 cut-off events. [2024-06-28 02:03:15,022 INFO L125 PetriNetUnfolderBase]: For 45930/45930 co-relation queries the response was YES. [2024-06-28 02:03:15,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79452 conditions, 25206 events. 18568/25206 cut-off events. For 45930/45930 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 144604 event pairs, 7373 based on Foata normal form. 6/25209 useless extension candidates. Maximal degree in co-relation 79425. Up to 24576 conditions per place. [2024-06-28 02:03:15,210 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 116 selfloop transitions, 30 changer transitions 0/154 dead transitions. [2024-06-28 02:03:15,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1058 flow [2024-06-28 02:03:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-06-28 02:03:15,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5672514619883041 [2024-06-28 02:03:15,213 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 561 flow. Second operand 6 states and 194 transitions. [2024-06-28 02:03:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1058 flow [2024-06-28 02:03:15,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 154 transitions, 1046 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-28 02:03:15,256 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 675 flow [2024-06-28 02:03:15,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-06-28 02:03:15,257 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 23 predicate places. [2024-06-28 02:03:15,257 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 675 flow [2024-06-28 02:03:15,257 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-06-28 02:03:15,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:15,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:15,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:03:15,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:15,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1844486978, now seen corresponding path program 2 times [2024-06-28 02:03:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375008556] [2024-06-28 02:03:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375008556] [2024-06-28 02:03:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375008556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:18,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276018253] [2024-06-28 02:03:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:18,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:18,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:18,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 675 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-06-28 02:03:18,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:18,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:21,592 INFO L124 PetriNetUnfolderBase]: 18523/25120 cut-off events. [2024-06-28 02:03:21,593 INFO L125 PetriNetUnfolderBase]: For 51107/51107 co-relation queries the response was YES. [2024-06-28 02:03:21,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80523 conditions, 25120 events. 18523/25120 cut-off events. For 51107/51107 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 143796 event pairs, 7401 based on Foata normal form. 3/25118 useless extension candidates. Maximal degree in co-relation 80492. Up to 24507 conditions per place. [2024-06-28 02:03:21,780 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 109 selfloop transitions, 33 changer transitions 0/150 dead transitions. [2024-06-28 02:03:21,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 150 transitions, 1107 flow [2024-06-28 02:03:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-28 02:03:21,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497076023391813 [2024-06-28 02:03:21,782 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 675 flow. Second operand 6 states and 188 transitions. [2024-06-28 02:03:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 150 transitions, 1107 flow [2024-06-28 02:03:21,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 150 transitions, 1062 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:03:21,827 INFO L231 Difference]: Finished difference. Result has 90 places, 101 transitions, 751 flow [2024-06-28 02:03:21,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=90, PETRI_TRANSITIONS=101} [2024-06-28 02:03:21,828 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 27 predicate places. [2024-06-28 02:03:21,829 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 101 transitions, 751 flow [2024-06-28 02:03:21,829 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-06-28 02:03:21,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:21,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:21,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:03:21,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:21,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1190127144, now seen corresponding path program 1 times [2024-06-28 02:03:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531553711] [2024-06-28 02:03:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531553711] [2024-06-28 02:03:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531553711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:23,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:23,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750955942] [2024-06-28 02:03:23,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:23,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:23,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:23,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:23,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 751 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-06-28 02:03:23,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:23,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:23,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:27,627 INFO L124 PetriNetUnfolderBase]: 18508/26082 cut-off events. [2024-06-28 02:03:27,627 INFO L125 PetriNetUnfolderBase]: For 55426/55426 co-relation queries the response was YES. [2024-06-28 02:03:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82400 conditions, 26082 events. 18508/26082 cut-off events. For 55426/55426 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 159238 event pairs, 7963 based on Foata normal form. 6/26086 useless extension candidates. Maximal degree in co-relation 82367. Up to 24656 conditions per place. [2024-06-28 02:03:27,825 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 125 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-06-28 02:03:27,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 149 transitions, 1165 flow [2024-06-28 02:03:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-28 02:03:27,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-06-28 02:03:27,827 INFO L175 Difference]: Start difference. First operand has 90 places, 101 transitions, 751 flow. Second operand 6 states and 180 transitions. [2024-06-28 02:03:27,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 149 transitions, 1165 flow [2024-06-28 02:03:27,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 149 transitions, 1129 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-28 02:03:27,890 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 796 flow [2024-06-28 02:03:27,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2024-06-28 02:03:27,894 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 31 predicate places. [2024-06-28 02:03:27,894 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 796 flow [2024-06-28 02:03:27,894 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-06-28 02:03:27,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:27,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:27,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:03:27,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:27,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -529462759, now seen corresponding path program 1 times [2024-06-28 02:03:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602387618] [2024-06-28 02:03:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602387618] [2024-06-28 02:03:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602387618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528368051] [2024-06-28 02:03:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:31,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:31,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:31,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 796 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-06-28 02:03:31,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:31,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:35,600 INFO L124 PetriNetUnfolderBase]: 18906/25681 cut-off events. [2024-06-28 02:03:35,600 INFO L125 PetriNetUnfolderBase]: For 73064/73064 co-relation queries the response was YES. [2024-06-28 02:03:35,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87684 conditions, 25681 events. 18906/25681 cut-off events. For 73064/73064 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 147378 event pairs, 7128 based on Foata normal form. 30/25708 useless extension candidates. Maximal degree in co-relation 87649. Up to 24670 conditions per place. [2024-06-28 02:03:35,806 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 136 selfloop transitions, 35 changer transitions 0/179 dead transitions. [2024-06-28 02:03:35,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 179 transitions, 1348 flow [2024-06-28 02:03:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:03:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:03:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-06-28 02:03:35,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5664160401002506 [2024-06-28 02:03:35,809 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 796 flow. Second operand 7 states and 226 transitions. [2024-06-28 02:03:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 179 transitions, 1348 flow [2024-06-28 02:03:35,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1299 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-28 02:03:35,910 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 860 flow [2024-06-28 02:03:35,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2024-06-28 02:03:35,911 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 34 predicate places. [2024-06-28 02:03:35,912 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 860 flow [2024-06-28 02:03:35,912 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-06-28 02:03:35,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:35,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:35,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:03:35,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:35,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1269549917, now seen corresponding path program 2 times [2024-06-28 02:03:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914566643] [2024-06-28 02:03:35,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914566643] [2024-06-28 02:03:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914566643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:38,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:38,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240652610] [2024-06-28 02:03:38,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:38,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:38,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:38,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 860 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-06-28 02:03:38,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:38,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:43,037 INFO L124 PetriNetUnfolderBase]: 18992/25811 cut-off events. [2024-06-28 02:03:43,037 INFO L125 PetriNetUnfolderBase]: For 88880/88880 co-relation queries the response was YES. [2024-06-28 02:03:43,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92471 conditions, 25811 events. 18992/25811 cut-off events. For 88880/88880 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 147891 event pairs, 7234 based on Foata normal form. 6/25812 useless extension candidates. Maximal degree in co-relation 92435. Up to 25100 conditions per place. [2024-06-28 02:03:43,241 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 132 selfloop transitions, 36 changer transitions 0/176 dead transitions. [2024-06-28 02:03:43,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 176 transitions, 1400 flow [2024-06-28 02:03:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:03:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:03:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2024-06-28 02:03:43,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513784461152882 [2024-06-28 02:03:43,243 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 860 flow. Second operand 7 states and 220 transitions. [2024-06-28 02:03:43,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 176 transitions, 1400 flow [2024-06-28 02:03:43,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 176 transitions, 1325 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:03:43,303 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 905 flow [2024-06-28 02:03:43,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=905, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-06-28 02:03:43,304 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2024-06-28 02:03:43,304 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 905 flow [2024-06-28 02:03:43,304 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-06-28 02:03:43,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:43,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:03:43,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:43,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 229706351, now seen corresponding path program 3 times [2024-06-28 02:03:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527655194] [2024-06-28 02:03:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527655194] [2024-06-28 02:03:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527655194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274514522] [2024-06-28 02:03:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:45,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:45,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:45,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 905 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-06-28 02:03:45,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:45,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:49,884 INFO L124 PetriNetUnfolderBase]: 18977/25790 cut-off events. [2024-06-28 02:03:49,885 INFO L125 PetriNetUnfolderBase]: For 105634/105634 co-relation queries the response was YES. [2024-06-28 02:03:50,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95654 conditions, 25790 events. 18977/25790 cut-off events. For 105634/105634 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 147720 event pairs, 6342 based on Foata normal form. 6/25791 useless extension candidates. Maximal degree in co-relation 95617. Up to 24565 conditions per place. [2024-06-28 02:03:50,112 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 132 selfloop transitions, 46 changer transitions 0/186 dead transitions. [2024-06-28 02:03:50,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 186 transitions, 1521 flow [2024-06-28 02:03:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:03:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:03:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-06-28 02:03:50,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-06-28 02:03:50,115 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 905 flow. Second operand 7 states and 224 transitions. [2024-06-28 02:03:50,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 186 transitions, 1521 flow [2024-06-28 02:03:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 186 transitions, 1433 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 02:03:50,219 INFO L231 Difference]: Finished difference. Result has 102 places, 117 transitions, 1021 flow [2024-06-28 02:03:50,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1021, PETRI_PLACES=102, PETRI_TRANSITIONS=117} [2024-06-28 02:03:50,220 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 39 predicate places. [2024-06-28 02:03:50,221 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 117 transitions, 1021 flow [2024-06-28 02:03:50,221 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-06-28 02:03:50,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:50,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:50,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:03:50,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:50,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -251423507, now seen corresponding path program 1 times [2024-06-28 02:03:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51022428] [2024-06-28 02:03:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51022428] [2024-06-28 02:03:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51022428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565194743] [2024-06-28 02:03:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:52,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:52,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:52,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 117 transitions, 1021 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-06-28 02:03:52,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:52,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:56,827 INFO L124 PetriNetUnfolderBase]: 20676/29233 cut-off events. [2024-06-28 02:03:56,827 INFO L125 PetriNetUnfolderBase]: For 149064/149064 co-relation queries the response was YES. [2024-06-28 02:03:56,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113112 conditions, 29233 events. 20676/29233 cut-off events. For 149064/149064 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 179333 event pairs, 8884 based on Foata normal form. 18/29246 useless extension candidates. Maximal degree in co-relation 113073. Up to 26026 conditions per place. [2024-06-28 02:03:57,135 INFO L140 encePairwiseOnDemand]: 40/57 looper letters, 212 selfloop transitions, 66 changer transitions 0/286 dead transitions. [2024-06-28 02:03:57,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 286 transitions, 2839 flow [2024-06-28 02:03:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:03:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:03:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 284 transitions. [2024-06-28 02:03:57,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536062378167641 [2024-06-28 02:03:57,142 INFO L175 Difference]: Start difference. First operand has 102 places, 117 transitions, 1021 flow. Second operand 9 states and 284 transitions. [2024-06-28 02:03:57,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 286 transitions, 2839 flow [2024-06-28 02:03:57,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 286 transitions, 2695 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 02:03:57,546 INFO L231 Difference]: Finished difference. Result has 112 places, 181 transitions, 1907 flow [2024-06-28 02:03:57,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1907, PETRI_PLACES=112, PETRI_TRANSITIONS=181} [2024-06-28 02:03:57,548 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 49 predicate places. [2024-06-28 02:03:57,548 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 181 transitions, 1907 flow [2024-06-28 02:03:57,548 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-06-28 02:03:57,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:57,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:03:57,549 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:57,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2000542877, now seen corresponding path program 2 times [2024-06-28 02:03:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082299715] [2024-06-28 02:03:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082299715] [2024-06-28 02:04:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082299715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:04:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798660377] [2024-06-28 02:04:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:04:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:04:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:04:00,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:04:00,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 181 transitions, 1907 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-06-28 02:04:00,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:00,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:04:00,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:04:06,270 INFO L124 PetriNetUnfolderBase]: 21066/29837 cut-off events. [2024-06-28 02:04:06,270 INFO L125 PetriNetUnfolderBase]: For 187414/187416 co-relation queries the response was YES. [2024-06-28 02:04:06,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123983 conditions, 29837 events. 21066/29837 cut-off events. For 187414/187416 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 185215 event pairs, 6887 based on Foata normal form. 18/29850 useless extension candidates. Maximal degree in co-relation 123938. Up to 25168 conditions per place. [2024-06-28 02:04:06,493 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 155 selfloop transitions, 97 changer transitions 0/260 dead transitions. [2024-06-28 02:04:06,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 260 transitions, 2793 flow [2024-06-28 02:04:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:04:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:04:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-06-28 02:04:06,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5764411027568922 [2024-06-28 02:04:06,495 INFO L175 Difference]: Start difference. First operand has 112 places, 181 transitions, 1907 flow. Second operand 7 states and 230 transitions. [2024-06-28 02:04:06,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 260 transitions, 2793 flow [2024-06-28 02:04:06,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 260 transitions, 2767 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 02:04:06,787 INFO L231 Difference]: Finished difference. Result has 118 places, 185 transitions, 2163 flow [2024-06-28 02:04:06,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2163, PETRI_PLACES=118, PETRI_TRANSITIONS=185} [2024-06-28 02:04:06,788 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2024-06-28 02:04:06,788 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 185 transitions, 2163 flow [2024-06-28 02:04:06,789 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-06-28 02:04:06,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:06,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:04:06,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:04:06,789 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:06,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 706367173, now seen corresponding path program 1 times [2024-06-28 02:04:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:06,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64386914] [2024-06-28 02:04:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64386914] [2024-06-28 02:04:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64386914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:10,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:04:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568298615] [2024-06-28 02:04:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:10,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:04:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:04:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:04:10,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:04:10,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 185 transitions, 2163 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-06-28 02:04:10,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:10,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:04:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:04:15,518 INFO L124 PetriNetUnfolderBase]: 20988/29723 cut-off events. [2024-06-28 02:04:15,518 INFO L125 PetriNetUnfolderBase]: For 215101/215103 co-relation queries the response was YES. [2024-06-28 02:04:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127109 conditions, 29723 events. 20988/29723 cut-off events. For 215101/215103 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 183820 event pairs, 6845 based on Foata normal form. 36/29754 useless extension candidates. Maximal degree in co-relation 127061. Up to 25132 conditions per place. [2024-06-28 02:04:15,797 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 152 selfloop transitions, 97 changer transitions 0/257 dead transitions. [2024-06-28 02:04:15,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 257 transitions, 2893 flow [2024-06-28 02:04:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:04:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:04:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-06-28 02:04:15,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568922305764411 [2024-06-28 02:04:15,799 INFO L175 Difference]: Start difference. First operand has 118 places, 185 transitions, 2163 flow. Second operand 7 states and 227 transitions. [2024-06-28 02:04:15,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 257 transitions, 2893 flow [2024-06-28 02:04:16,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 257 transitions, 2778 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-28 02:04:16,168 INFO L231 Difference]: Finished difference. Result has 121 places, 185 transitions, 2254 flow [2024-06-28 02:04:16,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2254, PETRI_PLACES=121, PETRI_TRANSITIONS=185} [2024-06-28 02:04:16,169 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2024-06-28 02:04:16,169 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 185 transitions, 2254 flow [2024-06-28 02:04:16,170 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-06-28 02:04:16,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:16,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:04:16,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:04:16,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:16,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1186544959, now seen corresponding path program 2 times [2024-06-28 02:04:16,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340069888] [2024-06-28 02:04:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340069888] [2024-06-28 02:04:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340069888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:19,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:04:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871769312] [2024-06-28 02:04:19,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:19,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:04:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:04:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:04:19,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:04:19,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 185 transitions, 2254 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-06-28 02:04:19,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:19,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:04:19,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand