./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:24:16,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:16,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:24:16,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:16,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:16,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:16,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:16,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:16,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:16,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:16,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:16,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:16,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:16,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:16,097 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:16,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:16,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:16,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:16,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:16,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:16,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:16,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:16,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:16,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:16,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:16,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:16,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:16,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:16,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:16,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:16,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:16,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:16,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:16,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:16,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:16,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:16,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:16,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:16,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:16,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:16,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:16,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:16,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:16,104 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-02-07 14:24:16,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:16,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:16,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:16,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:16,322 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:16,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:17,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:17,704 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:17,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:17,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be73d25b/9b2c940807484d83a5bf32abc9f10d49/FLAGc1cbcc6c4 [2024-02-07 14:24:18,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be73d25b/9b2c940807484d83a5bf32abc9f10d49 [2024-02-07 14:24:18,046 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:18,047 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:18,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 14:24:18,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:18,131 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:18,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:18,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:18,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:18,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:18" (1/2) ... [2024-02-07 14:24:18,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737470d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:18, skipping insertion in model container [2024-02-07 14:24:18,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:18" (1/2) ... [2024-02-07 14:24:18,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@760d6758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:18, skipping insertion in model container [2024-02-07 14:24:18,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:18" (2/2) ... [2024-02-07 14:24:18,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737470d8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18, skipping insertion in model container [2024-02-07 14:24:18,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:18" (2/2) ... [2024-02-07 14:24:18,140 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:18,205 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L781-L781] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 0 <= __unbuffered_cnt [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] 0 <= __unbuffered_cnt [2024-02-07 14:24:18,206 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] x == 1 [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 1 <= __unbuffered_cnt [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L782-L782] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] y == 2 [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] 1 <= __unbuffered_cnt [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] ((((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (y == 2)) && (__unbuffered_p0_EAX == 2 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L780-L780] 0 <= __unbuffered_cnt [2024-02-07 14:24:18,207 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:18,208 INFO L76 edCorrectnessWitness]: Location invariant before [L739-L739] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:24:18,208 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 0 <= __unbuffered_cnt [2024-02-07 14:24:18,208 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2) [2024-02-07 14:24:18,208 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] y == 1 [2024-02-07 14:24:18,208 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 1 <= __unbuffered_cnt [2024-02-07 14:24:18,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:18,372 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 14:24:18,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:18,482 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:18,518 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:24:18,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:18,629 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:18,629 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18 WrapperNode [2024-02-07 14:24:18,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:18,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:18,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:18,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:18,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,684 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 14:24:18,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:18,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:18,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:18,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:18,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,710 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 14:24:18,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:18,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:18,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:18,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:18,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (1/1) ... [2024-02-07 14:24:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:18,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:18,926 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-02-07 14:24:18,931 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-02-07 14:24:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:24:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:24:18,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:24:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:24:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:18,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:18,967 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:24:19,064 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:19,068 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:19,360 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:19,360 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:19,462 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:19,463 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:19,464 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:19 BoogieIcfgContainer [2024-02-07 14:24:19,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:19,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:19,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:19,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:19,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:18" (1/4) ... [2024-02-07 14:24:19,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6357fc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:19, skipping insertion in model container [2024-02-07 14:24:19,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:18" (2/4) ... [2024-02-07 14:24:19,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6357fc6b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:19, skipping insertion in model container [2024-02-07 14:24:19,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:18" (3/4) ... [2024-02-07 14:24:19,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6357fc6b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:19, skipping insertion in model container [2024-02-07 14:24:19,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:19" (4/4) ... [2024-02-07 14:24:19,487 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:24:19,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:19,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-02-07 14:24:19,501 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:19,548 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:19,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 58 transitions, 128 flow [2024-02-07 14:24:19,612 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-02-07 14:24:19,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:19,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-02-07 14:24:19,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 58 transitions, 128 flow [2024-02-07 14:24:19,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 55 transitions, 119 flow [2024-02-07 14:24:19,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:19,637 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79bf47f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:19,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-02-07 14:24:19,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:19,641 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:24:19,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:19,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:19,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:19,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:19,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash 9294719, now seen corresponding path program 1 times [2024-02-07 14:24:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209272650] [2024-02-07 14:24:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:19,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209272650] [2024-02-07 14:24:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209272650] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:19,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365942926] [2024-02-07 14:24:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:19,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:19,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:19,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:19,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:19,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:19,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:20,819 INFO L124 PetriNetUnfolderBase]: 5235/9149 cut-off events. [2024-02-07 14:24:20,820 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-02-07 14:24:20,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16724 conditions, 9149 events. 5235/9149 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 70231 event pairs, 1823 based on Foata normal form. 224/6767 useless extension candidates. Maximal degree in co-relation 16713. Up to 7099 conditions per place. [2024-02-07 14:24:20,875 INFO L140 encePairwiseOnDemand]: 42/58 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-02-07 14:24:20,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 224 flow [2024-02-07 14:24:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-07 14:24:20,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-02-07 14:24:20,885 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 119 flow. Second operand 3 states and 118 transitions. [2024-02-07 14:24:20,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 224 flow [2024-02-07 14:24:20,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:20,890 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2024-02-07 14:24:20,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-02-07 14:24:20,894 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2024-02-07 14:24:20,895 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2024-02-07 14:24:20,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:20,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:20,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:24:20,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:24:20,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:20,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash 341349827, now seen corresponding path program 1 times [2024-02-07 14:24:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205107410] [2024-02-07 14:24:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205107410] [2024-02-07 14:24:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205107410] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379635755] [2024-02-07 14:24:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:20,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:20,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:20,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:20,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:20,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:21,502 INFO L124 PetriNetUnfolderBase]: 4908/7880 cut-off events. [2024-02-07 14:24:21,503 INFO L125 PetriNetUnfolderBase]: For 1042/1047 co-relation queries the response was YES. [2024-02-07 14:24:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16264 conditions, 7880 events. 4908/7880 cut-off events. For 1042/1047 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 56584 event pairs, 1764 based on Foata normal form. 1/6232 useless extension candidates. Maximal degree in co-relation 16253. Up to 4457 conditions per place. [2024-02-07 14:24:21,548 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 14:24:21,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 287 flow [2024-02-07 14:24:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 14:24:21,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-02-07 14:24:21,551 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 103 transitions. [2024-02-07 14:24:21,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 287 flow [2024-02-07 14:24:21,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:21,554 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 120 flow [2024-02-07 14:24:21,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-02-07 14:24:21,555 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2024-02-07 14:24:21,555 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 120 flow [2024-02-07 14:24:21,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:21,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:21,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:21,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:24:21,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:21,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2021427279, now seen corresponding path program 1 times [2024-02-07 14:24:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412906228] [2024-02-07 14:24:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412906228] [2024-02-07 14:24:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412906228] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:21,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633134664] [2024-02-07 14:24:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:21,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:21,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:21,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:21,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:21,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:21,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:22,079 INFO L124 PetriNetUnfolderBase]: 3785/5685 cut-off events. [2024-02-07 14:24:22,080 INFO L125 PetriNetUnfolderBase]: For 1190/1197 co-relation queries the response was YES. [2024-02-07 14:24:22,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12711 conditions, 5685 events. 3785/5685 cut-off events. For 1190/1197 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 33361 event pairs, 1253 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 12698. Up to 4997 conditions per place. [2024-02-07 14:24:22,101 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 51 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-07 14:24:22,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 297 flow [2024-02-07 14:24:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 14:24:22,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-02-07 14:24:22,103 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 120 flow. Second operand 3 states and 106 transitions. [2024-02-07 14:24:22,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 297 flow [2024-02-07 14:24:22,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:22,104 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 148 flow [2024-02-07 14:24:22,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-02-07 14:24:22,105 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2024-02-07 14:24:22,105 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 148 flow [2024-02-07 14:24:22,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:22,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:22,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:24:22,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:22,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1232181015, now seen corresponding path program 1 times [2024-02-07 14:24:22,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:22,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533145570] [2024-02-07 14:24:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533145570] [2024-02-07 14:24:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533145570] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159224178] [2024-02-07 14:24:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:22,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:22,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:22,543 INFO L124 PetriNetUnfolderBase]: 3470/5648 cut-off events. [2024-02-07 14:24:22,543 INFO L125 PetriNetUnfolderBase]: For 1482/1488 co-relation queries the response was YES. [2024-02-07 14:24:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13512 conditions, 5648 events. 3470/5648 cut-off events. For 1482/1488 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37505 event pairs, 1634 based on Foata normal form. 141/5097 useless extension candidates. Maximal degree in co-relation 13498. Up to 3134 conditions per place. [2024-02-07 14:24:22,569 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 58 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2024-02-07 14:24:22,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 342 flow [2024-02-07 14:24:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 14:24:22,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2024-02-07 14:24:22,572 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 148 flow. Second operand 3 states and 102 transitions. [2024-02-07 14:24:22,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 342 flow [2024-02-07 14:24:22,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:22,575 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 140 flow [2024-02-07 14:24:22,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-02-07 14:24:22,576 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2024-02-07 14:24:22,576 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 140 flow [2024-02-07 14:24:22,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:22,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:22,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:24:22,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:22,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1329489898, now seen corresponding path program 1 times [2024-02-07 14:24:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613819959] [2024-02-07 14:24:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613819959] [2024-02-07 14:24:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613819959] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:22,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795453866] [2024-02-07 14:24:22,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:22,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:22,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:22,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,101 INFO L124 PetriNetUnfolderBase]: 4877/8412 cut-off events. [2024-02-07 14:24:23,102 INFO L125 PetriNetUnfolderBase]: For 2188/2201 co-relation queries the response was YES. [2024-02-07 14:24:23,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 8412 events. 4877/8412 cut-off events. For 2188/2201 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 63798 event pairs, 2454 based on Foata normal form. 267/7399 useless extension candidates. Maximal degree in co-relation 19166. Up to 4157 conditions per place. [2024-02-07 14:24:23,138 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 54 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-02-07 14:24:23,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 324 flow [2024-02-07 14:24:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 14:24:23,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-02-07 14:24:23,140 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 140 flow. Second operand 3 states and 103 transitions. [2024-02-07 14:24:23,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 324 flow [2024-02-07 14:24:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:23,143 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 152 flow [2024-02-07 14:24:23,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-02-07 14:24:23,145 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 14:24:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 152 flow [2024-02-07 14:24:23,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:24:23,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:23,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1381668894, now seen corresponding path program 1 times [2024-02-07 14:24:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50048945] [2024-02-07 14:24:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50048945] [2024-02-07 14:24:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50048945] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241412316] [2024-02-07 14:24:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:23,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 14:24:23,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 14:24:23,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,712 INFO L124 PetriNetUnfolderBase]: 4877/8742 cut-off events. [2024-02-07 14:24:23,713 INFO L125 PetriNetUnfolderBase]: For 3511/3519 co-relation queries the response was YES. [2024-02-07 14:24:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20271 conditions, 8742 events. 4877/8742 cut-off events. For 3511/3519 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 69208 event pairs, 4429 based on Foata normal form. 0/7277 useless extension candidates. Maximal degree in co-relation 20257. Up to 7219 conditions per place. [2024-02-07 14:24:23,763 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 14:24:23,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 218 flow [2024-02-07 14:24:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-02-07 14:24:23,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-02-07 14:24:23,765 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 152 flow. Second operand 3 states and 78 transitions. [2024-02-07 14:24:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 218 flow [2024-02-07 14:24:23,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 213 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:23,774 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 147 flow [2024-02-07 14:24:23,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 14:24:23,776 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 14:24:23,777 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 147 flow [2024-02-07 14:24:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:24:23,777 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:23,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 119526450, now seen corresponding path program 1 times [2024-02-07 14:24:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436970355] [2024-02-07 14:24:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436970355] [2024-02-07 14:24:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436970355] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472806683] [2024-02-07 14:24:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:23,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:23,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:23,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:24,281 INFO L124 PetriNetUnfolderBase]: 4348/7402 cut-off events. [2024-02-07 14:24:24,282 INFO L125 PetriNetUnfolderBase]: For 2266/2274 co-relation queries the response was YES. [2024-02-07 14:24:24,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 7402 events. 4348/7402 cut-off events. For 2266/2274 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 53380 event pairs, 1796 based on Foata normal form. 168/6397 useless extension candidates. Maximal degree in co-relation 17240. Up to 3440 conditions per place. [2024-02-07 14:24:24,320 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2024-02-07 14:24:24,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 316 flow [2024-02-07 14:24:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 14:24:24,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-02-07 14:24:24,321 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 147 flow. Second operand 3 states and 100 transitions. [2024-02-07 14:24:24,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 316 flow [2024-02-07 14:24:24,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:24,324 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 146 flow [2024-02-07 14:24:24,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-02-07 14:24:24,325 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 14:24:24,325 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 146 flow [2024-02-07 14:24:24,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:24,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:24,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:24,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:24:24,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:24,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash -638903580, now seen corresponding path program 1 times [2024-02-07 14:24:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815112865] [2024-02-07 14:24:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815112865] [2024-02-07 14:24:24,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815112865] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:24,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:24,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493771816] [2024-02-07 14:24:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:24,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:24,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 14:24:24,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:24,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:24,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 14:24:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:24,866 INFO L124 PetriNetUnfolderBase]: 4277/7687 cut-off events. [2024-02-07 14:24:24,866 INFO L125 PetriNetUnfolderBase]: For 2699/2705 co-relation queries the response was YES. [2024-02-07 14:24:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17863 conditions, 7687 events. 4277/7687 cut-off events. For 2699/2705 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59272 event pairs, 953 based on Foata normal form. 233/6596 useless extension candidates. Maximal degree in co-relation 17852. Up to 3693 conditions per place. [2024-02-07 14:24:24,901 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 57 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-02-07 14:24:24,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 382 flow [2024-02-07 14:24:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-02-07 14:24:24,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2024-02-07 14:24:24,903 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 146 flow. Second operand 4 states and 122 transitions. [2024-02-07 14:24:24,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 382 flow [2024-02-07 14:24:24,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:24,905 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 169 flow [2024-02-07 14:24:24,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-02-07 14:24:24,905 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-02-07 14:24:24,905 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 169 flow [2024-02-07 14:24:24,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:24,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:24,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:24,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:24:24,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:24,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1100029062, now seen corresponding path program 1 times [2024-02-07 14:24:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700620786] [2024-02-07 14:24:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:24,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-02-07 14:24:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:24,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700620786] [2024-02-07 14:24:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700620786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:24,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169717033] [2024-02-07 14:24:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:24,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:24,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:24,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:24,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:25,127 INFO L124 PetriNetUnfolderBase]: 2226/4066 cut-off events. [2024-02-07 14:24:25,127 INFO L125 PetriNetUnfolderBase]: For 2471/2477 co-relation queries the response was YES. [2024-02-07 14:24:25,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9900 conditions, 4066 events. 2226/4066 cut-off events. For 2471/2477 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 27734 event pairs, 1098 based on Foata normal form. 124/3974 useless extension candidates. Maximal degree in co-relation 9886. Up to 3199 conditions per place. [2024-02-07 14:24:25,144 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 37 selfloop transitions, 3 changer transitions 2/55 dead transitions. [2024-02-07 14:24:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 281 flow [2024-02-07 14:24:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 14:24:25,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-02-07 14:24:25,145 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 169 flow. Second operand 3 states and 93 transitions. [2024-02-07 14:24:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 281 flow [2024-02-07 14:24:25,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:25,147 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 147 flow [2024-02-07 14:24:25,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-02-07 14:24:25,148 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 14:24:25,148 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 147 flow [2024-02-07 14:24:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:25,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:25,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:24:25,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:25,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -365003835, now seen corresponding path program 1 times [2024-02-07 14:24:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494230091] [2024-02-07 14:24:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494230091] [2024-02-07 14:24:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494230091] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832210539] [2024-02-07 14:24:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:25,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:25,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:25,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:25,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:25,391 INFO L124 PetriNetUnfolderBase]: 1799/3509 cut-off events. [2024-02-07 14:24:25,392 INFO L125 PetriNetUnfolderBase]: For 1895/1895 co-relation queries the response was YES. [2024-02-07 14:24:25,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8206 conditions, 3509 events. 1799/3509 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 25004 event pairs, 1199 based on Foata normal form. 2/3303 useless extension candidates. Maximal degree in co-relation 8193. Up to 2697 conditions per place. [2024-02-07 14:24:25,408 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-02-07 14:24:25,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 295 flow [2024-02-07 14:24:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-02-07 14:24:25,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698275862068966 [2024-02-07 14:24:25,410 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 147 flow. Second operand 4 states and 109 transitions. [2024-02-07 14:24:25,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 295 flow [2024-02-07 14:24:25,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 272 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:25,412 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 172 flow [2024-02-07 14:24:25,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-02-07 14:24:25,413 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-02-07 14:24:25,413 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 172 flow [2024-02-07 14:24:25,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:25,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:25,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:24:25,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:25,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2076815497, now seen corresponding path program 1 times [2024-02-07 14:24:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:25,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136164463] [2024-02-07 14:24:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136164463] [2024-02-07 14:24:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136164463] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007078794] [2024-02-07 14:24:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:25,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:25,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 14:24:25,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:25,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 14:24:25,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:25,664 INFO L124 PetriNetUnfolderBase]: 1354/2517 cut-off events. [2024-02-07 14:24:25,664 INFO L125 PetriNetUnfolderBase]: For 1329/1335 co-relation queries the response was YES. [2024-02-07 14:24:25,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2517 events. 1354/2517 cut-off events. For 1329/1335 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 15368 event pairs, 124 based on Foata normal form. 124/2533 useless extension candidates. Maximal degree in co-relation 6104. Up to 849 conditions per place. [2024-02-07 14:24:25,674 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 64 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2024-02-07 14:24:25,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 471 flow [2024-02-07 14:24:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-07 14:24:25,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2024-02-07 14:24:25,676 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 172 flow. Second operand 5 states and 144 transitions. [2024-02-07 14:24:25,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 471 flow [2024-02-07 14:24:25,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 464 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:25,679 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 215 flow [2024-02-07 14:24:25,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2024-02-07 14:24:25,679 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-02-07 14:24:25,679 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 215 flow [2024-02-07 14:24:25,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:25,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:25,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:24:25,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:25,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2054286336, now seen corresponding path program 1 times [2024-02-07 14:24:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798825791] [2024-02-07 14:24:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798825791] [2024-02-07 14:24:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798825791] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:25,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582716284] [2024-02-07 14:24:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:25,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:25,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:25,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:25,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:25,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:25,973 INFO L124 PetriNetUnfolderBase]: 1232/2387 cut-off events. [2024-02-07 14:24:25,974 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-02-07 14:24:25,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6339 conditions, 2387 events. 1232/2387 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14857 event pairs, 420 based on Foata normal form. 4/2285 useless extension candidates. Maximal degree in co-relation 6322. Up to 1778 conditions per place. [2024-02-07 14:24:25,986 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 49 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2024-02-07 14:24:25,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 429 flow [2024-02-07 14:24:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-02-07 14:24:25,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2024-02-07 14:24:25,987 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 215 flow. Second operand 4 states and 113 transitions. [2024-02-07 14:24:25,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 429 flow [2024-02-07 14:24:25,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 390 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:25,991 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 240 flow [2024-02-07 14:24:25,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2024-02-07 14:24:25,992 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2024-02-07 14:24:25,992 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 240 flow [2024-02-07 14:24:25,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:25,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:25,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:24:25,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:25,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1194328634, now seen corresponding path program 2 times [2024-02-07 14:24:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597019698] [2024-02-07 14:24:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597019698] [2024-02-07 14:24:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597019698] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:26,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316983149] [2024-02-07 14:24:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:26,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:26,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:26,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:26,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:26,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:26,264 INFO L124 PetriNetUnfolderBase]: 1224/2375 cut-off events. [2024-02-07 14:24:26,264 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-02-07 14:24:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 2375 events. 1224/2375 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14808 event pairs, 404 based on Foata normal form. 4/2273 useless extension candidates. Maximal degree in co-relation 6160. Up to 1682 conditions per place. [2024-02-07 14:24:26,274 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 60 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-02-07 14:24:26,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 494 flow [2024-02-07 14:24:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-02-07 14:24:26,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-02-07 14:24:26,294 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 240 flow. Second operand 5 states and 140 transitions. [2024-02-07 14:24:26,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 494 flow [2024-02-07 14:24:26,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 492 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:26,297 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 260 flow [2024-02-07 14:24:26,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-02-07 14:24:26,298 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2024-02-07 14:24:26,298 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 260 flow [2024-02-07 14:24:26,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:26,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:26,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:24:26,298 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:26,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -832786777, now seen corresponding path program 1 times [2024-02-07 14:24:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147207259] [2024-02-07 14:24:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:26,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:26,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:26,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147207259] [2024-02-07 14:24:26,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147207259] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:26,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:26,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:26,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008215466] [2024-02-07 14:24:26,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:26,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:26,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:26,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:26,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:26,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:26,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:26,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:26,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:26,596 INFO L124 PetriNetUnfolderBase]: 1216/2363 cut-off events. [2024-02-07 14:24:26,596 INFO L125 PetriNetUnfolderBase]: For 2195/2197 co-relation queries the response was YES. [2024-02-07 14:24:26,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 2363 events. 1216/2363 cut-off events. For 2195/2197 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14703 event pairs, 669 based on Foata normal form. 4/2259 useless extension candidates. Maximal degree in co-relation 6340. Up to 1707 conditions per place. [2024-02-07 14:24:26,608 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 60 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-02-07 14:24:26,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 82 transitions, 527 flow [2024-02-07 14:24:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-07 14:24:26,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2024-02-07 14:24:26,609 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 260 flow. Second operand 4 states and 119 transitions. [2024-02-07 14:24:26,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 82 transitions, 527 flow [2024-02-07 14:24:26,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 501 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:26,612 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 296 flow [2024-02-07 14:24:26,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-02-07 14:24:26,613 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-02-07 14:24:26,613 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 296 flow [2024-02-07 14:24:26,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:26,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:26,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:24:26,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:26,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 586582573, now seen corresponding path program 2 times [2024-02-07 14:24:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:26,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457587166] [2024-02-07 14:24:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457587166] [2024-02-07 14:24:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457587166] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:26,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:24:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990292048] [2024-02-07 14:24:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:26,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 14:24:26,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:26,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 14:24:26,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:26,876 INFO L124 PetriNetUnfolderBase]: 868/1485 cut-off events. [2024-02-07 14:24:26,876 INFO L125 PetriNetUnfolderBase]: For 1783/1789 co-relation queries the response was YES. [2024-02-07 14:24:26,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 1485 events. 868/1485 cut-off events. For 1783/1789 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7095 event pairs, 86 based on Foata normal form. 72/1529 useless extension candidates. Maximal degree in co-relation 4446. Up to 512 conditions per place. [2024-02-07 14:24:26,883 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 72 selfloop transitions, 11 changer transitions 1/97 dead transitions. [2024-02-07 14:24:26,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 664 flow [2024-02-07 14:24:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:24:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:24:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-02-07 14:24:26,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-02-07 14:24:26,884 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 296 flow. Second operand 6 states and 156 transitions. [2024-02-07 14:24:26,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 664 flow [2024-02-07 14:24:26,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 627 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:26,887 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 310 flow [2024-02-07 14:24:26,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-02-07 14:24:26,887 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2024-02-07 14:24:26,887 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 310 flow [2024-02-07 14:24:26,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:26,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:26,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:24:26,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:26,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash 633726462, now seen corresponding path program 1 times [2024-02-07 14:24:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:26,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134236629] [2024-02-07 14:24:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134236629] [2024-02-07 14:24:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134236629] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773355319] [2024-02-07 14:24:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:26,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 14:24:26,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:26,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:26,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 14:24:26,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:27,133 INFO L124 PetriNetUnfolderBase]: 1186/2188 cut-off events. [2024-02-07 14:24:27,133 INFO L125 PetriNetUnfolderBase]: For 3660/3668 co-relation queries the response was YES. [2024-02-07 14:24:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 2188 events. 1186/2188 cut-off events. For 3660/3668 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12678 event pairs, 213 based on Foata normal form. 16/2169 useless extension candidates. Maximal degree in co-relation 6633. Up to 861 conditions per place. [2024-02-07 14:24:27,142 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 76 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-02-07 14:24:27,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 758 flow [2024-02-07 14:24:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 14:24:27,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-02-07 14:24:27,143 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 310 flow. Second operand 5 states and 148 transitions. [2024-02-07 14:24:27,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 758 flow [2024-02-07 14:24:27,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 588 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-02-07 14:24:27,151 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 318 flow [2024-02-07 14:24:27,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-02-07 14:24:27,152 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2024-02-07 14:24:27,152 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 318 flow [2024-02-07 14:24:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:27,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:27,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:27,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:24:27,153 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 14:24:27,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -578541336, now seen corresponding path program 2 times [2024-02-07 14:24:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618095542] [2024-02-07 14:24:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:27,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:24:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:27,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:24:27,196 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:24:27,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 37 remaining) [2024-02-07 14:24:27,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 37 remaining) [2024-02-07 14:24:27,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 37 remaining) [2024-02-07 14:24:27,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2024-02-07 14:24:27,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 37 remaining) [2024-02-07 14:24:27,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 37 remaining) [2024-02-07 14:24:27,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 37 remaining) [2024-02-07 14:24:27,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 37 remaining) [2024-02-07 14:24:27,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 37 remaining) [2024-02-07 14:24:27,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 37 remaining) [2024-02-07 14:24:27,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 37 remaining) [2024-02-07 14:24:27,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 14:24:27,203 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:27,207 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:24:27,208 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:24:27,246 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-02-07 14:24:27,246 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-02-07 14:24:27,246 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:24:27 BasicIcfg [2024-02-07 14:24:27,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:24:27,247 INFO L158 Benchmark]: Toolchain (without parser) took 9116.04ms. Allocated memory was 136.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 62.1MB in the beginning and 765.2MB in the end (delta: -703.1MB). Peak memory consumption was 435.9MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,247 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 69.0MB in the end (delta: 76.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:27,247 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:27,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.17ms. Allocated memory is still 136.3MB. Free memory was 61.9MB in the beginning and 83.7MB in the end (delta: -21.8MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.84ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,248 INFO L158 Benchmark]: Boogie Preprocessor took 53.45ms. Allocated memory is still 136.3MB. Free memory was 81.6MB in the beginning and 79.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,248 INFO L158 Benchmark]: RCFGBuilder took 725.29ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 46.8MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,248 INFO L158 Benchmark]: TraceAbstraction took 7767.14ms. Allocated memory was 136.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.9MB in the beginning and 765.2MB in the end (delta: -660.3MB). Peak memory consumption was 476.0MB. Max. memory is 16.1GB. [2024-02-07 14:24:27,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 69.0MB in the end (delta: 76.7kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.17ms. Allocated memory is still 136.3MB. Free memory was 61.9MB in the beginning and 83.7MB in the end (delta: -21.8MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.84ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.45ms. Allocated memory is still 136.3MB. Free memory was 81.6MB in the beginning and 79.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 725.29ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 46.8MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7767.14ms. Allocated memory was 136.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.9MB in the beginning and 765.2MB in the end (delta: -660.3MB). Peak memory consumption was 476.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 786]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L773] 0 pthread_t t1991; [L774] FCALL, FORK 0 pthread_create(&t1991, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, x=0, y=0] [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L723] 1 __unbuffered_p0_EAX = y [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L775] 0 pthread_t t1992; [L776] FCALL, FORK 0 pthread_create(&t1992, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, x=0, y=0] [L738] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L738] 2 __unbuffered_p1_EAX = x [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 1 x = 1 [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L731] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L777] 0 pthread_t t1993; [L778] FCALL, FORK 0 pthread_create(&t1993, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=0] [L753] 3 y = 2 [L754] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L741] 2 y = 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L758] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L780] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L780] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L781] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=1] [L782] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L782] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L782] RET 0 assume_abort_if_not(main$tmp_guard0) [L786] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=1] - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 94 locations, 37 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=16, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:24:27,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE