./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_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/safe033_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/safe033_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe033_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:25:16,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:25:16,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:25:16,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:25:16,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:25:16,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:25:16,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:25:16,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:25:16,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:25:16,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:25:16,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:25:16,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:25:16,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:25:16,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:25:16,766 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:25:16,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:25:16,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:25:16,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:25:16,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:25:16,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:25:16,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:25:16,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:25:16,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:25:16,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:25:16,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:25:16,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:25:16,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:25:16,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:25:16,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:25:16,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:25:16,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:25:16,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:25:16,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:16,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:25:16,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:25:16,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:25:16,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:25:16,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:25:16,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:25:16,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:25:16,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:25:16,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:25:16,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:25:16,773 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:25:17,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:25:17,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:25:17,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:25:17,029 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:25:17,030 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:25:17,031 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/safe033_tso.yml/witness.yml [2024-02-07 14:25:17,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:25:17,123 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:25:17,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2024-02-07 14:25:18,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:25:18,530 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:25:18,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2024-02-07 14:25:18,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caae16cf8/e28d8280630f420fb6fe2d177703de31/FLAGbe8915b79 [2024-02-07 14:25:18,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caae16cf8/e28d8280630f420fb6fe2d177703de31 [2024-02-07 14:25:18,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:25:18,571 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:25:18,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:18,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:25:18,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:25:18,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:17" (1/2) ... [2024-02-07 14:25:18,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97f50ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:17" (1/2) ... [2024-02-07 14:25:18,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c5f542b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:18" (2/2) ... [2024-02-07 14:25:18,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97f50ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:18, skipping insertion in model container [2024-02-07 14:25:18,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:18" (2/2) ... [2024-02-07 14:25:18,579 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:25:18,617 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L725-L725] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L772-L772] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L767-L767] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,619 INFO L76 edCorrectnessWitness]: Location invariant before [L721-L721] y == 2 [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L773-L773] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 1 <= __unbuffered_cnt [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (y == 2)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] y == 1 [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 1 <= __unbuffered_cnt [2024-02-07 14:25:18,620 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] 0 <= __unbuffered_cnt [2024-02-07 14:25:18,621 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] x == 1 [2024-02-07 14:25:18,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:25:18,794 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/safe033_tso.i[945,958] [2024-02-07 14:25:18,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:18,968 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:25:19,000 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/safe033_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:25:19,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:19,111 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:25:19,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19 WrapperNode [2024-02-07 14:25:19,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:19,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:19,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:25:19,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:25:19,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:25:19" (1/1) ... [2024-02-07 14:25:19,130 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:25:19" (1/1) ... [2024-02-07 14:25:19,148 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-02-07 14:25:19,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:19,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:25:19,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:25:19,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:25:19,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,173 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:25:19,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:25:19,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:25:19,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:25:19,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:25:19,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (1/1) ... [2024-02-07 14:25:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:25:19,207 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:25:19,214 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:25:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:25:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:25:19,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:25:19,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:25:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:25:19,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:25:19,241 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:25:19,325 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:25:19,326 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:25:19,477 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:25:19,477 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:25:19,578 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:25:19,579 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:25:19,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:19 BoogieIcfgContainer [2024-02-07 14:25:19,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:25:19,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:25:19,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:25:19,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:25:19,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:17" (1/4) ... [2024-02-07 14:25:19,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d499564 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:25:18" (2/4) ... [2024-02-07 14:25:19,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d499564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:19" (3/4) ... [2024-02-07 14:25:19,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d499564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:19, skipping insertion in model container [2024-02-07 14:25:19,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:19" (4/4) ... [2024-02-07 14:25:19,589 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_tso.i [2024-02-07 14:25:19,603 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:25:19,603 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-02-07 14:25:19,604 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:25:19,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:25:19,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 102 flow [2024-02-07 14:25:19,704 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-02-07 14:25:19,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:19,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-07 14:25:19,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 47 transitions, 102 flow [2024-02-07 14:25:19,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 96 flow [2024-02-07 14:25:19,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:25:19,722 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;@42c2c3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:25:19,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-02-07 14:25:19,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:25:19,725 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-02-07 14:25:19,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:19,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:19,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:25:19,726 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:25:19,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 8337757, now seen corresponding path program 1 times [2024-02-07 14:25:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:19,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113539851] [2024-02-07 14:25:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:19,915 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:25:19,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:19,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113539851] [2024-02-07 14:25:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113539851] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995823968] [2024-02-07 14:25:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:19,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:25:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:25:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:25:20,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-02-07 14:25:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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:25:20,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-02-07 14:25:20,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:20,182 INFO L124 PetriNetUnfolderBase]: 610/1318 cut-off events. [2024-02-07 14:25:20,183 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:25:20,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1318 events. 610/1318 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8926 event pairs, 610 based on Foata normal form. 42/1009 useless extension candidates. Maximal degree in co-relation 2331. Up to 1004 conditions per place. [2024-02-07 14:25:20,196 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 23 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2024-02-07 14:25:20,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 124 flow [2024-02-07 14:25:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:25:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:25:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2024-02-07 14:25:20,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-02-07 14:25:20,208 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 2 states and 62 transitions. [2024-02-07 14:25:20,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 124 flow [2024-02-07 14:25:20,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:20,212 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 76 flow [2024-02-07 14:25:20,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-02-07 14:25:20,217 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2024-02-07 14:25:20,217 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 76 flow [2024-02-07 14:25:20,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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:25:20,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:20,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:20,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:25:20,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:25:20,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash -577341249, now seen corresponding path program 1 times [2024-02-07 14:25:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464644574] [2024-02-07 14:25:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,321 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:25:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464644574] [2024-02-07 14:25:20,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464644574] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660754146] [2024-02-07 14:25:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:20,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-02-07 14:25:20,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 76 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:25:20,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-02-07 14:25:20,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:20,433 INFO L124 PetriNetUnfolderBase]: 591/1080 cut-off events. [2024-02-07 14:25:20,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:20,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 1080 events. 591/1080 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6407 event pairs, 86 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 2067. Up to 857 conditions per place. [2024-02-07 14:25:20,441 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 34 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-02-07 14:25:20,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 174 flow [2024-02-07 14:25:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-02-07 14:25:20,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-02-07 14:25:20,448 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 76 flow. Second operand 3 states and 82 transitions. [2024-02-07 14:25:20,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 174 flow [2024-02-07 14:25:20,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:20,452 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 84 flow [2024-02-07 14:25:20,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-02-07 14:25:20,453 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2024-02-07 14:25:20,453 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 84 flow [2024-02-07 14:25:20,453 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:25:20,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:20,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:20,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:25:20,454 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:25:20,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash -577409339, now seen corresponding path program 1 times [2024-02-07 14:25:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595418687] [2024-02-07 14:25:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,510 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:25:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595418687] [2024-02-07 14:25:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595418687] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832880838] [2024-02-07 14:25:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:20,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-02-07 14:25:20,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 84 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:25:20,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-02-07 14:25:20,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:20,654 INFO L124 PetriNetUnfolderBase]: 431/822 cut-off events. [2024-02-07 14:25:20,654 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-02-07 14:25:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 822 events. 431/822 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4582 event pairs, 165 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1681. Up to 520 conditions per place. [2024-02-07 14:25:20,658 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 36 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2024-02-07 14:25:20,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 201 flow [2024-02-07 14:25:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 14:25:20,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-02-07 14:25:20,661 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 84 flow. Second operand 3 states and 87 transitions. [2024-02-07 14:25:20,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 201 flow [2024-02-07 14:25:20,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:20,664 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 103 flow [2024-02-07 14:25:20,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-02-07 14:25:20,665 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 14:25:20,665 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 103 flow [2024-02-07 14:25:20,666 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:25:20,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:20,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:25:20,666 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:25:20,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -719820025, now seen corresponding path program 1 times [2024-02-07 14:25:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247262976] [2024-02-07 14:25:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:20,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,758 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:25:20,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247262976] [2024-02-07 14:25:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247262976] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558462659] [2024-02-07 14:25:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:20,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 14:25:20,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 103 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:25:20,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 14:25:20,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:20,852 INFO L124 PetriNetUnfolderBase]: 431/936 cut-off events. [2024-02-07 14:25:20,852 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-02-07 14:25:20,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 936 events. 431/936 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5867 event pairs, 413 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1963. Up to 728 conditions per place. [2024-02-07 14:25:20,857 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-02-07 14:25:20,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 151 flow [2024-02-07 14:25:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-02-07 14:25:20,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-02-07 14:25:20,861 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 103 flow. Second operand 3 states and 66 transitions. [2024-02-07 14:25:20,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 151 flow [2024-02-07 14:25:20,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:20,863 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 100 flow [2024-02-07 14:25:20,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-02-07 14:25:20,865 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 14:25:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 100 flow [2024-02-07 14:25:20,866 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:25:20,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:20,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:25:20,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:25:20,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash -257301998, now seen corresponding path program 1 times [2024-02-07 14:25:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897496672] [2024-02-07 14:25:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:20,976 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:25:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897496672] [2024-02-07 14:25:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897496672] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:20,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678565058] [2024-02-07 14:25:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:20,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:20,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 14:25:20,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:25:20,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:20,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 14:25:20,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,088 INFO L124 PetriNetUnfolderBase]: 330/763 cut-off events. [2024-02-07 14:25:21,088 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-02-07 14:25:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 763 events. 330/763 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4584 event pairs, 70 based on Foata normal form. 33/688 useless extension candidates. Maximal degree in co-relation 1551. Up to 319 conditions per place. [2024-02-07 14:25:21,092 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 41 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-02-07 14:25:21,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 246 flow [2024-02-07 14:25:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-07 14:25:21,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478723404255319 [2024-02-07 14:25:21,093 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 100 flow. Second operand 4 states and 103 transitions. [2024-02-07 14:25:21,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 246 flow [2024-02-07 14:25:21,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:21,095 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 121 flow [2024-02-07 14:25:21,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-02-07 14:25:21,095 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-02-07 14:25:21,096 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 121 flow [2024-02-07 14:25:21,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:25:21,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:25:21,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-02-07 14:25:21,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1082056323, now seen corresponding path program 1 times [2024-02-07 14:25:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992295266] [2024-02-07 14:25:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:21,122 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:25:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:21,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992295266] [2024-02-07 14:25:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992295266] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208629500] [2024-02-07 14:25:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:21,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:21,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:21,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-02-07 14:25:21,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:25:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-02-07 14:25:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,213 INFO L124 PetriNetUnfolderBase]: 294/690 cut-off events. [2024-02-07 14:25:21,213 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-02-07 14:25:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 690 events. 294/690 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4038 event pairs, 122 based on Foata normal form. 26/614 useless extension candidates. Maximal degree in co-relation 1515. Up to 471 conditions per place. [2024-02-07 14:25:21,216 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 37 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-02-07 14:25:21,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 236 flow [2024-02-07 14:25:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-02-07 14:25:21,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673758865248227 [2024-02-07 14:25:21,217 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 121 flow. Second operand 3 states and 80 transitions. [2024-02-07 14:25:21,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 236 flow [2024-02-07 14:25:21,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:21,219 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 112 flow [2024-02-07 14:25:21,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-02-07 14:25:21,220 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-02-07 14:25:21,220 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 112 flow [2024-02-07 14:25:21,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:25:21,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:25:21,221 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:25:21,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1862109398, now seen corresponding path program 1 times [2024-02-07 14:25:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220409501] [2024-02-07 14:25:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:21,240 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:25:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220409501] [2024-02-07 14:25:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220409501] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:21,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887045052] [2024-02-07 14:25:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:21,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-02-07 14:25:21,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:21,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:21,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-02-07 14:25:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,302 INFO L124 PetriNetUnfolderBase]: 220/521 cut-off events. [2024-02-07 14:25:21,303 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-02-07 14:25:21,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 521 events. 220/521 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2763 event pairs, 110 based on Foata normal form. 16/487 useless extension candidates. Maximal degree in co-relation 1117. Up to 336 conditions per place. [2024-02-07 14:25:21,305 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 25 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-02-07 14:25:21,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 176 flow [2024-02-07 14:25:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-02-07 14:25:21,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-02-07 14:25:21,307 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 112 flow. Second operand 3 states and 77 transitions. [2024-02-07 14:25:21,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 176 flow [2024-02-07 14:25:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:21,309 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 97 flow [2024-02-07 14:25:21,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2024-02-07 14:25:21,310 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 14:25:21,311 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 97 flow [2024-02-07 14:25:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:21,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:21,311 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:25:21,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2029362321, now seen corresponding path program 1 times [2024-02-07 14:25:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189647067] [2024-02-07 14:25:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:21,402 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:25:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189647067] [2024-02-07 14:25:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189647067] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323637297] [2024-02-07 14:25:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:21,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 14:25:21,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:25:21,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:21,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 14:25:21,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:21,474 INFO L124 PetriNetUnfolderBase]: 102/239 cut-off events. [2024-02-07 14:25:21,474 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-02-07 14:25:21,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 239 events. 102/239 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 862 event pairs, 26 based on Foata normal form. 16/241 useless extension candidates. Maximal degree in co-relation 556. Up to 86 conditions per place. [2024-02-07 14:25:21,476 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-02-07 14:25:21,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 194 flow [2024-02-07 14:25:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-02-07 14:25:21,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-02-07 14:25:21,477 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 97 flow. Second operand 5 states and 105 transitions. [2024-02-07 14:25:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 194 flow [2024-02-07 14:25:21,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 181 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:21,478 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 108 flow [2024-02-07 14:25:21,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2024-02-07 14:25:21,479 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-02-07 14:25:21,479 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 108 flow [2024-02-07 14:25:21,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:25:21,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:21,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:21,480 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:25:21,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1805720679, now seen corresponding path program 1 times [2024-02-07 14:25:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:21,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793392746] [2024-02-07 14:25:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:21,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:21,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:21,513 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:21,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 28 remaining) [2024-02-07 14:25:21,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 28 remaining) [2024-02-07 14:25:21,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 28 remaining) [2024-02-07 14:25:21,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 28 remaining) [2024-02-07 14:25:21,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 28 remaining) [2024-02-07 14:25:21,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 28 remaining) [2024-02-07 14:25:21,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:21,520 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:21,524 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:21,525 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:21,545 INFO L503 ceAbstractionStarter]: Automizer considered 16 witness invariants [2024-02-07 14:25:21,545 INFO L504 ceAbstractionStarter]: WitnessConsidered=16 [2024-02-07 14:25:21,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:21 BasicIcfg [2024-02-07 14:25:21,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:21,546 INFO L158 Benchmark]: Toolchain (without parser) took 2975.35ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 156.0MB in the beginning and 118.9MB in the end (delta: 37.1MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,546 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:21,547 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:21,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.88ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 128.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.47ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,547 INFO L158 Benchmark]: Boogie Preprocessor took 32.94ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,548 INFO L158 Benchmark]: RCFGBuilder took 396.66ms. Allocated memory is still 184.5MB. Free memory was 124.5MB in the beginning and 97.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,548 INFO L158 Benchmark]: TraceAbstraction took 1963.01ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 96.2MB in the beginning and 118.9MB in the end (delta: -22.7MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-02-07 14:25:21,549 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.19ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.88ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 128.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.47ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.94ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.66ms. Allocated memory is still 184.5MB. Free memory was 124.5MB in the beginning and 97.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1963.01ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 96.2MB in the beginning and 118.9MB in the end (delta: -22.7MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 771]: 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_p0_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L760] 0 pthread_t t2573; [L761] FCALL, FORK 0 pthread_create(&t2573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2573={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_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L725] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L725] 1 __unbuffered_p0_EAX = x [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L762] 0 pthread_t t2574; [L763] FCALL, FORK 0 pthread_create(&t2574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2573={5:0}, t2574={3:0}, x=0, y=2] [L737] 2 x = 1 [L738] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L740] 2 y = 1 [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_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] [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L745] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L766] 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_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2573={5:0}, t2574={3:0}, x=1, y=1] [L767] 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]]]]]] [L767] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L767] RET 0 assume_abort_if_not(main$tmp_guard0) [L771] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2573={5:0}, t2574={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: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 773]: 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: 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. - UnprovableResult [Line: 763]: 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, 73 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: 1.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=5, InterpolantAutomatonStates: 26, 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.4s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:25:21,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE