./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c --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/popl20-more-buffer-series.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/popl20-more-buffer-series.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:33:12,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:33:12,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:33:12,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:33:12,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:33:12,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:33:12,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:33:12,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:33:12,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:33:12,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:33:12,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:33:12,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:33:12,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:33:12,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:33:12,439 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:33:12,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:33:12,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:33:12,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:33:12,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:33:12,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:33:12,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:33:12,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:33:12,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:33:12,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:33:12,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:33:12,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:33:12,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:33:12,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:33:12,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:33:12,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:33:12,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:33:12,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:33:12,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:33:12,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:33:12,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:33:12,446 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:33:12,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:33:12,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:33:12,446 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:33:12,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:33:12,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:33:12,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:33:12,714 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:33:12,715 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:33:12,716 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/popl20-more-buffer-series.wvr.yml/witness.yml [2024-02-07 19:33:12,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:33:12,843 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:33:12,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2024-02-07 19:33:13,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:33:14,050 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:33:14,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2024-02-07 19:33:14,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec84c9bcc/034a8c7c370f4b1b8efd40ceae1fe817/FLAG4b45c0645 [2024-02-07 19:33:14,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec84c9bcc/034a8c7c370f4b1b8efd40ceae1fe817 [2024-02-07 19:33:14,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:33:14,447 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:33:14,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:33:14,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:33:14,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:33:14,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:12" (1/2) ... [2024-02-07 19:33:14,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c36391d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:33:14, skipping insertion in model container [2024-02-07 19:33:14,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:12" (1/2) ... [2024-02-07 19:33:14,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@640b331f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:33:14, skipping insertion in model container [2024-02-07 19:33:14,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:33:14" (2/2) ... [2024-02-07 19:33:14,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c36391d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14, skipping insertion in model container [2024-02-07 19:33:14,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:33:14" (2/2) ... [2024-02-07 19:33:14,457 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:33:14,484 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:33:14,485 INFO L76 edCorrectnessWitness]: Location invariant before [L112-L112] 0 <= j [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant after [L71-L71] 0 <= j [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L80-L80] -2147483647 <= q2_back [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L121-L121] 0 <= j [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L75-L75] 0 <= q2_back [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L49-L49] 0 <= i [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L103-L103] 0 <= i [2024-02-07 19:33:14,486 INFO L76 edCorrectnessWitness]: Location invariant before [L57-L57] -2147483647 <= q1_back [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L53-L53] 0 <= q1_back [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L94-L94] 0 <= i [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L101-L101] -2147483647 <= q1_front [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L116-L116] (-2147483647 <= q2_back) && (q2_front <= 2147483646) [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L62-L62] 0 <= i [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L71-L71] 0 <= j [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant before [L119-L119] -2147483647 <= q2_front [2024-02-07 19:33:14,487 INFO L76 edCorrectnessWitness]: Location invariant after [L112-L112] 0 <= j [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant before [L172-L172] (b <= -1) && (b != 0) [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant before [L60-L60] 1 <= i [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant after [L94-L94] 0 <= i [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant before [L166-L166] ((((((((8 <= i && i <= 2147483646) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant before [L85-L85] 0 <= j [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant before [L83-L83] 1 <= j [2024-02-07 19:33:14,488 INFO L76 edCorrectnessWitness]: Location invariant after [L49-L49] 0 <= i [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L54-L54] 0 <= i [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L98-L98] (-2147483647 <= q1_back) && (q1_front <= 2147483646) [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L82-L82] 0 <= j [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L76-L76] 0 <= j [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L173-L173] (1 <= b) && (b != 0) [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L77-L77] 0 <= j [2024-02-07 19:33:14,489 INFO L76 edCorrectnessWitness]: Location invariant before [L59-L59] 0 <= i [2024-02-07 19:33:14,506 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:33:14,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c[4403,4416] [2024-02-07 19:33:14,657 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:33:14,670 INFO L206 MainTranslator]: Completed pre-run [2024-02-07 19:33:14,683 WARN L423 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-07 19:33:14,683 WARN L423 MainDispatcher]: Unable to annotate cond = i < N with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:14,706 WARN L423 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-07 19:33:14,706 WARN L423 MainDispatcher]: Unable to annotate cond = j < N with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:14,710 WARN L423 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-07 19:33:14,711 WARN L423 MainDispatcher]: Unable to annotate cond = i < N || q1_front < q1_back with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:14,714 WARN L423 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-07 19:33:14,714 WARN L423 MainDispatcher]: Unable to annotate cond = j < N || q2_front < q2_back with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:14,721 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c[4403,4416] Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:14,743 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:33:14,756 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:33:14,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14 WrapperNode [2024-02-07 19:33:14,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:33:14,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:33:14,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:33:14,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:33:14,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,815 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 390 [2024-02-07 19:33:14,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:33:14,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:33:14,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:33:14,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:33:14,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,846 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 2, 2, 2, 10]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 1, 3]. [2024-02-07 19:33:14,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:33:14,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:33:14,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:33:14,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:33:14,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (1/1) ... [2024-02-07 19:33:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:33:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:14,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 19:33:14,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 19:33:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:33:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:33:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:33:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:33:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:33:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:33:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:33:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-07 19:33:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:33:14,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:33:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:33:14,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:33:14,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:33:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 19:33:14,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 19:33:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 19:33:14,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 19:33:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:33:14,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:33:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:33:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:33:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:33:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-07 19:33:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:33:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:33:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-07 19:33:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:33:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:33:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:33:14,973 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:33:15,111 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:33:15,113 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:33:15,548 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:33:15,549 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:33:15,816 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:33:15,816 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-07 19:33:15,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:33:15 BoogieIcfgContainer [2024-02-07 19:33:15,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:33:15,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:33:15,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:33:15,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:33:15,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:12" (1/4) ... [2024-02-07 19:33:15,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d78cf7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:33:15, skipping insertion in model container [2024-02-07 19:33:15,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:33:14" (2/4) ... [2024-02-07 19:33:15,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d78cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:33:15, skipping insertion in model container [2024-02-07 19:33:15,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:14" (3/4) ... [2024-02-07 19:33:15,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d78cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:33:15, skipping insertion in model container [2024-02-07 19:33:15,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:33:15" (4/4) ... [2024-02-07 19:33:15,823 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2024-02-07 19:33:15,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:33:15,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-02-07 19:33:15,837 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:33:15,888 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 19:33:15,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 84 transitions, 196 flow [2024-02-07 19:33:15,935 INFO L124 PetriNetUnfolderBase]: 7/80 cut-off events. [2024-02-07 19:33:15,935 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:33:15,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 80 events. 7/80 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 242 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2024-02-07 19:33:15,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 84 transitions, 196 flow [2024-02-07 19:33:15,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 79 transitions, 182 flow [2024-02-07 19:33:15,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:33:15,951 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;@19cd7cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:33:15,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-02-07 19:33:15,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:33:15,954 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-02-07 19:33:15,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:33:15,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:15,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 19:33:15,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:15,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1143405, now seen corresponding path program 1 times [2024-02-07 19:33:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353734786] [2024-02-07 19:33:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353734786] [2024-02-07 19:33:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353734786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:33:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382263241] [2024-02-07 19:33:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:16,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:16,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:16,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 84 [2024-02-07 19:33:16,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:16,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:16,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 84 [2024-02-07 19:33:16,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:18,370 INFO L124 PetriNetUnfolderBase]: 19904/26824 cut-off events. [2024-02-07 19:33:18,370 INFO L125 PetriNetUnfolderBase]: For 696/696 co-relation queries the response was YES. [2024-02-07 19:33:18,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53538 conditions, 26824 events. 19904/26824 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 182858 event pairs, 15244 based on Foata normal form. 0/14404 useless extension candidates. Maximal degree in co-relation 49393. Up to 25456 conditions per place. [2024-02-07 19:33:18,522 INFO L140 encePairwiseOnDemand]: 65/84 looper letters, 49 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2024-02-07 19:33:18,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 280 flow [2024-02-07 19:33:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-02-07 19:33:18,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-07 19:33:18,532 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 182 flow. Second operand 3 states and 128 transitions. [2024-02-07 19:33:18,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 280 flow [2024-02-07 19:33:18,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 264 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 19:33:18,631 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 198 flow [2024-02-07 19:33:18,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-02-07 19:33:18,634 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2024-02-07 19:33:18,634 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 198 flow [2024-02-07 19:33:18,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:18,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:18,635 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-02-07 19:33:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:33:18,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:18,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1098849499, now seen corresponding path program 1 times [2024-02-07 19:33:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:18,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247535916] [2024-02-07 19:33:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247535916] [2024-02-07 19:33:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247535916] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225074400] [2024-02-07 19:33:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:18,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:33:18,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 19:33:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:18,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 19:33:18,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:18,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:33:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225074400] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:33:18,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:33:18,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-02-07 19:33:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889951300] [2024-02-07 19:33:18,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:33:18,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:33:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:18,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:33:18,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:33:18,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 84 [2024-02-07 19:33:18,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:18,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:18,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 84 [2024-02-07 19:33:18,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:20,646 INFO L124 PetriNetUnfolderBase]: 19907/26833 cut-off events. [2024-02-07 19:33:20,647 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-02-07 19:33:20,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52830 conditions, 26833 events. 19907/26833 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 183316 event pairs, 15244 based on Foata normal form. 0/14413 useless extension candidates. Maximal degree in co-relation 52742. Up to 25457 conditions per place. [2024-02-07 19:33:20,764 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 49 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2024-02-07 19:33:20,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 350 flow [2024-02-07 19:33:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:33:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:33:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-02-07 19:33:20,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-02-07 19:33:20,767 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 198 flow. Second operand 4 states and 145 transitions. [2024-02-07 19:33:20,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 350 flow [2024-02-07 19:33:20,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:33:20,768 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 257 flow [2024-02-07 19:33:20,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2024-02-07 19:33:20,769 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -13 predicate places. [2024-02-07 19:33:20,769 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 257 flow [2024-02-07 19:33:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:20,770 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1] [2024-02-07 19:33:20,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 19:33:20,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:20,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:20,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -567548983, now seen corresponding path program 2 times [2024-02-07 19:33:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328492904] [2024-02-07 19:33:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328492904] [2024-02-07 19:33:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328492904] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070731000] [2024-02-07 19:33:21,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:33:21,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:21,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:21,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:33:21,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 19:33:21,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:33:21,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:33:21,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 19:33:21,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:21,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:33:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070731000] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:33:21,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:33:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-07 19:33:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344316604] [2024-02-07 19:33:21,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:33:21,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:33:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:33:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:33:21,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 84 [2024-02-07 19:33:21,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:21,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:21,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 84 [2024-02-07 19:33:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:22,694 INFO L124 PetriNetUnfolderBase]: 19910/26842 cut-off events. [2024-02-07 19:33:22,694 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-02-07 19:33:22,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52875 conditions, 26842 events. 19910/26842 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 183470 event pairs, 15244 based on Foata normal form. 0/14422 useless extension candidates. Maximal degree in co-relation 52759. Up to 25458 conditions per place. [2024-02-07 19:33:22,811 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 49 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2024-02-07 19:33:22,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 429 flow [2024-02-07 19:33:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:33:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:33:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-02-07 19:33:22,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2024-02-07 19:33:22,813 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 257 flow. Second operand 5 states and 171 transitions. [2024-02-07 19:33:22,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 429 flow [2024-02-07 19:33:22,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 410 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:22,815 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 335 flow [2024-02-07 19:33:22,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-02-07 19:33:22,816 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -9 predicate places. [2024-02-07 19:33:22,816 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 335 flow [2024-02-07 19:33:22,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:22,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:22,816 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1] [2024-02-07 19:33:22,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 19:33:23,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-02-07 19:33:23,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:23,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 46311223, now seen corresponding path program 3 times [2024-02-07 19:33:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079520199] [2024-02-07 19:33:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:23,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079520199] [2024-02-07 19:33:23,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079520199] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:23,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780252374] [2024-02-07 19:33:23,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 19:33:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:23,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:33:23,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 19:33:23,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 19:33:23,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:33:23,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-07 19:33:23,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 19:33:23,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:33:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 19:33:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780252374] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:33:23,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:33:23,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2024-02-07 19:33:23,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805600269] [2024-02-07 19:33:23,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:33:23,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-07 19:33:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-07 19:33:23,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-02-07 19:33:23,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-02-07 19:33:23,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 335 flow. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:23,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:23,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-02-07 19:33:23,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:25,587 INFO L124 PetriNetUnfolderBase]: 19916/26858 cut-off events. [2024-02-07 19:33:25,587 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2024-02-07 19:33:25,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52968 conditions, 26858 events. 19916/26858 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 183328 event pairs, 15244 based on Foata normal form. 0/14439 useless extension candidates. Maximal degree in co-relation 52799. Up to 25459 conditions per place. [2024-02-07 19:33:25,684 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 63 selfloop transitions, 33 changer transitions 0/109 dead transitions. [2024-02-07 19:33:25,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 633 flow [2024-02-07 19:33:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-07 19:33:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-07 19:33:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 323 transitions. [2024-02-07 19:33:25,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2957875457875458 [2024-02-07 19:33:25,686 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 335 flow. Second operand 13 states and 323 transitions. [2024-02-07 19:33:25,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 633 flow [2024-02-07 19:33:25,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 109 transitions, 579 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-02-07 19:33:25,689 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 456 flow [2024-02-07 19:33:25,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=456, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-02-07 19:33:25,689 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 2 predicate places. [2024-02-07 19:33:25,690 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 456 flow [2024-02-07 19:33:25,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:25,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:25,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:25,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 19:33:25,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:25,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:25,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 445011512, now seen corresponding path program 1 times [2024-02-07 19:33:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012650462] [2024-02-07 19:33:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012650462] [2024-02-07 19:33:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012650462] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:33:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321168724] [2024-02-07 19:33:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:26,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:33:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:33:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:33:26,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 84 [2024-02-07 19:33:26,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:26,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:26,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 84 [2024-02-07 19:33:26,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:29,062 INFO L124 PetriNetUnfolderBase]: 37345/50196 cut-off events. [2024-02-07 19:33:29,062 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2024-02-07 19:33:29,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100312 conditions, 50196 events. 37345/50196 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 359774 event pairs, 14677 based on Foata normal form. 0/29359 useless extension candidates. Maximal degree in co-relation 100239. Up to 24360 conditions per place. [2024-02-07 19:33:29,437 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 162 selfloop transitions, 11 changer transitions 0/188 dead transitions. [2024-02-07 19:33:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 188 transitions, 1006 flow [2024-02-07 19:33:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:33:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:33:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-02-07 19:33:29,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099206349206349 [2024-02-07 19:33:29,439 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 456 flow. Second operand 6 states and 257 transitions. [2024-02-07 19:33:29,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 188 transitions, 1006 flow [2024-02-07 19:33:29,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 188 transitions, 925 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-02-07 19:33:29,444 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 423 flow [2024-02-07 19:33:29,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2024-02-07 19:33:29,444 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 7 predicate places. [2024-02-07 19:33:29,445 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 423 flow [2024-02-07 19:33:29,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:29,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:29,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:29,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:33:29,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:29,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1159899391, now seen corresponding path program 1 times [2024-02-07 19:33:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392677056] [2024-02-07 19:33:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392677056] [2024-02-07 19:33:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392677056] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:33:29,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820143405] [2024-02-07 19:33:29,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:29,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:33:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:33:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:33:29,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 84 [2024-02-07 19:33:29,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:29,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:29,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 84 [2024-02-07 19:33:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:32,932 INFO L124 PetriNetUnfolderBase]: 39197/53872 cut-off events. [2024-02-07 19:33:32,933 INFO L125 PetriNetUnfolderBase]: For 3382/3382 co-relation queries the response was YES. [2024-02-07 19:33:33,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112582 conditions, 53872 events. 39197/53872 cut-off events. For 3382/3382 co-relation queries the response was YES. Maximal size of possible extension queue 4210. Compared 414108 event pairs, 14718 based on Foata normal form. 0/33416 useless extension candidates. Maximal degree in co-relation 112515. Up to 31277 conditions per place. [2024-02-07 19:33:33,230 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 148 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2024-02-07 19:33:33,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 175 transitions, 923 flow [2024-02-07 19:33:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:33:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:33:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2024-02-07 19:33:33,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781746031746032 [2024-02-07 19:33:33,232 INFO L175 Difference]: Start difference. First operand has 92 places, 97 transitions, 423 flow. Second operand 6 states and 241 transitions. [2024-02-07 19:33:33,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 175 transitions, 923 flow [2024-02-07 19:33:33,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 175 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:33,239 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 469 flow [2024-02-07 19:33:33,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2024-02-07 19:33:33,240 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, 14 predicate places. [2024-02-07 19:33:33,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 469 flow [2024-02-07 19:33:33,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:33,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:33,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:33,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:33:33,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-02-07 19:33:33,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 508632916, now seen corresponding path program 1 times [2024-02-07 19:33:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163213563] [2024-02-07 19:33:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:33:33,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:33:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:33:33,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:33:33,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:33:33,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 54 remaining) [2024-02-07 19:33:33,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 54 remaining) [2024-02-07 19:33:33,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 54 remaining) [2024-02-07 19:33:33,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 54 remaining) [2024-02-07 19:33:33,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 54 remaining) [2024-02-07 19:33:33,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (31 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 54 remaining) [2024-02-07 19:33:33,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 54 remaining) [2024-02-07 19:33:33,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 54 remaining) [2024-02-07 19:33:33,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 54 remaining) [2024-02-07 19:33:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 54 remaining) [2024-02-07 19:33:33,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 54 remaining) [2024-02-07 19:33:33,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 54 remaining) [2024-02-07 19:33:33,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 54 remaining) [2024-02-07 19:33:33,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:33:33,294 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-02-07 19:33:33,298 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:33:33,298 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:33:33,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 19:33:33,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 19:33:33,316 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 19:33:33,323 INFO L503 ceAbstractionStarter]: Automizer considered 26 witness invariants [2024-02-07 19:33:33,323 INFO L504 ceAbstractionStarter]: WitnessConsidered=26 [2024-02-07 19:33:33,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:33:33 BasicIcfg [2024-02-07 19:33:33,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:33:33,324 INFO L158 Benchmark]: Toolchain (without parser) took 18877.22ms. Allocated memory was 163.6MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 125.7MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-02-07 19:33:33,324 INFO L158 Benchmark]: Witness Parser took 0.61ms. Allocated memory is still 127.9MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:33:33,324 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 127.9MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:33:33,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.30ms. Allocated memory is still 163.6MB. Free memory was 125.7MB in the beginning and 106.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-07 19:33:33,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.42ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 103.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:33:33,325 INFO L158 Benchmark]: Boogie Preprocessor took 74.63ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 99.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:33:33,325 INFO L158 Benchmark]: RCFGBuilder took 925.75ms. Allocated memory is still 163.6MB. Free memory was 99.7MB in the beginning and 92.0MB in the end (delta: 7.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-02-07 19:33:33,325 INFO L158 Benchmark]: TraceAbstraction took 17505.06ms. Allocated memory was 163.6MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 92.0MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-02-07 19:33:33,326 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.61ms. Allocated memory is still 127.9MB. Free memory was 89.9MB in the beginning and 89.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.22ms. Allocated memory is still 127.9MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.30ms. Allocated memory is still 163.6MB. Free memory was 125.7MB in the beginning and 106.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.42ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 103.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.63ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 99.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 925.75ms. Allocated memory is still 163.6MB. Free memory was 99.7MB in the beginning and 92.0MB in the end (delta: 7.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17505.06ms. Allocated memory was 163.6MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 92.0MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=0, arr={-3:0}, f={0:0}, i=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=-1, q1_front=-1, q2={0:0}, q2_back=-2, q2_front=-2, size=0, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=0, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={0:0}, q2_back=-2, q2_front=-2, size=0, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, size=1, total=0] [L165] COND TRUE 0 i < size VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, size=1, total=0] [L166] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, t1={3:0}, t2={7:0}, t3={6:0}, t4={5:0}, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, _argptr={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, _argptr={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, total=0] [L53] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[q1_back]]]] VAL [N=1, _argptr={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=0, n2=0, q1={-3:0}, q1_back=-1, q1_front=-1, q2={-4:0}, q2_back=-2, q2_front=-2, total=0] - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 173]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 155]: 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: 147]: 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: 148]: 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: 146]: 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: 145]: 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: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 173]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 131 locations, 54 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: 17.4s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 454 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1623 IncrementalHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 21 mSDtfsCounter, 1623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 76 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 4 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 15/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:33:33,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE