./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.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/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:59,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:59,187 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:59,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:59,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:59,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:59,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:59,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:59,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:59,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:59,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:59,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:59,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:59,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:59,230 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:59,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:59,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:59,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:59,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:59,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:59,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:59,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:59,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:59,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:59,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:59,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:59,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:59,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:59,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:59,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:59,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:59,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:59,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:59,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:59,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:59,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:59,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:59,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:59,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:59,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:59,237 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:59,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:59,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:59,238 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:59,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:59,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:59,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:59,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:59,475 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:59,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:04:00,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:04:00,913 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:04:00,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:04:00,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63186219a/9b6be2234b504f30b172b331e54c0685/FLAG8a77f56c5 [2024-02-07 19:04:00,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63186219a/9b6be2234b504f30b172b331e54c0685 [2024-02-07 19:04:00,940 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:04:00,941 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:04:00,942 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/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 19:04:01,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:04:01,035 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:04:01,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:01,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:04:01,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:04:01,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:00" (1/2) ... [2024-02-07 19:04:01,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae4fdb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:01, skipping insertion in model container [2024-02-07 19:04:01,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:00" (1/2) ... [2024-02-07 19:04:01,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a1eb2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:01, skipping insertion in model container [2024-02-07 19:04:01,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:01" (2/2) ... [2024-02-07 19:04:01,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae4fdb1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01, skipping insertion in model container [2024-02-07 19:04:01,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:01" (2/2) ... [2024-02-07 19:04:01,049 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:04:01,118 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:04:01,119 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] x == 1 [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] ((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L734-L734] 1 <= __unbuffered_cnt [2024-02-07 19:04:01,120 INFO L76 edCorrectnessWitness]: Location invariant before [L756-L756] y == 1 [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L783-L783] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] 1 <= __unbuffered_cnt [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L760-L760] 0 <= __unbuffered_cnt [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L784-L784] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 0 <= __unbuffered_cnt [2024-02-07 19:04:01,121 INFO L76 edCorrectnessWitness]: Location invariant before [L752-L752] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 1 <= __unbuffered_cnt [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] 0 <= __unbuffered_cnt [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L725-L725] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L782-L782] 0 <= __unbuffered_cnt [2024-02-07 19:04:01,122 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:04:01,161 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:04:01,360 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/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 19:04:01,581 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:01,589 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:04:01,620 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/safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:04:01,680 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:01,719 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:04:01,720 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01 WrapperNode [2024-02-07 19:04:01,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:01,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:01,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:04:01,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:04:01,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,784 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-02-07 19:04:01,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:01,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:04:01,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:04:01,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:04:01,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,809 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:04:01,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:04:01,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:04:01,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:04:01,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:04:01,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (1/1) ... [2024-02-07 19:04:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:04:01,854 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:04:01,875 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:04:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:04:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:04:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:04:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:04:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:04:01,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:04:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:04:01,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:04:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:04:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:04:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:04:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:04:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:04:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:04:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:04:01,892 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:04:02,002 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:04:02,004 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:04:02,196 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:04:02,196 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:04:02,315 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:04:02,316 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:04:02,316 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:02 BoogieIcfgContainer [2024-02-07 19:04:02,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:04:02,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:04:02,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:04:02,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:04:02,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:04:00" (1/4) ... [2024-02-07 19:04:02,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a48425b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:04:02, skipping insertion in model container [2024-02-07 19:04:02,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:01" (2/4) ... [2024-02-07 19:04:02,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a48425b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:02, skipping insertion in model container [2024-02-07 19:04:02,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:01" (3/4) ... [2024-02-07 19:04:02,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a48425b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:02, skipping insertion in model container [2024-02-07 19:04:02,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:02" (4/4) ... [2024-02-07 19:04:02,325 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:04:02,342 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:04:02,343 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-07 19:04:02,343 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:04:02,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:04:02,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 59 transitions, 130 flow [2024-02-07 19:04:02,481 INFO L124 PetriNetUnfolderBase]: 1/56 cut-off events. [2024-02-07 19:04:02,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:02,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 56 events. 1/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-02-07 19:04:02,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 59 transitions, 130 flow [2024-02-07 19:04:02,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 121 flow [2024-02-07 19:04:02,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:04:02,511 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;@644761f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:04:02,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-02-07 19:04:02,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:04:02,520 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:04:02,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:02,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:02,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:04:02,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:02,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 9604449, now seen corresponding path program 1 times [2024-02-07 19:04:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081122216] [2024-02-07 19:04:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:02,745 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:04:02,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081122216] [2024-02-07 19:04:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081122216] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:02,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981901098] [2024-02-07 19:04:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:02,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:02,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:02,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:02,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:02,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:02,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:03,774 INFO L124 PetriNetUnfolderBase]: 5867/9464 cut-off events. [2024-02-07 19:04:03,774 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-07 19:04:03,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17892 conditions, 9464 events. 5867/9464 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 69488 event pairs, 2355 based on Foata normal form. 265/6956 useless extension candidates. Maximal degree in co-relation 17881. Up to 5088 conditions per place. [2024-02-07 19:04:03,844 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 47 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-02-07 19:04:03,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 233 flow [2024-02-07 19:04:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-07 19:04:03,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-02-07 19:04:03,856 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 3 states and 120 transitions. [2024-02-07 19:04:03,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 233 flow [2024-02-07 19:04:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:03,863 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 104 flow [2024-02-07 19:04:03,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-02-07 19:04:03,869 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:04:03,869 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 104 flow [2024-02-07 19:04:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:03,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:03,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 19:04:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:04:03,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:03,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 297738292, now seen corresponding path program 1 times [2024-02-07 19:04:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:03,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59370308] [2024-02-07 19:04:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:03,932 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:04:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59370308] [2024-02-07 19:04:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59370308] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:03,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628294930] [2024-02-07 19:04:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:03,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:03,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:03,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:04:03,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:03,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:04,559 INFO L124 PetriNetUnfolderBase]: 5541/8529 cut-off events. [2024-02-07 19:04:04,560 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-02-07 19:04:04,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17298 conditions, 8529 events. 5541/8529 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 57118 event pairs, 1149 based on Foata normal form. 0/6263 useless extension candidates. Maximal degree in co-relation 17287. Up to 6922 conditions per place. [2024-02-07 19:04:04,621 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 50 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-02-07 19:04:04,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 257 flow [2024-02-07 19:04:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:04:04,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2024-02-07 19:04:04,623 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 104 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:04:04,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 257 flow [2024-02-07 19:04:04,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:04,625 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 110 flow [2024-02-07 19:04:04,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-02-07 19:04:04,626 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2024-02-07 19:04:04,627 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 110 flow [2024-02-07 19:04:04,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:04:04,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:04,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:04:04,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:04,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1636298249, now seen corresponding path program 1 times [2024-02-07 19:04:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947602462] [2024-02-07 19:04:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:04,746 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:04:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947602462] [2024-02-07 19:04:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947602462] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500186847] [2024-02-07 19:04:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:04,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:04,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:04,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:04,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:04,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:04,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:05,208 INFO L124 PetriNetUnfolderBase]: 4260/6397 cut-off events. [2024-02-07 19:04:05,209 INFO L125 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2024-02-07 19:04:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13978 conditions, 6397 events. 4260/6397 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 38946 event pairs, 1280 based on Foata normal form. 0/5311 useless extension candidates. Maximal degree in co-relation 13966. Up to 5547 conditions per place. [2024-02-07 19:04:05,242 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 49 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-07 19:04:05,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 274 flow [2024-02-07 19:04:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:04:05,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2024-02-07 19:04:05,244 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 110 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:04:05,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 274 flow [2024-02-07 19:04:05,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:05,246 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 138 flow [2024-02-07 19:04:05,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-02-07 19:04:05,247 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2024-02-07 19:04:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 138 flow [2024-02-07 19:04:05,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:05,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:05,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:05,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:04:05,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:05,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -580162853, now seen corresponding path program 1 times [2024-02-07 19:04:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922972252] [2024-02-07 19:04:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:05,282 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:04:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922972252] [2024-02-07 19:04:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922972252] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:05,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608277539] [2024-02-07 19:04:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:05,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:05,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 138 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:04:05,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:05,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:05,645 INFO L124 PetriNetUnfolderBase]: 3394/5374 cut-off events. [2024-02-07 19:04:05,646 INFO L125 PetriNetUnfolderBase]: For 943/943 co-relation queries the response was YES. [2024-02-07 19:04:05,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12658 conditions, 5374 events. 3394/5374 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33717 event pairs, 848 based on Foata normal form. 342/4931 useless extension candidates. Maximal degree in co-relation 12645. Up to 4204 conditions per place. [2024-02-07 19:04:05,676 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 54 selfloop transitions, 1 changer transitions 0/69 dead transitions. [2024-02-07 19:04:05,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 307 flow [2024-02-07 19:04:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 19:04:05,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2024-02-07 19:04:05,678 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 138 flow. Second operand 3 states and 103 transitions. [2024-02-07 19:04:05,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 307 flow [2024-02-07 19:04:05,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:05,681 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 126 flow [2024-02-07 19:04:05,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-02-07 19:04:05,682 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:04:05,682 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 126 flow [2024-02-07 19:04:05,682 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:04:05,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:05,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:04:05,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:05,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1293039228, now seen corresponding path program 1 times [2024-02-07 19:04:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540291450] [2024-02-07 19:04:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:05,728 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:04:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540291450] [2024-02-07 19:04:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540291450] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258601010] [2024-02-07 19:04:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:05,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:05,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:04:05,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:05,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:05,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:04:05,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:06,131 INFO L124 PetriNetUnfolderBase]: 3394/5919 cut-off events. [2024-02-07 19:04:06,132 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2024-02-07 19:04:06,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12998 conditions, 5919 events. 3394/5919 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 42853 event pairs, 3138 based on Foata normal form. 0/4824 useless extension candidates. Maximal degree in co-relation 12986. Up to 4927 conditions per place. [2024-02-07 19:04:06,173 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-02-07 19:04:06,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 188 flow [2024-02-07 19:04:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-02-07 19:04:06,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4406779661016949 [2024-02-07 19:04:06,175 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 126 flow. Second operand 3 states and 78 transitions. [2024-02-07 19:04:06,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 188 flow [2024-02-07 19:04:06,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:06,177 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 125 flow [2024-02-07 19:04:06,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-02-07 19:04:06,178 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:04:06,178 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 125 flow [2024-02-07 19:04:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:06,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:06,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:04:06,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:06,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1305373227, now seen corresponding path program 1 times [2024-02-07 19:04:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318717132] [2024-02-07 19:04:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:06,221 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:04:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318717132] [2024-02-07 19:04:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318717132] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895484350] [2024-02-07 19:04:06,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:06,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:06,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:06,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 125 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:04:06,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:06,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:06,560 INFO L124 PetriNetUnfolderBase]: 3065/4984 cut-off events. [2024-02-07 19:04:06,561 INFO L125 PetriNetUnfolderBase]: For 691/691 co-relation queries the response was YES. [2024-02-07 19:04:06,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11315 conditions, 4984 events. 3065/4984 cut-off events. For 691/691 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32812 event pairs, 937 based on Foata normal form. 142/4351 useless extension candidates. Maximal degree in co-relation 11306. Up to 3090 conditions per place. [2024-02-07 19:04:06,609 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 49 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2024-02-07 19:04:06,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 274 flow [2024-02-07 19:04:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-07 19:04:06,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480225988700564 [2024-02-07 19:04:06,612 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 125 flow. Second operand 3 states and 97 transitions. [2024-02-07 19:04:06,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 274 flow [2024-02-07 19:04:06,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:06,614 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 120 flow [2024-02-07 19:04:06,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-02-07 19:04:06,615 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2024-02-07 19:04:06,615 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 120 flow [2024-02-07 19:04:06,616 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:04:06,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:06,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:06,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:04:06,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:06,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1365138883, now seen corresponding path program 1 times [2024-02-07 19:04:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:06,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049263034] [2024-02-07 19:04:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:06,728 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:04:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049263034] [2024-02-07 19:04:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049263034] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134010569] [2024-02-07 19:04:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:06,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:06,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:04:06,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:06,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:06,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:04:06,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:07,290 INFO L124 PetriNetUnfolderBase]: 2963/5353 cut-off events. [2024-02-07 19:04:07,290 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2024-02-07 19:04:07,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11593 conditions, 5353 events. 2963/5353 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 39113 event pairs, 503 based on Foata normal form. 150/4531 useless extension candidates. Maximal degree in co-relation 11585. Up to 2593 conditions per place. [2024-02-07 19:04:07,342 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-02-07 19:04:07,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 304 flow [2024-02-07 19:04:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-02-07 19:04:07,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169491525423728 [2024-02-07 19:04:07,344 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 120 flow. Second operand 4 states and 122 transitions. [2024-02-07 19:04:07,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 304 flow [2024-02-07 19:04:07,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:07,347 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 145 flow [2024-02-07 19:04:07,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-02-07 19:04:07,348 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2024-02-07 19:04:07,348 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 145 flow [2024-02-07 19:04:07,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:07,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:07,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:07,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:04:07,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:07,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1539784064, now seen corresponding path program 1 times [2024-02-07 19:04:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645710430] [2024-02-07 19:04:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:07,377 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:04:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645710430] [2024-02-07 19:04:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645710430] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143426401] [2024-02-07 19:04:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:07,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:07,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:04:07,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 145 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:04:07,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:07,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:04:07,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:07,674 INFO L124 PetriNetUnfolderBase]: 1680/3074 cut-off events. [2024-02-07 19:04:07,675 INFO L125 PetriNetUnfolderBase]: For 948/948 co-relation queries the response was YES. [2024-02-07 19:04:07,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 3074 events. 1680/3074 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20016 event pairs, 722 based on Foata normal form. 82/2902 useless extension candidates. Maximal degree in co-relation 6947. Up to 2350 conditions per place. [2024-02-07 19:04:07,696 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 33 selfloop transitions, 3 changer transitions 2/51 dead transitions. [2024-02-07 19:04:07,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 231 flow [2024-02-07 19:04:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 19:04:07,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2024-02-07 19:04:07,698 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 145 flow. Second operand 3 states and 93 transitions. [2024-02-07 19:04:07,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 231 flow [2024-02-07 19:04:07,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:07,701 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 123 flow [2024-02-07 19:04:07,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2024-02-07 19:04:07,702 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2024-02-07 19:04:07,702 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 123 flow [2024-02-07 19:04:07,702 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:04:07,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:07,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:04:07,703 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:07,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1676689906, now seen corresponding path program 1 times [2024-02-07 19:04:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123024564] [2024-02-07 19:04:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:07,792 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:04:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123024564] [2024-02-07 19:04:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123024564] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312713641] [2024-02-07 19:04:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:07,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:04:07,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:04:07,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:07,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:04:07,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:07,986 INFO L124 PetriNetUnfolderBase]: 962/1802 cut-off events. [2024-02-07 19:04:07,986 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES. [2024-02-07 19:04:07,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 1802 events. 962/1802 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10288 event pairs, 100 based on Foata normal form. 82/1756 useless extension candidates. Maximal degree in co-relation 4095. Up to 581 conditions per place. [2024-02-07 19:04:07,997 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 53 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-02-07 19:04:07,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 345 flow [2024-02-07 19:04:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-07 19:04:07,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488135593220339 [2024-02-07 19:04:07,999 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 123 flow. Second operand 5 states and 144 transitions. [2024-02-07 19:04:07,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 345 flow [2024-02-07 19:04:08,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 329 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:08,003 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 156 flow [2024-02-07 19:04:08,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-02-07 19:04:08,004 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2024-02-07 19:04:08,004 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 156 flow [2024-02-07 19:04:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:04:08,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:08,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:08,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:04:08,005 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:08,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1989390499, now seen corresponding path program 1 times [2024-02-07 19:04:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056580712] [2024-02-07 19:04:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:08,111 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:04:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056580712] [2024-02-07 19:04:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056580712] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:08,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:08,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:04:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37027846] [2024-02-07 19:04:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:08,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:08,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:04:08,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:08,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:08,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:04:08,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:08,280 INFO L124 PetriNetUnfolderBase]: 569/983 cut-off events. [2024-02-07 19:04:08,280 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2024-02-07 19:04:08,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 983 events. 569/983 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4289 event pairs, 83 based on Foata normal form. 40/991 useless extension candidates. Maximal degree in co-relation 2641. Up to 308 conditions per place. [2024-02-07 19:04:08,287 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 46 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-02-07 19:04:08,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 344 flow [2024-02-07 19:04:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:04:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:04:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-02-07 19:04:08,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4406779661016949 [2024-02-07 19:04:08,289 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 156 flow. Second operand 6 states and 156 transitions. [2024-02-07 19:04:08,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 344 flow [2024-02-07 19:04:08,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:08,294 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 170 flow [2024-02-07 19:04:08,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-02-07 19:04:08,294 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -6 predicate places. [2024-02-07 19:04:08,295 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 170 flow [2024-02-07 19:04:08,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:08,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:08,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:08,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:04:08,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:04:08,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2110524117, now seen corresponding path program 1 times [2024-02-07 19:04:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56924703] [2024-02-07 19:04:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:08,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:04:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:08,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:04:08,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:04:08,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 39 remaining) [2024-02-07 19:04:08,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 39 remaining) [2024-02-07 19:04:08,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 39 remaining) [2024-02-07 19:04:08,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 39 remaining) [2024-02-07 19:04:08,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 39 remaining) [2024-02-07 19:04:08,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 39 remaining) [2024-02-07 19:04:08,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 39 remaining) [2024-02-07 19:04:08,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 39 remaining) [2024-02-07 19:04:08,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 39 remaining) [2024-02-07 19:04:08,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 39 remaining) [2024-02-07 19:04:08,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 39 remaining) [2024-02-07 19:04:08,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (17 of 39 remaining) [2024-02-07 19:04:08,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 39 remaining) [2024-02-07 19:04:08,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-02-07 19:04:08,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 39 remaining) [2024-02-07 19:04:08,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 39 remaining) [2024-02-07 19:04:08,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 39 remaining) [2024-02-07 19:04:08,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 39 remaining) [2024-02-07 19:04:08,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 39 remaining) [2024-02-07 19:04:08,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 39 remaining) [2024-02-07 19:04:08,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 39 remaining) [2024-02-07 19:04:08,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 39 remaining) [2024-02-07 19:04:08,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 39 remaining) [2024-02-07 19:04:08,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 39 remaining) [2024-02-07 19:04:08,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:04:08,357 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:08,364 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:04:08,365 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:04:08,400 INFO L503 ceAbstractionStarter]: Automizer considered 21 witness invariants [2024-02-07 19:04:08,400 INFO L504 ceAbstractionStarter]: WitnessConsidered=21 [2024-02-07 19:04:08,401 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:04:08 BasicIcfg [2024-02-07 19:04:08,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:04:08,401 INFO L158 Benchmark]: Toolchain (without parser) took 7366.37ms. Allocated memory was 111.1MB in the beginning and 899.7MB in the end (delta: 788.5MB). Free memory was 53.7MB in the beginning and 508.2MB in the end (delta: -454.5MB). Peak memory consumption was 336.3MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,401 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:08,402 INFO L158 Benchmark]: Witness Parser took 1.65ms. Allocated memory is still 111.1MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:08,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.05ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 53.5MB in the beginning and 101.6MB in the end (delta: -48.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.57ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,402 INFO L158 Benchmark]: Boogie Preprocessor took 37.68ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,403 INFO L158 Benchmark]: RCFGBuilder took 492.82ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 64.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,403 INFO L158 Benchmark]: TraceAbstraction took 6083.20ms. Allocated memory was 142.6MB in the beginning and 899.7MB in the end (delta: 757.1MB). Free memory was 63.6MB in the beginning and 508.2MB in the end (delta: -444.6MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. [2024-02-07 19:04:08,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.65ms. Allocated memory is still 111.1MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.05ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 53.5MB in the beginning and 101.6MB in the end (delta: -48.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.57ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.68ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.82ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 64.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6083.20ms. Allocated memory was 142.6MB in the beginning and 899.7MB in the end (delta: 757.1MB). Free memory was 63.6MB in the beginning and 508.2MB in the end (delta: -444.6MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 788]: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L775] 0 pthread_t t2207; [L776] FCALL, FORK 0 pthread_create(&t2207, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2207={5:0}, x=0, y=0] [L725] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L725] 1 __unbuffered_p0_EAX = y [L726] 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L777] 0 pthread_t t2208; [L778] FCALL, FORK 0 pthread_create(&t2208, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2207={5:0}, t2208={6:0}, x=0, y=0] [L740] 2 x = 1 [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L728] 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]]]]]] [L728] 1 __unbuffered_p0_EBX = x [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L779] 0 pthread_t t2209; [L780] FCALL, FORK 0 pthread_create(&t2209, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2207={5:0}, t2208={6:0}, t2209={3:0}, x=1, y=0] [L752] 3 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]]]]]] [L752] 3 __unbuffered_p2_EAX = x [L753] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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=0] [L755] 3 y = 1 [L756] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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] [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L734] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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] [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L745] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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] [L760] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L760] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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] [L782] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L782] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L783] 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_p0_EBX=1, __unbuffered_p2_EAX=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, t2207={5:0}, t2208={6:0}, t2209={3:0}, x=1, y=1] [L784] 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]]]]]] [L784] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L784] RET 0 assume_abort_if_not(main$tmp_guard0) [L788] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __unbuffered_p2_EAX=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, t2207={5:0}, t2208={6:0}, t2209={3:0}, x=1, y=1] - UnprovableResult [Line: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: 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: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 756]: 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: 782]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 784]: 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: 790]: 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: 780]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 96 locations, 39 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: 5.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 2 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:04:08,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE