./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.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/safe005_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe005_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe005_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:36,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:36,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:03:36,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:36,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:36,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:36,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:36,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:36,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:36,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:36,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:36,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:36,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:36,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:36,286 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:36,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:36,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:36,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:36,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:36,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:36,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:36,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:36,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:36,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:36,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:36,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:36,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:36,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:36,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:36,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:36,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:36,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:36,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:36,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:36,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:36,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:36,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:36,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:36,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:36,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:36,295 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:36,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:36,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:36,296 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 19:03:36,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:36,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:36,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:36,618 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:36,619 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:36,621 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/safe005_tso.yml/witness.yml [2024-02-07 19:03:36,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:36,770 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:36,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-02-07 19:03:38,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:38,331 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:38,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_tso.i [2024-02-07 19:03:38,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0efbb90a6/cec5965886234a00aa0389a7560faa39/FLAG0a6b21c3d [2024-02-07 19:03:38,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0efbb90a6/cec5965886234a00aa0389a7560faa39 [2024-02-07 19:03:38,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:38,365 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:38,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:38,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:38,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:38,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:36" (1/2) ... [2024-02-07 19:03:38,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df84ed1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:38, skipping insertion in model container [2024-02-07 19:03:38,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:36" (1/2) ... [2024-02-07 19:03:38,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@d57926f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:38, skipping insertion in model container [2024-02-07 19:03:38,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:38" (2/2) ... [2024-02-07 19:03:38,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df84ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:38, skipping insertion in model container [2024-02-07 19:03:38,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:38" (2/2) ... [2024-02-07 19:03:38,379 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:38,483 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L794-L794] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] (((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && (y == 2)) && ((__unbuffered_p0_EAX == 0 && (__unbuffered_p2_EAX == 1 || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) || ((((((0 <= __unbuffered_p0_EAX && 0 <= __unbuffered_p2_EAX) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2) [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2) [2024-02-07 19:03:38,485 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L751-L751] 1 <= __unbuffered_cnt [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L760-L760] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L743-L743] x == 1 [2024-02-07 19:03:38,486 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] y == 2 [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] 1 <= __unbuffered_cnt [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] 0 <= __unbuffered_cnt [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:38,487 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] 0 <= __unbuffered_cnt [2024-02-07 19:03:38,488 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] 1 <= __unbuffered_cnt [2024-02-07 19:03:38,488 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] 0 <= __unbuffered_cnt [2024-02-07 19:03:38,488 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:38,489 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] y == 1 [2024-02-07 19:03:38,542 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:38,756 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/safe005_tso.i[945,958] [2024-02-07 19:03:38,928 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:38,938 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:38,974 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/safe005_tso.i[945,958] 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 Start Parsing Local Start Parsing Local [2024-02-07 19:03:39,049 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:39,091 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:39,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39 WrapperNode [2024-02-07 19:03:39,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:39,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:39,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:39,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:39,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,149 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-02-07 19:03:39,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:39,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:39,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:39,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:39,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,194 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 19:03:39,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:39,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:39,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:39,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:39,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (1/1) ... [2024-02-07 19:03:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:39,248 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 19:03:39,249 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 19:03:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:39,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:39,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:39,286 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:39,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:39,293 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 19:03:39,422 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:39,424 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:39,631 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:39,632 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:39,835 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:39,835 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:39,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:39 BoogieIcfgContainer [2024-02-07 19:03:39,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:39,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:39,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:39,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:39,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:36" (1/4) ... [2024-02-07 19:03:39,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4691cb1e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:39, skipping insertion in model container [2024-02-07 19:03:39,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:38" (2/4) ... [2024-02-07 19:03:39,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4691cb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:39, skipping insertion in model container [2024-02-07 19:03:39,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:39" (3/4) ... [2024-02-07 19:03:39,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4691cb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:39, skipping insertion in model container [2024-02-07 19:03:39,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:39" (4/4) ... [2024-02-07 19:03:39,848 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_tso.i [2024-02-07 19:03:39,865 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:39,866 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:03:39,866 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:39,922 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 19:03:40,015 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2024-02-07 19:03:40,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:40,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-07 19:03:40,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 136 flow [2024-02-07 19:03:40,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 59 transitions, 127 flow [2024-02-07 19:03:40,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:40,050 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;@1faf52ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:40,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:03:40,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:40,059 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:40,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:40,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:40,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:40,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:40,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash 9796008, now seen corresponding path program 1 times [2024-02-07 19:03:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683657933] [2024-02-07 19:03:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:40,363 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 19:03:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683657933] [2024-02-07 19:03:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683657933] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:40,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:40,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154220624] [2024-02-07 19:03:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:03:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:40,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:03:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:03:40,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:40,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 19:03:40,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:40,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:40,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,015 INFO L124 PetriNetUnfolderBase]: 7577/12719 cut-off events. [2024-02-07 19:03:42,015 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 19:03:42,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23524 conditions, 12719 events. 7577/12719 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 100073 event pairs, 7577 based on Foata normal form. 294/9000 useless extension candidates. Maximal degree in co-relation 23513. Up to 10701 conditions per place. [2024-02-07 19:03:42,195 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 32 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-02-07 19:03:42,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 167 flow [2024-02-07 19:03:42,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:03:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:03:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2024-02-07 19:03:42,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-07 19:03:42,210 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 127 flow. Second operand 2 states and 80 transitions. [2024-02-07 19:03:42,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 167 flow [2024-02-07 19:03:42,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:42,222 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2024-02-07 19:03:42,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-02-07 19:03:42,227 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2024-02-07 19:03:42,228 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2024-02-07 19:03:42,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 19:03:42,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:03:42,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:42,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:42,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash 824040298, now seen corresponding path program 1 times [2024-02-07 19:03:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479570812] [2024-02-07 19:03:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,387 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 19:03:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479570812] [2024-02-07 19:03:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479570812] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699469229] [2024-02-07 19:03:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:42,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:42,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:42,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 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 19:03:42,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:42,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:42,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:43,353 INFO L124 PetriNetUnfolderBase]: 7372/11166 cut-off events. [2024-02-07 19:03:43,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:43,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21684 conditions, 11166 events. 7372/11166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 76681 event pairs, 1007 based on Foata normal form. 0/7946 useless extension candidates. Maximal degree in co-relation 21681. Up to 9252 conditions per place. [2024-02-07 19:03:43,439 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 52 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 19:03:43,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 254 flow [2024-02-07 19:03:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:03:43,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-02-07 19:03:43,442 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:03:43,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 254 flow [2024-02-07 19:03:43,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:03:43,447 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 108 flow [2024-02-07 19:03:43,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 19:03:43,448 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-02-07 19:03:43,448 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 108 flow [2024-02-07 19:03:43,448 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 19:03:43,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:43,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:43,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:43,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:43,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 226761029, now seen corresponding path program 1 times [2024-02-07 19:03:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505217876] [2024-02-07 19:03:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:43,505 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 19:03:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505217876] [2024-02-07 19:03:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505217876] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629177051] [2024-02-07 19:03:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:43,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:43,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:43,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:43,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:43,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:44,228 INFO L124 PetriNetUnfolderBase]: 5639/8552 cut-off events. [2024-02-07 19:03:44,229 INFO L125 PetriNetUnfolderBase]: For 631/631 co-relation queries the response was YES. [2024-02-07 19:03:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17696 conditions, 8552 events. 5639/8552 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 54276 event pairs, 1891 based on Foata normal form. 0/6677 useless extension candidates. Maximal degree in co-relation 17691. Up to 6682 conditions per place. [2024-02-07 19:03:44,289 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 51 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-02-07 19:03:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 273 flow [2024-02-07 19:03:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 19:03:44,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-02-07 19:03:44,295 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 108 flow. Second operand 3 states and 113 transitions. [2024-02-07 19:03:44,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 273 flow [2024-02-07 19:03:44,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:44,299 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 136 flow [2024-02-07 19:03:44,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-02-07 19:03:44,301 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 19:03:44,302 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 136 flow [2024-02-07 19:03:44,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:44,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:44,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:44,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:44,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:44,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash 226762434, now seen corresponding path program 1 times [2024-02-07 19:03:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:44,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101561132] [2024-02-07 19:03:44,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:44,413 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 19:03:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101561132] [2024-02-07 19:03:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101561132] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484971305] [2024-02-07 19:03:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:44,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:44,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 136 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 19:03:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:45,237 INFO L124 PetriNetUnfolderBase]: 5463/9207 cut-off events. [2024-02-07 19:03:45,237 INFO L125 PetriNetUnfolderBase]: For 1215/1215 co-relation queries the response was YES. [2024-02-07 19:03:45,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20019 conditions, 9207 events. 5463/9207 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 68091 event pairs, 2780 based on Foata normal form. 0/7342 useless extension candidates. Maximal degree in co-relation 20013. Up to 7722 conditions per place. [2024-02-07 19:03:45,318 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-02-07 19:03:45,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 280 flow [2024-02-07 19:03:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:03:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2024-02-07 19:03:45,320 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 136 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:03:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 280 flow [2024-02-07 19:03:45,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:45,323 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 155 flow [2024-02-07 19:03:45,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-02-07 19:03:45,324 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 19:03:45,324 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 155 flow [2024-02-07 19:03:45,324 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 19:03:45,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:45,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:45,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:45,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1560342343, now seen corresponding path program 1 times [2024-02-07 19:03:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895057932] [2024-02-07 19:03:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:45,410 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 19:03:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895057932] [2024-02-07 19:03:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895057932] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:45,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:45,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840376977] [2024-02-07 19:03:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:45,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:45,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:03:45,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 19:03:45,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:45,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:03:45,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:46,129 INFO L124 PetriNetUnfolderBase]: 5463/9250 cut-off events. [2024-02-07 19:03:46,129 INFO L125 PetriNetUnfolderBase]: For 2518/2518 co-relation queries the response was YES. [2024-02-07 19:03:46,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21231 conditions, 9250 events. 5463/9250 cut-off events. For 2518/2518 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 69665 event pairs, 4927 based on Foata normal form. 0/7997 useless extension candidates. Maximal degree in co-relation 21224. Up to 7844 conditions per place. [2024-02-07 19:03:46,211 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 36 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-02-07 19:03:46,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 227 flow [2024-02-07 19:03:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 19:03:46,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-02-07 19:03:46,213 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 155 flow. Second operand 3 states and 84 transitions. [2024-02-07 19:03:46,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 227 flow [2024-02-07 19:03:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:46,217 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 152 flow [2024-02-07 19:03:46,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-02-07 19:03:46,219 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 19:03:46,219 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 152 flow [2024-02-07 19:03:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 19:03:46,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:46,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:46,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:46,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:46,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 374931236, now seen corresponding path program 1 times [2024-02-07 19:03:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648088672] [2024-02-07 19:03:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:46,286 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 19:03:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648088672] [2024-02-07 19:03:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648088672] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791178880] [2024-02-07 19:03:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:46,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:46,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:46,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:46,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:46,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:46,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:47,297 INFO L124 PetriNetUnfolderBase]: 7916/13118 cut-off events. [2024-02-07 19:03:47,298 INFO L125 PetriNetUnfolderBase]: For 3573/3573 co-relation queries the response was YES. [2024-02-07 19:03:47,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30225 conditions, 13118 events. 7916/13118 cut-off events. For 3573/3573 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 101885 event pairs, 3111 based on Foata normal form. 506/11965 useless extension candidates. Maximal degree in co-relation 30218. Up to 6333 conditions per place. [2024-02-07 19:03:47,398 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 63 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2024-02-07 19:03:47,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 377 flow [2024-02-07 19:03:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-02-07 19:03:47,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2024-02-07 19:03:47,400 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 152 flow. Second operand 3 states and 116 transitions. [2024-02-07 19:03:47,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 377 flow [2024-02-07 19:03:47,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:47,408 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 183 flow [2024-02-07 19:03:47,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 19:03:47,411 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-02-07 19:03:47,411 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 183 flow [2024-02-07 19:03:47,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:47,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:47,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:47,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:47,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:47,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash -412014221, now seen corresponding path program 1 times [2024-02-07 19:03:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887641240] [2024-02-07 19:03:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:47,457 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 19:03:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887641240] [2024-02-07 19:03:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887641240] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:47,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905183218] [2024-02-07 19:03:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:47,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:47,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:47,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 183 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 19:03:47,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:47,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:47,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:48,301 INFO L124 PetriNetUnfolderBase]: 6778/11160 cut-off events. [2024-02-07 19:03:48,302 INFO L125 PetriNetUnfolderBase]: For 5739/5739 co-relation queries the response was YES. [2024-02-07 19:03:48,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27430 conditions, 11160 events. 6778/11160 cut-off events. For 5739/5739 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 83121 event pairs, 2326 based on Foata normal form. 496/10180 useless extension candidates. Maximal degree in co-relation 27422. Up to 9350 conditions per place. [2024-02-07 19:03:48,383 INFO L140 encePairwiseOnDemand]: 60/62 looper letters, 59 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2024-02-07 19:03:48,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 369 flow [2024-02-07 19:03:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:48,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2024-02-07 19:03:48,385 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 183 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:48,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 369 flow [2024-02-07 19:03:48,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 349 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:48,397 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 165 flow [2024-02-07 19:03:48,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-02-07 19:03:48,398 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-02-07 19:03:48,398 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 165 flow [2024-02-07 19:03:48,399 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 19:03:48,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:48,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:48,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:48,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:48,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2069924875, now seen corresponding path program 1 times [2024-02-07 19:03:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719653780] [2024-02-07 19:03:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:48,481 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 19:03:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719653780] [2024-02-07 19:03:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719653780] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:48,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570307543] [2024-02-07 19:03:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:48,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:48,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:48,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:48,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:48,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:48,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:49,177 INFO L124 PetriNetUnfolderBase]: 5389/8885 cut-off events. [2024-02-07 19:03:49,177 INFO L125 PetriNetUnfolderBase]: For 3260/3280 co-relation queries the response was YES. [2024-02-07 19:03:49,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20400 conditions, 8885 events. 5389/8885 cut-off events. For 3260/3280 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 64147 event pairs, 2842 based on Foata normal form. 453/8047 useless extension candidates. Maximal degree in co-relation 20393. Up to 4533 conditions per place. [2024-02-07 19:03:49,236 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 55 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-02-07 19:03:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 329 flow [2024-02-07 19:03:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:03:49,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-02-07 19:03:49,238 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 165 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:03:49,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 329 flow [2024-02-07 19:03:49,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:49,241 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 145 flow [2024-02-07 19:03:49,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=145, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 19:03:49,241 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-02-07 19:03:49,242 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 145 flow [2024-02-07 19:03:49,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:49,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:49,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:49,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:49,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:49,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash -545395974, now seen corresponding path program 1 times [2024-02-07 19:03:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801727283] [2024-02-07 19:03:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:49,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 19:03:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:49,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801727283] [2024-02-07 19:03:49,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801727283] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:49,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:49,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140332401] [2024-02-07 19:03:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:49,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:49,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:49,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:03:49,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:49,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:49,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:03:49,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:50,150 INFO L124 PetriNetUnfolderBase]: 5139/9188 cut-off events. [2024-02-07 19:03:50,151 INFO L125 PetriNetUnfolderBase]: For 2148/2148 co-relation queries the response was YES. [2024-02-07 19:03:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20556 conditions, 9188 events. 5139/9188 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 71899 event pairs, 1103 based on Foata normal form. 281/8005 useless extension candidates. Maximal degree in co-relation 20550. Up to 4333 conditions per place. [2024-02-07 19:03:50,236 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 60 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2024-02-07 19:03:50,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 385 flow [2024-02-07 19:03:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-02-07 19:03:50,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201612903225806 [2024-02-07 19:03:50,238 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 145 flow. Second operand 4 states and 129 transitions. [2024-02-07 19:03:50,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 385 flow [2024-02-07 19:03:50,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 363 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:50,244 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 163 flow [2024-02-07 19:03:50,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2024-02-07 19:03:50,246 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2024-02-07 19:03:50,246 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 163 flow [2024-02-07 19:03:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:50,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:50,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:50,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:50,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1747831809, now seen corresponding path program 1 times [2024-02-07 19:03:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642926946] [2024-02-07 19:03:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:50,278 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 19:03:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642926946] [2024-02-07 19:03:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642926946] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944136182] [2024-02-07 19:03:50,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:50,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:50,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-02-07 19:03:50,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:50,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:50,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-02-07 19:03:50,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:50,745 INFO L124 PetriNetUnfolderBase]: 2843/5178 cut-off events. [2024-02-07 19:03:50,746 INFO L125 PetriNetUnfolderBase]: For 2162/2166 co-relation queries the response was YES. [2024-02-07 19:03:50,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11926 conditions, 5178 events. 2843/5178 cut-off events. For 2162/2166 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 36785 event pairs, 1305 based on Foata normal form. 152/5068 useless extension candidates. Maximal degree in co-relation 11919. Up to 4002 conditions per place. [2024-02-07 19:03:50,784 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 39 selfloop transitions, 3 changer transitions 2/58 dead transitions. [2024-02-07 19:03:50,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 274 flow [2024-02-07 19:03:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-07 19:03:50,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-02-07 19:03:50,786 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 163 flow. Second operand 3 states and 98 transitions. [2024-02-07 19:03:50,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 274 flow [2024-02-07 19:03:50,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:50,789 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 141 flow [2024-02-07 19:03:50,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-02-07 19:03:50,790 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-02-07 19:03:50,791 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 141 flow [2024-02-07 19:03:50,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:50,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:50,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:50,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:50,792 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:50,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1769238206, now seen corresponding path program 1 times [2024-02-07 19:03:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364394890] [2024-02-07 19:03:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:50,927 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 19:03:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364394890] [2024-02-07 19:03:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364394890] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534676276] [2024-02-07 19:03:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:50,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:03:50,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 19:03:50,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:50,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:03:50,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:51,282 INFO L124 PetriNetUnfolderBase]: 1674/3057 cut-off events. [2024-02-07 19:03:51,282 INFO L125 PetriNetUnfolderBase]: For 1399/1399 co-relation queries the response was YES. [2024-02-07 19:03:51,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7148 conditions, 3057 events. 1674/3057 cut-off events. For 1399/1399 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19005 event pairs, 194 based on Foata normal form. 152/3093 useless extension candidates. Maximal degree in co-relation 7141. Up to 945 conditions per place. [2024-02-07 19:03:51,301 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 61 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-02-07 19:03:51,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 402 flow [2024-02-07 19:03:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-02-07 19:03:51,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935483870967742 [2024-02-07 19:03:51,304 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 141 flow. Second operand 5 states and 153 transitions. [2024-02-07 19:03:51,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 402 flow [2024-02-07 19:03:51,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 386 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:51,307 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 174 flow [2024-02-07 19:03:51,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2024-02-07 19:03:51,308 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-02-07 19:03:51,309 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 174 flow [2024-02-07 19:03:51,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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 19:03:51,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:51,309 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] [2024-02-07 19:03:51,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:03:51,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:51,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1750945721, now seen corresponding path program 1 times [2024-02-07 19:03:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:51,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429535520] [2024-02-07 19:03:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:51,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:51,504 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 19:03:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429535520] [2024-02-07 19:03:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429535520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:51,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:51,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:03:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019228227] [2024-02-07 19:03:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:51,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:51,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-02-07 19:03:51,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 19:03:51,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:51,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-02-07 19:03:51,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:51,750 INFO L124 PetriNetUnfolderBase]: 1028/1751 cut-off events. [2024-02-07 19:03:51,750 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-02-07 19:03:51,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4793 conditions, 1751 events. 1028/1751 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8782 event pairs, 150 based on Foata normal form. 76/1799 useless extension candidates. Maximal degree in co-relation 4786. Up to 576 conditions per place. [2024-02-07 19:03:51,763 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 53 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2024-02-07 19:03:51,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 394 flow [2024-02-07 19:03:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:03:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:03:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-02-07 19:03:51,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-02-07 19:03:51,765 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 174 flow. Second operand 6 states and 165 transitions. [2024-02-07 19:03:51,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 394 flow [2024-02-07 19:03:51,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 369 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:51,773 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 188 flow [2024-02-07 19:03:51,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2024-02-07 19:03:51,774 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-02-07 19:03:51,774 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 188 flow [2024-02-07 19:03:51,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 19:03:51,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:51,775 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, 1, 1] [2024-02-07 19:03:51,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:03:51,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:51,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash -389768727, now seen corresponding path program 1 times [2024-02-07 19:03:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378791616] [2024-02-07 19:03:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:51,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:03:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:51,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:03:51,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:03:51,832 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:03:51,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:03:51,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:03:51,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:03:51,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:03:51,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:03:51,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:03:51,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:03:51,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:03:51,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:03:51,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:03:51,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:03:51,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:03:51,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:03:51,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:03:51,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:03:51,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:03:51,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:03:51,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:03:51,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:03:51,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:03:51,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:03:51,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:03:51,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:03:51,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:03:51,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:03:51,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:03:51,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:03:51,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:03:51,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:03:51,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:03:51,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:03:51,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:03:51,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:03:51,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:03:51,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:03:51,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:03:51,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:03:51,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:03:51,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:03:51,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:03:51,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:03:51,842 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:51,849 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:03:51,849 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:03:51,900 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:03:51,900 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:03:51,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:03:51 BasicIcfg [2024-02-07 19:03:51,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:03:51,904 INFO L158 Benchmark]: Toolchain (without parser) took 13538.64ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 79.6MB in the beginning and 820.1MB in the end (delta: -740.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-02-07 19:03:51,904 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:51,904 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:51,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.79ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 107.4MB in the end (delta: -28.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-02-07 19:03:51,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.77ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:51,905 INFO L158 Benchmark]: Boogie Preprocessor took 55.15ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 102.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:03:51,905 INFO L158 Benchmark]: RCFGBuilder took 627.71ms. Allocated memory is still 155.2MB. Free memory was 102.6MB in the beginning and 67.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:03:51,906 INFO L158 Benchmark]: TraceAbstraction took 12063.36ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 67.0MB in the beginning and 820.1MB in the end (delta: -753.1MB). Peak memory consumption was 998.5MB. Max. memory is 16.1GB. [2024-02-07 19:03:51,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.79ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 107.4MB in the end (delta: -28.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.77ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.15ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 102.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 627.71ms. Allocated memory is still 155.2MB. Free memory was 102.6MB in the beginning and 67.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12063.36ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 67.0MB in the beginning and 820.1MB in the end (delta: -753.1MB). Peak memory consumption was 998.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 793]: 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L780] 0 pthread_t t1915; [L781] FCALL, FORK 0 pthread_create(&t1915, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1915={5:0}, x=0, y=0] [L725] 1 y = 2 [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L730] 1 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]]]]]] [L730] 1 __unbuffered_p0_EAX = x [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L782] 0 pthread_t t1916; [L783] FCALL, FORK 0 pthread_create(&t1916, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1915={5:0}, t1916={6:0}, x=0, y=2] [L742] 2 x = 1 [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L784] 0 pthread_t t1917; [L785] FCALL, FORK 0 pthread_create(&t1917, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1915={5:0}, t1916={6:0}, t1917={3:0}, x=1, y=2] [L757] 3 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]]]]]] [L757] 3 __unbuffered_p2_EAX = y [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L745] 2 y = 1 [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L760] 3 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]]]]]] [L760] 3 __unbuffered_p2_EBX = y [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=1, 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] [L735] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L736] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=1, 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] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L750] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=1, 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] [L765] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=1, 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] [L787] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L787] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L788] 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_p2_EAX=2, __unbuffered_p2_EBX=1, 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, t1915={5:0}, t1916={6:0}, t1917={3:0}, x=1, y=1] [L789] 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]]]]]] [L789] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L789] RET 0 assume_abort_if_not(main$tmp_guard0) [L793] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=1, 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, t1915={5:0}, t1916={6:0}, t1917={3:0}, x=1, y=1] - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: 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: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: 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: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: 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: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: 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: 789]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 783]: 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: 785]: 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: 781]: 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, 102 locations, 41 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: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 774 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 2 mSDtfsCounter, 774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=12, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 19:03:51,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE