./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.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-inc-subseq.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-inc-subseq.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.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:17:42,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:17:42,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:17:42,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:17:42,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:17:42,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:17:42,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:17:42,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:17:42,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:17:42,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:17:42,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:17:42,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:17:42,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:17:42,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:17:42,748 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:17:42,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:17:42,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:17:42,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:17:42,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:17:42,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:17:42,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:17:42,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:17:42,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:17:42,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:17:42,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:17:42,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:17:42,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:17:42,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:17:42,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:17:42,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:17:42,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:17:42,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:17:42,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:17:42,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:17:42,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:17:42,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:17:42,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:17:42,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:17:42,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:17:42,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:17:42,754 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:17:42,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:17:42,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:17:42,755 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:17:42,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:17:42,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:17:42,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:17:42,956 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:17:42,957 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:17:42,957 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-inc-subseq.wvr.yml/witness.yml [2024-02-07 19:17:43,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:17:43,039 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:17:43,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-07 19:17:43,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:17:44,122 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:17:44,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-07 19:17:44,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c941b3da1/dd48f379f37d4fd3a038231690cab637/FLAG69257cc56 [2024-02-07 19:17:44,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c941b3da1/dd48f379f37d4fd3a038231690cab637 [2024-02-07 19:17:44,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:17:44,143 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:17:44,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:17:44,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:17:44,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:17:44,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:17:43" (1/2) ... [2024-02-07 19:17:44,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8e764e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:17:44, skipping insertion in model container [2024-02-07 19:17:44,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:17:43" (1/2) ... [2024-02-07 19:17:44,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c02ac3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:17:44, skipping insertion in model container [2024-02-07 19:17:44,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:17:44" (2/2) ... [2024-02-07 19:17:44,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8e764e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44, skipping insertion in model container [2024-02-07 19:17:44,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:17:44" (2/2) ... [2024-02-07 19:17:44,154 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:17:44,182 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:17:44,183 INFO L76 edCorrectnessWitness]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-02-07 19:17:44,183 INFO L76 edCorrectnessWitness]: Location invariant before [L106-L106] ok == (_Bool)0 || ok == (_Bool)1 [2024-02-07 19:17:44,183 INFO L76 edCorrectnessWitness]: Location invariant before [L52-L52] 0 <= i [2024-02-07 19:17:44,183 INFO L76 edCorrectnessWitness]: Location invariant before [L76-L76] ok == (_Bool)0 || ok == (_Bool)1 [2024-02-07 19:17:44,184 INFO L76 edCorrectnessWitness]: Location invariant before [L55-L55] 0 <= i [2024-02-07 19:17:44,185 INFO L76 edCorrectnessWitness]: Location invariant before [L59-L59] 1 <= i [2024-02-07 19:17:44,187 INFO L76 edCorrectnessWitness]: Location invariant before [L58-L58] 0 <= i [2024-02-07 19:17:44,187 INFO L76 edCorrectnessWitness]: Location invariant before [L118-L118] ((-1LL - (long long )i) + (long long )size >= 0LL) && ((((((((((-9LL + (long long )i) + (long long )size >= 0LL && i == 4) || ((-7LL + (long long )i) + (long long )size >= 0LL && i == 3)) || ((-5LL + (long long )i) + (long long )size >= 0LL && i == 2)) || ((-3LL + (long long )i) + (long long )size >= 0LL && i == 1)) || (((-1LL + (long long )i) + (long long )size >= 0LL && 0 == i) && i == 0)) || ((((8 <= i && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1)) || ((-15LL + (long long )i) + (long long )size >= 0LL && i == 7)) || ((-13LL + (long long )i) + (long long )size >= 0LL && i == 6)) || ((-11LL + (long long )i) + (long long )size >= 0LL && i == 5)) [2024-02-07 19:17:44,187 INFO L76 edCorrectnessWitness]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L71-L71] (-2147483647 <= end) && (start <= 2147483646) [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L49-L49] 0 <= i [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant after [L67-L67] 0 <= i [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L120-L120] (long long )i - (long long )size >= 0LL [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L75-L75] ok == (_Bool)0 || ok == (_Bool)1 [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L91-L91] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-02-07 19:17:44,188 INFO L76 edCorrectnessWitness]: Location invariant before [L89-L89] (((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (ok == (_Bool)1) [2024-02-07 19:17:44,189 INFO L76 edCorrectnessWitness]: Location invariant before [L67-L67] 0 <= i [2024-02-07 19:17:44,189 INFO L76 edCorrectnessWitness]: Location invariant before [L51-L51] 0 <= end [2024-02-07 19:17:44,189 INFO L76 edCorrectnessWitness]: Location invariant before [L54-L54] -2147483647 <= end [2024-02-07 19:17:44,189 INFO L76 edCorrectnessWitness]: Location invariant before [L78-L78] 0 <= i [2024-02-07 19:17:44,189 INFO L76 edCorrectnessWitness]: Location invariant before [L74-L74] -2147483647 <= start [2024-02-07 19:17:44,206 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:17:44,330 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-inc-subseq.wvr.c[2950,2963] [2024-02-07 19:17:44,338 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:17:44,344 INFO L206 MainTranslator]: Completed pre-run 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:17:44,374 WARN L423 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-07 19:17:44,374 WARN L423 MainDispatcher]: Unable to annotate cond = i < N || start < end 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 Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:17:44,398 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-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local [2024-02-07 19:17:44,405 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:17:44,417 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:17:44,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44 WrapperNode [2024-02-07 19:17:44,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:17:44,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:17:44,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:17:44,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:17:44,433 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:17:44" (1/1) ... [2024-02-07 19:17:44,440 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:17:44" (1/1) ... [2024-02-07 19:17:44,483 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 220 [2024-02-07 19:17:44,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:17:44,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:17:44,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:17:44,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:17:44,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,517 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-07 19:17:44,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:17:44,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:17:44,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:17:44,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:17:44,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (1/1) ... [2024-02-07 19:17:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:17:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:17:44,580 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:17:44,596 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:17:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:17:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:17:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:17:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:17:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:17:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:17:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:17:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:17:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:17:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:17:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:17:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:17:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:17:44,630 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:17:44,731 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:17:44,733 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:17:45,061 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:17:45,062 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:17:45,252 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:17:45,252 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 19:17:45,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:17:45 BoogieIcfgContainer [2024-02-07 19:17:45,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:17:45,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:17:45,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:17:45,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:17:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:17:43" (1/4) ... [2024-02-07 19:17:45,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26880059 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:17:45, skipping insertion in model container [2024-02-07 19:17:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:17:44" (2/4) ... [2024-02-07 19:17:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26880059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:17:45, skipping insertion in model container [2024-02-07 19:17:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:17:44" (3/4) ... [2024-02-07 19:17:45,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26880059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:17:45, skipping insertion in model container [2024-02-07 19:17:45,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:17:45" (4/4) ... [2024-02-07 19:17:45,262 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-02-07 19:17:45,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:17:45,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-07 19:17:45,275 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:17:45,319 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 19:17:45,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 142 flow [2024-02-07 19:17:45,382 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2024-02-07 19:17:45,382 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 19:17:45,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 5/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 124 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-02-07 19:17:45,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 64 transitions, 142 flow [2024-02-07 19:17:45,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 61 transitions, 134 flow [2024-02-07 19:17:45,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:17:45,410 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;@6dc6eb58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:17:45,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-02-07 19:17:45,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:17:45,413 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:17:45,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:17:45,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:45,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:17:45,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:45,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 20479, now seen corresponding path program 1 times [2024-02-07 19:17:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587951920] [2024-02-07 19:17:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:45,640 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:17:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:17:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587951920] [2024-02-07 19:17:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587951920] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:17:45,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:17:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:17:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002725441] [2024-02-07 19:17:45,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:17:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:17:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:17:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:17:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:17:45,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-02-07 19:17:45,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:17:45,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:17:45,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-02-07 19:17:45,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:17:45,809 INFO L124 PetriNetUnfolderBase]: 344/641 cut-off events. [2024-02-07 19:17:45,810 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-07 19:17:45,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 641 events. 344/641 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3166 event pairs, 229 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 1094. Up to 544 conditions per place. [2024-02-07 19:17:45,817 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-02-07 19:17:45,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 194 flow [2024-02-07 19:17:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:17:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:17:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:17:45,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-02-07 19:17:45,826 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 134 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:17:45,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 194 flow [2024-02-07 19:17:45,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 19:17:45,831 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 118 flow [2024-02-07 19:17:45,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2024-02-07 19:17:45,834 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2024-02-07 19:17:45,835 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 118 flow [2024-02-07 19:17:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:17:45,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:45,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 19:17:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:17:45,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:45,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 635465, now seen corresponding path program 1 times [2024-02-07 19:17:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143279899] [2024-02-07 19:17:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:45,973 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:17:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:17:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143279899] [2024-02-07 19:17:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143279899] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:17:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:17:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:17:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983604913] [2024-02-07 19:17:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:17:45,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:17:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:17:45,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:17:45,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:17:45,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2024-02-07 19:17:45,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:17:45,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:17:45,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2024-02-07 19:17:45,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:17:46,141 INFO L124 PetriNetUnfolderBase]: 416/731 cut-off events. [2024-02-07 19:17:46,142 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-07 19:17:46,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 731 events. 416/731 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3498 event pairs, 289 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 1396. Up to 661 conditions per place. [2024-02-07 19:17:46,147 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 36 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2024-02-07 19:17:46,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 194 flow [2024-02-07 19:17:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:17:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:17:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-02-07 19:17:46,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-02-07 19:17:46,151 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 118 flow. Second operand 4 states and 108 transitions. [2024-02-07 19:17:46,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 194 flow [2024-02-07 19:17:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:17:46,153 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 118 flow [2024-02-07 19:17:46,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-02-07 19:17:46,154 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2024-02-07 19:17:46,155 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 118 flow [2024-02-07 19:17:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:17:46,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:46,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:17:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:17:46,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:46,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1524927546, now seen corresponding path program 1 times [2024-02-07 19:17:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:46,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834787249] [2024-02-07 19:17:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:46,263 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:17:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:17:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834787249] [2024-02-07 19:17:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834787249] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:17:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:17:46,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:17:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608055017] [2024-02-07 19:17:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:17:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:17:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:17:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:17:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:17:46,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:17:46,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:17:46,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:17:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:17:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:17:46,357 INFO L124 PetriNetUnfolderBase]: 346/646 cut-off events. [2024-02-07 19:17:46,357 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:17:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 646 events. 346/646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3151 event pairs, 229 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 1204. Up to 554 conditions per place. [2024-02-07 19:17:46,360 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 38 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-02-07 19:17:46,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 222 flow [2024-02-07 19:17:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:17:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:17:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-02-07 19:17:46,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 19:17:46,362 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 118 flow. Second operand 4 states and 128 transitions. [2024-02-07 19:17:46,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 222 flow [2024-02-07 19:17:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:17:46,363 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 166 flow [2024-02-07 19:17:46,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2024-02-07 19:17:46,364 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2024-02-07 19:17:46,364 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 166 flow [2024-02-07 19:17:46,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:17:46,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:46,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:17:46,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:17:46,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:46,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1524927495, now seen corresponding path program 1 times [2024-02-07 19:17:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455663080] [2024-02-07 19:17:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:46,408 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:17:46,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:17:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455663080] [2024-02-07 19:17:46,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455663080] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:17:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:17:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:17:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463708733] [2024-02-07 19:17:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:17:46,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:17:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:17:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:17:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:17:46,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2024-02-07 19:17:46,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:17:46,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:17:46,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2024-02-07 19:17:46,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:17:46,583 INFO L124 PetriNetUnfolderBase]: 583/1010 cut-off events. [2024-02-07 19:17:46,583 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-07 19:17:46,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 1010 events. 583/1010 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5190 event pairs, 159 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 1948. Up to 601 conditions per place. [2024-02-07 19:17:46,588 INFO L140 encePairwiseOnDemand]: 48/64 looper letters, 59 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2024-02-07 19:17:46,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 356 flow [2024-02-07 19:17:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:17:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:17:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-02-07 19:17:46,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2024-02-07 19:17:46,590 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 166 flow. Second operand 5 states and 166 transitions. [2024-02-07 19:17:46,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 356 flow [2024-02-07 19:17:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:17:46,592 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 217 flow [2024-02-07 19:17:46,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-02-07 19:17:46,593 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 19:17:46,593 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 217 flow [2024-02-07 19:17:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:17:46,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:46,593 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:17:46,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:17:46,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:46,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -871503232, now seen corresponding path program 1 times [2024-02-07 19:17:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288762262] [2024-02-07 19:17:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:46,665 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:17:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:17:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288762262] [2024-02-07 19:17:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288762262] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:17:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810639218] [2024-02-07 19:17:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:46,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:17:46,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:17:46,683 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:17:46,704 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:17:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:17:46,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-07 19:17:46,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:17:46,786 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:17:46,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:17:47,054 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:17:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810639218] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:17:47,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:17:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-02-07 19:17:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656650212] [2024-02-07 19:17:47,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:17:47,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 19:17:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:17:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 19:17:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-02-07 19:17:47,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:17:47,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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:17:47,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:17:47,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:17:47,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:17:47,376 INFO L124 PetriNetUnfolderBase]: 533/986 cut-off events. [2024-02-07 19:17:47,376 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-02-07 19:17:47,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 986 events. 533/986 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5243 event pairs, 369 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1953. Up to 853 conditions per place. [2024-02-07 19:17:47,381 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 40 selfloop transitions, 27 changer transitions 0/81 dead transitions. [2024-02-07 19:17:47,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 423 flow [2024-02-07 19:17:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-07 19:17:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-07 19:17:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-02-07 19:17:47,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-02-07 19:17:47,384 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 217 flow. Second operand 10 states and 270 transitions. [2024-02-07 19:17:47,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 423 flow [2024-02-07 19:17:47,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:17:47,389 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 370 flow [2024-02-07 19:17:47,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=370, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-02-07 19:17:47,391 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2024-02-07 19:17:47,391 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 370 flow [2024-02-07 19:17:47,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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:17:47,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:17:47,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:17:47,405 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:17:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:17:47,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-07 19:17:47,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:17:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -871503181, now seen corresponding path program 1 times [2024-02-07 19:17:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:17:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292446093] [2024-02-07 19:17:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:17:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:17:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:17:47,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:17:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:17:47,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:17:47,642 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:17:47,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-02-07 19:17:47,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-02-07 19:17:47,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-02-07 19:17:47,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-02-07 19:17:47,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-02-07 19:17:47,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-02-07 19:17:47,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-02-07 19:17:47,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-02-07 19:17:47,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 36 remaining) [2024-02-07 19:17:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:17:47,648 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-02-07 19:17:47,653 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:17:47,653 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:17:47,680 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 19:17:47,693 INFO L503 ceAbstractionStarter]: Automizer considered 21 witness invariants [2024-02-07 19:17:47,693 INFO L504 ceAbstractionStarter]: WitnessConsidered=21 [2024-02-07 19:17:47,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:17:47 BasicIcfg [2024-02-07 19:17:47,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:17:47,696 INFO L158 Benchmark]: Toolchain (without parser) took 3551.19ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 86.1MB in the beginning and 57.5MB in the end (delta: 28.6MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,696 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:17:47,696 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 71.3MB in the end (delta: 193.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:17:47,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 68.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.46ms. Allocated memory is still 144.7MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,698 INFO L158 Benchmark]: Boogie Preprocessor took 48.17ms. Allocated memory is still 144.7MB. Free memory was 66.3MB in the beginning and 63.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,699 INFO L158 Benchmark]: RCFGBuilder took 718.77ms. Allocated memory is still 144.7MB. Free memory was 63.0MB in the beginning and 66.4MB in the end (delta: -3.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,699 INFO L158 Benchmark]: TraceAbstraction took 2438.35ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 65.7MB in the beginning and 57.5MB in the end (delta: 8.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-02-07 19:17:47,701 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.14ms. Allocated memory is still 107.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 71.3MB in the end (delta: 193.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 68.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.46ms. Allocated memory is still 144.7MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.17ms. Allocated memory is still 144.7MB. Free memory was 66.3MB in the beginning and 63.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 718.77ms. Allocated memory is still 144.7MB. Free memory was 63.0MB in the beginning and 66.4MB in the end (delta: -3.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2438.35ms. Allocated memory was 144.7MB in the beginning and 197.1MB in the end (delta: 52.4MB). Free memory was 65.7MB in the beginning and 57.5MB in the end (delta: 8.2MB). Peak memory consumption was 60.3MB. 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 120]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *queue, *A; [L42] int i, N, n, last, start, end, new, v_old; [L43] _Bool ok; [L86] pthread_t t1, t2; VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] [L88] ok = 1 VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] [L91] start = __VERIFIER_nondet_int() [L92] end = start [L93] CALL create_fresh_int_array(n) [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L114] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L116] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] int i = 0; VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L117] COND TRUE i < size VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]]]]] [L118] arr[i] = __VERIFIER_nondet_int() [L117] i++ VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L117] COND FALSE !(i < size) [L120] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 58]: 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: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: 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: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: 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: 102]: 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: 101]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 90 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 14 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 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:17:47,736 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