./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe010_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe010_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:24:18,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:18,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:24:18,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:18,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:18,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:18,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:18,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:18,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:18,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:18,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:18,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:18,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:18,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:18,919 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:18,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:18,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:18,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:18,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:18,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:18,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:18,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:18,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:18,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:18,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:18,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:18,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:18,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:18,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:18,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:18,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:18,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:18,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:18,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:18,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:18,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:18,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:18,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:18,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:18,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:18,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:18,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:18,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:18,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:24:19,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:19,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:19,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:19,170 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:19,171 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:19,171 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/safe010_tso.yml/witness.yml [2024-02-07 14:24:19,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:19,253 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:19,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_tso.i [2024-02-07 14:24:20,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:20,613 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:20,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_tso.i [2024-02-07 14:24:20,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53aca97f8/b9382e2dfc854a938748108c16d84820/FLAG84dfc02b7 [2024-02-07 14:24:20,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53aca97f8/b9382e2dfc854a938748108c16d84820 [2024-02-07 14:24:20,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:20,642 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:20,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:20,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:20,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:20,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:19" (1/2) ... [2024-02-07 14:24:20,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15696c85 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:20, skipping insertion in model container [2024-02-07 14:24:20,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:19" (1/2) ... [2024-02-07 14:24:20,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19fb01e7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:20, skipping insertion in model container [2024-02-07 14:24:20,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:20" (2/2) ... [2024-02-07 14:24:20,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15696c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:20, skipping insertion in model container [2024-02-07 14:24:20,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:20" (2/2) ... [2024-02-07 14:24:20,650 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:20,708 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L769-L769] (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (y == 2)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] 0 <= __unbuffered_cnt [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] 0 <= __unbuffered_cnt [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:20,709 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L739-L739] y == 1 [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] x == 1 [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L770-L770] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] 1 <= __unbuffered_cnt [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L743-L743] 0 <= __unbuffered_cnt [2024-02-07 14:24:20,710 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] 1 <= __unbuffered_cnt [2024-02-07 14:24:20,711 INFO L76 edCorrectnessWitness]: Location invariant before [L764-L764] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:20,711 INFO L76 edCorrectnessWitness]: Location invariant before [L721-L721] y == 2 [2024-02-07 14:24:20,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:20,894 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/safe010_tso.i[945,958] [2024-02-07 14:24:21,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:21,023 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:21,050 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/safe010_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:24:21,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:21,111 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:21,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21 WrapperNode [2024-02-07 14:24:21,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:21,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:21,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:21,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:21,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,167 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-02-07 14:24:21,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:21,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:21,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:21,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:21,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,203 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-07 14:24:21,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:21,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:21,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:21,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:21,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (1/1) ... [2024-02-07 14:24:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:21,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 14:24:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 14:24:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:21,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:21,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:21,282 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:24:21,404 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:21,406 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:21,543 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:21,544 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:21,665 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:21,669 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:21,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:21 BoogieIcfgContainer [2024-02-07 14:24:21,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:21,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:21,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:21,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:21,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:19" (1/4) ... [2024-02-07 14:24:21,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd465d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:21, skipping insertion in model container [2024-02-07 14:24:21,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:20" (2/4) ... [2024-02-07 14:24:21,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd465d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:21, skipping insertion in model container [2024-02-07 14:24:21,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:21" (3/4) ... [2024-02-07 14:24:21,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd465d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:21, skipping insertion in model container [2024-02-07 14:24:21,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:21" (4/4) ... [2024-02-07 14:24:21,690 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_tso.i [2024-02-07 14:24:21,703 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:21,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-02-07 14:24:21,704 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:21,752 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:21,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 100 flow [2024-02-07 14:24:21,822 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-02-07 14:24:21,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-02-07 14:24:21,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 100 flow [2024-02-07 14:24:21,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 94 flow [2024-02-07 14:24:21,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:21,850 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;@70f91e46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:21,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-02-07 14:24:21,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:21,853 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-02-07 14:24:21,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:21,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:21,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:21,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:21,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash 8306012, now seen corresponding path program 1 times [2024-02-07 14:24:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628583415] [2024-02-07 14:24:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628583415] [2024-02-07 14:24:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628583415] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848678473] [2024-02-07 14:24:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:24:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:24:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:24:22,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:22,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:22,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:22,274 INFO L124 PetriNetUnfolderBase]: 608/1315 cut-off events. [2024-02-07 14:24:22,274 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 14:24:22,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2332 conditions, 1315 events. 608/1315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8798 event pairs, 608 based on Foata normal form. 42/1004 useless extension candidates. Maximal degree in co-relation 2322. Up to 1000 conditions per place. [2024-02-07 14:24:22,285 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 23 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2024-02-07 14:24:22,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 122 flow [2024-02-07 14:24:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:24:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:24:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2024-02-07 14:24:22,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-02-07 14:24:22,297 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 94 flow. Second operand 2 states and 60 transitions. [2024-02-07 14:24:22,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 122 flow [2024-02-07 14:24:22,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:22,305 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 74 flow [2024-02-07 14:24:22,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2024-02-07 14:24:22,311 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2024-02-07 14:24:22,312 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 74 flow [2024-02-07 14:24:22,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:22,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:24:22,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:24:22,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:22,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -608333307, now seen corresponding path program 1 times [2024-02-07 14:24:22,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:22,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548192358] [2024-02-07 14:24:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548192358] [2024-02-07 14:24:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548192358] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227217015] [2024-02-07 14:24:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:22,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:22,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:22,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:22,613 INFO L124 PetriNetUnfolderBase]: 574/1098 cut-off events. [2024-02-07 14:24:22,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:22,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1098 events. 574/1098 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6749 event pairs, 162 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 2059. Up to 700 conditions per place. [2024-02-07 14:24:22,621 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 36 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-02-07 14:24:22,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 182 flow [2024-02-07 14:24:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 14:24:22,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-02-07 14:24:22,627 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 74 flow. Second operand 3 states and 81 transitions. [2024-02-07 14:24:22,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 182 flow [2024-02-07 14:24:22,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:22,631 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2024-02-07 14:24:22,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-02-07 14:24:22,632 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2024-02-07 14:24:22,632 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2024-02-07 14:24:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:22,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:24:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:24:22,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:22,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -608333735, now seen corresponding path program 1 times [2024-02-07 14:24:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705259944] [2024-02-07 14:24:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705259944] [2024-02-07 14:24:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705259944] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249655433] [2024-02-07 14:24:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:22,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:22,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:22,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:22,817 INFO L124 PetriNetUnfolderBase]: 416/797 cut-off events. [2024-02-07 14:24:22,818 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-02-07 14:24:22,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 797 events. 416/797 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4386 event pairs, 150 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1629. Up to 520 conditions per place. [2024-02-07 14:24:22,822 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 36 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2024-02-07 14:24:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 199 flow [2024-02-07 14:24:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 14:24:22,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-02-07 14:24:22,825 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 82 flow. Second operand 3 states and 84 transitions. [2024-02-07 14:24:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 199 flow [2024-02-07 14:24:22,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:22,828 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 101 flow [2024-02-07 14:24:22,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-02-07 14:24:22,829 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-02-07 14:24:22,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 101 flow [2024-02-07 14:24:22,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:22,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:24:22,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:22,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1678476337, now seen corresponding path program 1 times [2024-02-07 14:24:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-02-07 14:24:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-02-07 14:24:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332169724] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059216614] [2024-02-07 14:24:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:22,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:22,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-07 14:24:22,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:22,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:22,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-07 14:24:22,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,001 INFO L124 PetriNetUnfolderBase]: 416/910 cut-off events. [2024-02-07 14:24:23,001 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-07 14:24:23,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 910 events. 416/910 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5595 event pairs, 398 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 1908. Up to 705 conditions per place. [2024-02-07 14:24:23,006 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 24 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2024-02-07 14:24:23,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 149 flow [2024-02-07 14:24:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-02-07 14:24:23,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2024-02-07 14:24:23,007 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 101 flow. Second operand 3 states and 63 transitions. [2024-02-07 14:24:23,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 149 flow [2024-02-07 14:24:23,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:23,008 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 98 flow [2024-02-07 14:24:23,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-02-07 14:24:23,009 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-02-07 14:24:23,009 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 98 flow [2024-02-07 14:24:23,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:24:23,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -842004386, now seen corresponding path program 1 times [2024-02-07 14:24:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423257755] [2024-02-07 14:24:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423257755] [2024-02-07 14:24:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423257755] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540634013] [2024-02-07 14:24:23,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:23,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:23,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:23,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,118 INFO L124 PetriNetUnfolderBase]: 376/756 cut-off events. [2024-02-07 14:24:23,118 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-02-07 14:24:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 756 events. 376/756 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4233 event pairs, 139 based on Foata normal form. 26/694 useless extension candidates. Maximal degree in co-relation 1595. Up to 449 conditions per place. [2024-02-07 14:24:23,121 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 37 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-02-07 14:24:23,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 204 flow [2024-02-07 14:24:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 14:24:23,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.572463768115942 [2024-02-07 14:24:23,123 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 98 flow. Second operand 3 states and 79 transitions. [2024-02-07 14:24:23,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 204 flow [2024-02-07 14:24:23,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:23,124 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 93 flow [2024-02-07 14:24:23,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-02-07 14:24:23,125 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2024-02-07 14:24:23,125 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 93 flow [2024-02-07 14:24:23,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:24:23,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1891950835, now seen corresponding path program 1 times [2024-02-07 14:24:23,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998853734] [2024-02-07 14:24:23,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998853734] [2024-02-07 14:24:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998853734] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101317114] [2024-02-07 14:24:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:23,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-07 14:24:23,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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 14:24:23,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-07 14:24:23,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,289 INFO L124 PetriNetUnfolderBase]: 294/690 cut-off events. [2024-02-07 14:24:23,289 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-02-07 14:24:23,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 690 events. 294/690 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3963 event pairs, 62 based on Foata normal form. 29/616 useless extension candidates. Maximal degree in co-relation 1387. Up to 289 conditions per place. [2024-02-07 14:24:23,292 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 38 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2024-02-07 14:24:23,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 227 flow [2024-02-07 14:24:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-02-07 14:24:23,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-02-07 14:24:23,293 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 93 flow. Second operand 4 states and 96 transitions. [2024-02-07 14:24:23,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 227 flow [2024-02-07 14:24:23,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:23,295 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 114 flow [2024-02-07 14:24:23,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-02-07 14:24:23,295 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-02-07 14:24:23,295 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 114 flow [2024-02-07 14:24:23,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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 14:24:23,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:24:23,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1724366827, now seen corresponding path program 1 times [2024-02-07 14:24:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276396050] [2024-02-07 14:24:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276396050] [2024-02-07 14:24:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276396050] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817120001] [2024-02-07 14:24:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:23,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:23,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,392 INFO L124 PetriNetUnfolderBase]: 220/524 cut-off events. [2024-02-07 14:24:23,392 INFO L125 PetriNetUnfolderBase]: For 185/189 co-relation queries the response was YES. [2024-02-07 14:24:23,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 524 events. 220/524 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2707 event pairs, 110 based on Foata normal form. 16/489 useless extension candidates. Maximal degree in co-relation 1139. Up to 336 conditions per place. [2024-02-07 14:24:23,394 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 25 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2024-02-07 14:24:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 177 flow [2024-02-07 14:24:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-07 14:24:23,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2024-02-07 14:24:23,395 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 114 flow. Second operand 3 states and 74 transitions. [2024-02-07 14:24:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 177 flow [2024-02-07 14:24:23,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:23,397 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 95 flow [2024-02-07 14:24:23,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2024-02-07 14:24:23,397 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-02-07 14:24:23,397 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 95 flow [2024-02-07 14:24:23,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:24:23,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1491945399, now seen corresponding path program 1 times [2024-02-07 14:24:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151289799] [2024-02-07 14:24:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151289799] [2024-02-07 14:24:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151289799] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655044941] [2024-02-07 14:24:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:23,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-07 14:24:23,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-07 14:24:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,491 INFO L124 PetriNetUnfolderBase]: 171/390 cut-off events. [2024-02-07 14:24:23,491 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-02-07 14:24:23,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 390 events. 171/390 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1833 event pairs, 25 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 868. Up to 266 conditions per place. [2024-02-07 14:24:23,493 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 29 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-02-07 14:24:23,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 203 flow [2024-02-07 14:24:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-02-07 14:24:23,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-02-07 14:24:23,494 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 95 flow. Second operand 4 states and 88 transitions. [2024-02-07 14:24:23,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 203 flow [2024-02-07 14:24:23,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 183 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:23,496 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 104 flow [2024-02-07 14:24:23,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-02-07 14:24:23,498 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-02-07 14:24:23,498 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 104 flow [2024-02-07 14:24:23,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:24:23,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1717072573, now seen corresponding path program 1 times [2024-02-07 14:24:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308925080] [2024-02-07 14:24:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308925080] [2024-02-07 14:24:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308925080] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:23,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79832127] [2024-02-07 14:24:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:23,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:23,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-07 14:24:23,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:23,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-07 14:24:23,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:23,686 INFO L124 PetriNetUnfolderBase]: 102/242 cut-off events. [2024-02-07 14:24:23,686 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-02-07 14:24:23,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 242 events. 102/242 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 845 event pairs, 22 based on Foata normal form. 16/249 useless extension candidates. Maximal degree in co-relation 570. Up to 86 conditions per place. [2024-02-07 14:24:23,687 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 28 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2024-02-07 14:24:23,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 209 flow [2024-02-07 14:24:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-02-07 14:24:23,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2024-02-07 14:24:23,689 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 104 flow. Second operand 5 states and 100 transitions. [2024-02-07 14:24:23,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 209 flow [2024-02-07 14:24:23,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:23,692 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 120 flow [2024-02-07 14:24:23,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2024-02-07 14:24:23,692 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2024-02-07 14:24:23,693 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 120 flow [2024-02-07 14:24:23,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:23,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:23,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:24:23,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:24:23,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1757347787, now seen corresponding path program 1 times [2024-02-07 14:24:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583624975] [2024-02-07 14:24:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:23,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:24:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:23,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:24:23,742 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:24:23,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 28 remaining) [2024-02-07 14:24:23,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 28 remaining) [2024-02-07 14:24:23,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 28 remaining) [2024-02-07 14:24:23,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 28 remaining) [2024-02-07 14:24:23,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 28 remaining) [2024-02-07 14:24:23,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 28 remaining) [2024-02-07 14:24:23,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 28 remaining) [2024-02-07 14:24:23,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 28 remaining) [2024-02-07 14:24:23,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 28 remaining) [2024-02-07 14:24:23,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 28 remaining) [2024-02-07 14:24:23,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 28 remaining) [2024-02-07 14:24:23,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:24:23,754 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:23,759 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:24:23,759 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:24:23,790 INFO L503 ceAbstractionStarter]: Automizer considered 16 witness invariants [2024-02-07 14:24:23,790 INFO L504 ceAbstractionStarter]: WitnessConsidered=16 [2024-02-07 14:24:23,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:24:23 BasicIcfg [2024-02-07 14:24:23,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:24:23,791 INFO L158 Benchmark]: Toolchain (without parser) took 3149.50ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 74.9MB in the beginning and 71.6MB in the end (delta: 3.3MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,791 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:23,791 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:23,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.88ms. Allocated memory is still 132.1MB. Free memory was 74.9MB in the beginning and 47.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 132.1MB. Free memory was 47.4MB in the beginning and 45.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,792 INFO L158 Benchmark]: Boogie Preprocessor took 57.56ms. Allocated memory is still 132.1MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,792 INFO L158 Benchmark]: RCFGBuilder took 443.73ms. Allocated memory is still 132.1MB. Free memory was 42.9MB in the beginning and 82.5MB in the end (delta: -39.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,792 INFO L158 Benchmark]: TraceAbstraction took 2119.16ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 81.8MB in the beginning and 71.6MB in the end (delta: 10.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-02-07 14:24:23,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.88ms. Allocated memory is still 132.1MB. Free memory was 74.9MB in the beginning and 47.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 132.1MB. Free memory was 47.4MB in the beginning and 45.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.56ms. Allocated memory is still 132.1MB. Free memory was 45.3MB in the beginning and 43.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.73ms. Allocated memory is still 132.1MB. Free memory was 42.9MB in the beginning and 82.5MB in the end (delta: -39.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2119.16ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 81.8MB in the beginning and 71.6MB in the end (delta: 10.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 769]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L758] 0 pthread_t t2021; [L759] FCALL, FORK 0 pthread_create(&t2021, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2021={5:0}, x=0, y=0] [L720] 1 y = 2 [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L760] 0 pthread_t t2022; [L761] FCALL, FORK 0 pthread_create(&t2022, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2021={5:0}, t2022={3:0}, x=0, y=2] [L735] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L735] 2 __unbuffered_p1_EAX = x [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L723] 1 x = 1 [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L738] 2 y = 1 [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L728] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L743] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L763] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L763] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L764] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2021={5:0}, t2022={3:0}, x=1, y=1] [L765] 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]]]]]] [L765] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L765] RET 0 assume_abort_if_not(main$tmp_guard0) [L769] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2021={5:0}, t2022={3:0}, x=1, y=1] - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 771]: 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: 759]: 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: 761]: 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 5 procedures, 71 locations, 28 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: 2.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=9, InterpolantAutomatonStates: 30, 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.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:24:23,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE