./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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/parallel-misc-1.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.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.extract-columns-fced0e8-m [2024-01-31 16:09:02,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:09:02,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:09:02,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:09:02,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:09:02,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:09:02,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:09:02,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:09:02,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:09:02,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:09:02,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:09:02,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:09:02,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:09:02,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:09:02,553 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:09:02,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:09:02,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:09:02,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:09:02,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:09:02,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:09:02,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:09:02,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:09:02,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:09:02,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:09:02,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:09:02,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:09:02,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:09:02,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:09:02,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:09:02,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:09:02,557 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:09:02,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:09:02,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:09:02,559 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-01-31 16:09:02,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:09:02,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:09:02,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:09:02,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:09:02,905 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:09:02,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-31 16:09:03,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:09:04,154 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:09:04,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-31 16:09:04,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c508bf1/56667c61facf434abb5a4684623751b1/FLAG36e6fb84c [2024-01-31 16:09:04,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7c508bf1/56667c61facf434abb5a4684623751b1 [2024-01-31 16:09:04,181 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:09:04,182 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:09:04,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.wvr.yml/witness.yml [2024-01-31 16:09:04,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:09:04,295 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:09:04,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:09:04,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:09:04,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:09:04,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:09:04" (1/2) ... [2024-01-31 16:09:04,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364e5ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:09:04, skipping insertion in model container [2024-01-31 16:09:04,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:09:04" (1/2) ... [2024-01-31 16:09:04,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ba9764a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:09:04, skipping insertion in model container [2024-01-31 16:09:04,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:09:04" (2/2) ... [2024-01-31 16:09:04,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364e5ac3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04, skipping insertion in model container [2024-01-31 16:09:04,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:09:04" (2/2) ... [2024-01-31 16:09:04,305 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:09:04,355 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:09:04,356 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,356 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,356 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((((((((A == 0) && (bag2 == 0)) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,356 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-31 16:09:04,356 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((((A == 0) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((((((A == 0) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (b <= -1) && (b != 0) [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (A == 0) && (N == 0) [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,357 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((A == 0) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L63] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,358 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L113] (A == 0) && ((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && i != 1) || ((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) [2024-01-31 16:09:04,359 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((A == 0) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,359 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((((((((A == 0) && (bag1 == 0)) && (bag2 == 0)) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,359 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,359 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (size != 0)) && (((((((((((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0) [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((A == 0) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] (1 <= b) && (b != 0) [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,360 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-31 16:09:04,361 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((A == 0) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-31 16:09:04,361 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L46] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,361 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-31 16:09:04,381 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:09:04,630 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/parallel-misc-1.wvr.c[2781,2794] [2024-01-31 16:09:04,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:09:04,684 INFO L204 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:09:04,800 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/parallel-misc-1.wvr.c[2781,2794] Start Parsing Local Start Parsing Local [2024-01-31 16:09:04,804 WARN L424 MainDispatcher]: Unable to annotate * arr = (int*)malloc(sizeof(int) * (size_t)size) with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:09:04,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:09:04,830 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:09:04,830 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04 WrapperNode [2024-01-31 16:09:04,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:09:04,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:09:04,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:09:04,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:09:04,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,895 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 336 [2024-01-31 16:09:04,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:09:04,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:09:04,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:09:04,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:09:04,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,952 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 7, 2, 2]. 54 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 16:09:04,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:09:04,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:09:04,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:09:04,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:09:04,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (1/1) ... [2024-01-31 16:09:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:09:05,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:09:05,017 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-01-31 16:09:05,033 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-01-31 16:09:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:09:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:09:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:09:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:09:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:09:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:09:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:09:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:09:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:09:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 16:09:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:09:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:09:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:09:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:09:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:09:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:09:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:09:05,077 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:09:05,199 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:09:05,201 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:09:05,686 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:09:05,686 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:09:06,007 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:09:06,007 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-31 16:09:06,008 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:09:06 BoogieIcfgContainer [2024-01-31 16:09:06,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:09:06,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:09:06,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:09:06,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:09:06,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:09:04" (1/4) ... [2024-01-31 16:09:06,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593c9f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:09:06, skipping insertion in model container [2024-01-31 16:09:06,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:09:04" (2/4) ... [2024-01-31 16:09:06,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593c9f4d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:09:06, skipping insertion in model container [2024-01-31 16:09:06,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:09:04" (3/4) ... [2024-01-31 16:09:06,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593c9f4d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:09:06, skipping insertion in model container [2024-01-31 16:09:06,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:09:06" (4/4) ... [2024-01-31 16:09:06,017 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-31 16:09:06,032 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:09:06,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-01-31 16:09:06,032 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:09:06,109 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:09:06,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 256 flow [2024-01-31 16:09:06,196 INFO L124 PetriNetUnfolderBase]: 7/119 cut-off events. [2024-01-31 16:09:06,196 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:09:06,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 119 events. 7/119 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 350 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2024-01-31 16:09:06,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 256 flow [2024-01-31 16:09:06,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 248 flow [2024-01-31 16:09:06,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:09:06,225 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;@1ad428d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:09:06,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2024-01-31 16:09:06,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:09:06,229 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:09:06,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:09:06,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:06,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:09:06,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:06,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 33718, now seen corresponding path program 1 times [2024-01-31 16:09:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338472439] [2024-01-31 16:09:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:06,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338472439] [2024-01-31 16:09:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338472439] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:06,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346670907] [2024-01-31 16:09:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:06,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:06,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 121 [2024-01-31 16:09:06,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-01-31 16:09:06,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:06,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 121 [2024-01-31 16:09:06,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:07,039 INFO L124 PetriNetUnfolderBase]: 1186/2740 cut-off events. [2024-01-31 16:09:07,040 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-01-31 16:09:07,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 2740 events. 1186/2740 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20037 event pairs, 961 based on Foata normal form. 147/2713 useless extension candidates. Maximal degree in co-relation 4474. Up to 1931 conditions per place. [2024-01-31 16:09:07,057 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 70 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-31 16:09:07,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 386 flow [2024-01-31 16:09:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-01-31 16:09:07,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785123966942148 [2024-01-31 16:09:07,068 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 248 flow. Second operand 3 states and 210 transitions. [2024-01-31 16:09:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 386 flow [2024-01-31 16:09:07,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 378 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:09:07,074 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 238 flow [2024-01-31 16:09:07,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-01-31 16:09:07,078 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-01-31 16:09:07,078 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 238 flow [2024-01-31 16:09:07,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-01-31 16:09:07,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:07,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:09:07,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:09:07,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:07,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1046388, now seen corresponding path program 1 times [2024-01-31 16:09:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413342993] [2024-01-31 16:09:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413342993] [2024-01-31 16:09:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413342993] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383619314] [2024-01-31 16:09:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:07,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:07,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2024-01-31 16:09:07,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-01-31 16:09:07,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:07,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2024-01-31 16:09:07,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:07,507 INFO L124 PetriNetUnfolderBase]: 1186/2739 cut-off events. [2024-01-31 16:09:07,507 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4693 conditions, 2739 events. 1186/2739 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20044 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4684. Up to 1929 conditions per place. [2024-01-31 16:09:07,517 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 69 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-01-31 16:09:07,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 378 flow [2024-01-31 16:09:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-01-31 16:09:07,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785123966942148 [2024-01-31 16:09:07,520 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 238 flow. Second operand 3 states and 210 transitions. [2024-01-31 16:09:07,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 378 flow [2024-01-31 16:09:07,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:07,522 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 236 flow [2024-01-31 16:09:07,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2024-01-31 16:09:07,523 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2024-01-31 16:09:07,523 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 236 flow [2024-01-31 16:09:07,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-01-31 16:09:07,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:07,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:09:07,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:09:07,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:07,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:07,524 INFO L85 PathProgramCache]: Analyzing trace with hash 32439086, now seen corresponding path program 1 times [2024-01-31 16:09:07,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739896207] [2024-01-31 16:09:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739896207] [2024-01-31 16:09:07,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739896207] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610298980] [2024-01-31 16:09:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:07,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:07,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 121 [2024-01-31 16:09:07,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-01-31 16:09:07,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:07,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 121 [2024-01-31 16:09:07,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:07,867 INFO L124 PetriNetUnfolderBase]: 1186/2738 cut-off events. [2024-01-31 16:09:07,867 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2738 events. 1186/2738 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20049 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4680. Up to 1927 conditions per place. [2024-01-31 16:09:07,877 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 68 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-01-31 16:09:07,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 374 flow [2024-01-31 16:09:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2024-01-31 16:09:07,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5840220385674931 [2024-01-31 16:09:07,879 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 236 flow. Second operand 3 states and 212 transitions. [2024-01-31 16:09:07,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 374 flow [2024-01-31 16:09:07,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:07,881 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 234 flow [2024-01-31 16:09:07,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-01-31 16:09:07,881 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2024-01-31 16:09:07,881 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 234 flow [2024-01-31 16:09:07,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-01-31 16:09:07,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:07,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:09:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:09:07,882 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:07,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1005612698, now seen corresponding path program 1 times [2024-01-31 16:09:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197674848] [2024-01-31 16:09:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197674848] [2024-01-31 16:09:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197674848] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:07,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487382011] [2024-01-31 16:09:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:07,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:07,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 121 [2024-01-31 16:09:07,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-01-31 16:09:07,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:07,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 121 [2024-01-31 16:09:07,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:08,176 INFO L124 PetriNetUnfolderBase]: 1186/2737 cut-off events. [2024-01-31 16:09:08,176 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:08,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2737 events. 1186/2737 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20037 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4676. Up to 1925 conditions per place. [2024-01-31 16:09:08,186 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 67 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-01-31 16:09:08,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 370 flow [2024-01-31 16:09:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2024-01-31 16:09:08,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5895316804407713 [2024-01-31 16:09:08,187 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 234 flow. Second operand 3 states and 214 transitions. [2024-01-31 16:09:08,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 370 flow [2024-01-31 16:09:08,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:08,189 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 232 flow [2024-01-31 16:09:08,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2024-01-31 16:09:08,190 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -6 predicate places. [2024-01-31 16:09:08,190 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 232 flow [2024-01-31 16:09:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-01-31 16:09:08,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:08,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:09:08,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:09:08,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:08,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1109223643, now seen corresponding path program 1 times [2024-01-31 16:09:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800035794] [2024-01-31 16:09:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800035794] [2024-01-31 16:09:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800035794] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370285390] [2024-01-31 16:09:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:08,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2024-01-31 16:09:08,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-31 16:09:08,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:08,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2024-01-31 16:09:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:08,491 INFO L124 PetriNetUnfolderBase]: 1186/2736 cut-off events. [2024-01-31 16:09:08,491 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:08,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2736 events. 1186/2736 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20034 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4672. Up to 1923 conditions per place. [2024-01-31 16:09:08,504 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 66 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-31 16:09:08,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 366 flow [2024-01-31 16:09:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2024-01-31 16:09:08,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5950413223140496 [2024-01-31 16:09:08,506 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 232 flow. Second operand 3 states and 216 transitions. [2024-01-31 16:09:08,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 366 flow [2024-01-31 16:09:08,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:08,508 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 230 flow [2024-01-31 16:09:08,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2024-01-31 16:09:08,509 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2024-01-31 16:09:08,509 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 230 flow [2024-01-31 16:09:08,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-01-31 16:09:08,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:08,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:08,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:09:08,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:08,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 26195670, now seen corresponding path program 1 times [2024-01-31 16:09:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809530490] [2024-01-31 16:09:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809530490] [2024-01-31 16:09:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809530490] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766296238] [2024-01-31 16:09:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:08,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:08,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:08,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121 [2024-01-31 16:09:08,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-01-31 16:09:08,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:08,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121 [2024-01-31 16:09:08,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:08,789 INFO L124 PetriNetUnfolderBase]: 1186/2735 cut-off events. [2024-01-31 16:09:08,789 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:08,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2735 events. 1186/2735 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20017 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4668. Up to 1921 conditions per place. [2024-01-31 16:09:08,802 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 65 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-01-31 16:09:08,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 110 transitions, 362 flow [2024-01-31 16:09:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-01-31 16:09:08,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005509641873278 [2024-01-31 16:09:08,804 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 230 flow. Second operand 3 states and 218 transitions. [2024-01-31 16:09:08,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 110 transitions, 362 flow [2024-01-31 16:09:08,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:08,806 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 228 flow [2024-01-31 16:09:08,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-01-31 16:09:08,806 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-01-31 16:09:08,807 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 228 flow [2024-01-31 16:09:08,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-01-31 16:09:08,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:08,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:08,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:09:08,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:08,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 812066857, now seen corresponding path program 1 times [2024-01-31 16:09:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607291134] [2024-01-31 16:09:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607291134] [2024-01-31 16:09:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607291134] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250646380] [2024-01-31 16:09:08,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:08,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:08,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 121 [2024-01-31 16:09:08,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-01-31 16:09:08,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:08,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 121 [2024-01-31 16:09:08,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:09,067 INFO L124 PetriNetUnfolderBase]: 1186/2734 cut-off events. [2024-01-31 16:09:09,068 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:09,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2734 events. 1186/2734 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19982 event pairs, 961 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 4664. Up to 1919 conditions per place. [2024-01-31 16:09:09,079 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 64 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-31 16:09:09,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 109 transitions, 358 flow [2024-01-31 16:09:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-01-31 16:09:09,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-01-31 16:09:09,080 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 228 flow. Second operand 3 states and 220 transitions. [2024-01-31 16:09:09,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 109 transitions, 358 flow [2024-01-31 16:09:09,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:09,082 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 226 flow [2024-01-31 16:09:09,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-01-31 16:09:09,083 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -9 predicate places. [2024-01-31 16:09:09,083 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 226 flow [2024-01-31 16:09:09,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-01-31 16:09:09,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:09,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:09:09,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:09,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -595730075, now seen corresponding path program 1 times [2024-01-31 16:09:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:09,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995547516] [2024-01-31 16:09:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:09,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995547516] [2024-01-31 16:09:09,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995547516] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:09,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:09,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108762695] [2024-01-31 16:09:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:09,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:09,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:09,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 121 [2024-01-31 16:09:09,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-01-31 16:09:09,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:09,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 121 [2024-01-31 16:09:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:09,351 INFO L124 PetriNetUnfolderBase]: 1126/2651 cut-off events. [2024-01-31 16:09:09,352 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:09,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 2651 events. 1126/2651 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 19712 event pairs, 907 based on Foata normal form. 0/2455 useless extension candidates. Maximal degree in co-relation 4479. Up to 1819 conditions per place. [2024-01-31 16:09:09,361 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 62 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2024-01-31 16:09:09,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 352 flow [2024-01-31 16:09:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-31 16:09:09,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170798898071626 [2024-01-31 16:09:09,363 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 226 flow. Second operand 3 states and 224 transitions. [2024-01-31 16:09:09,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 352 flow [2024-01-31 16:09:09,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:09,365 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 224 flow [2024-01-31 16:09:09,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-01-31 16:09:09,365 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-01-31 16:09:09,366 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 224 flow [2024-01-31 16:09:09,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-01-31 16:09:09,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:09,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:09:09,366 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:09,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1287762095, now seen corresponding path program 1 times [2024-01-31 16:09:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315938158] [2024-01-31 16:09:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315938158] [2024-01-31 16:09:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315938158] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277810899] [2024-01-31 16:09:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:09,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:09,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 121 [2024-01-31 16:09:09,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-01-31 16:09:09,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:09,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 121 [2024-01-31 16:09:09,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:09,627 INFO L124 PetriNetUnfolderBase]: 1069/2587 cut-off events. [2024-01-31 16:09:09,627 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:09,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 2587 events. 1069/2587 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19558 event pairs, 856 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 4319. Up to 1724 conditions per place. [2024-01-31 16:09:09,636 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 60 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-01-31 16:09:09,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 346 flow [2024-01-31 16:09:09,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2024-01-31 16:09:09,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.628099173553719 [2024-01-31 16:09:09,637 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 224 flow. Second operand 3 states and 228 transitions. [2024-01-31 16:09:09,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 346 flow [2024-01-31 16:09:09,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:09,639 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 222 flow [2024-01-31 16:09:09,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-01-31 16:09:09,640 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-01-31 16:09:09,640 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 222 flow [2024-01-31 16:09:09,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-01-31 16:09:09,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:09,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:09:09,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:09,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1265918162, now seen corresponding path program 1 times [2024-01-31 16:09:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532760469] [2024-01-31 16:09:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:09:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:09:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:09:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532760469] [2024-01-31 16:09:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532760469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:09:09,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:09:09,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:09:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569146085] [2024-01-31 16:09:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:09:09,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:09:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:09:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:09:09,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:09:09,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 121 [2024-01-31 16:09:09,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-31 16:09:09,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:09:09,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 121 [2024-01-31 16:09:09,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:09:09,859 INFO L124 PetriNetUnfolderBase]: 1069/2584 cut-off events. [2024-01-31 16:09:09,859 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-31 16:09:09,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 2584 events. 1069/2584 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19559 event pairs, 856 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 4311. Up to 1714 conditions per place. [2024-01-31 16:09:09,869 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 57 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2024-01-31 16:09:09,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 334 flow [2024-01-31 16:09:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:09:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:09:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-01-31 16:09:09,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6336088154269972 [2024-01-31 16:09:09,871 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 222 flow. Second operand 3 states and 230 transitions. [2024-01-31 16:09:09,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 334 flow [2024-01-31 16:09:09,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:09:09,872 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 216 flow [2024-01-31 16:09:09,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2024-01-31 16:09:09,873 INFO L281 CegarLoopForPetriNet]: 118 programPoint places, -14 predicate places. [2024-01-31 16:09:09,873 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 216 flow [2024-01-31 16:09:09,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-31 16:09:09,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:09:09,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:09,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:09:09,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-31 16:09:09,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:09:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1140970227, now seen corresponding path program 1 times [2024-01-31 16:09:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:09:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201441094] [2024-01-31 16:09:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:09:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:09:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:09:09,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:09:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:09:09,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:09:09,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:09:09,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 82 remaining) [2024-01-31 16:09:09,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 82 remaining) [2024-01-31 16:09:09,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 82 remaining) [2024-01-31 16:09:09,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 82 remaining) [2024-01-31 16:09:09,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 82 remaining) [2024-01-31 16:09:09,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 82 remaining) [2024-01-31 16:09:09,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 82 remaining) [2024-01-31 16:09:09,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (34 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 82 remaining) [2024-01-31 16:09:09,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 82 remaining) [2024-01-31 16:09:09,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 82 remaining) [2024-01-31 16:09:09,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 82 remaining) [2024-01-31 16:09:09,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 82 remaining) [2024-01-31 16:09:09,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 82 remaining) [2024-01-31 16:09:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 82 remaining) [2024-01-31 16:09:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 82 remaining) [2024-01-31 16:09:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 82 remaining) [2024-01-31 16:09:09,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 82 remaining) [2024-01-31 16:09:09,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:09:09,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:09:09,936 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:09:09,936 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:09:09,955 INFO L503 ceAbstractionStarter]: Automizer considered 47 witness invariants [2024-01-31 16:09:09,955 INFO L504 ceAbstractionStarter]: WitnessConsidered=47 [2024-01-31 16:09:09,956 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:09:09 BasicIcfg [2024-01-31 16:09:09,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:09:09,957 INFO L158 Benchmark]: Toolchain (without parser) took 5661.77ms. Allocated memory was 155.2MB in the beginning and 354.4MB in the end (delta: 199.2MB). Free memory was 78.7MB in the beginning and 138.2MB in the end (delta: -59.5MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,957 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:09:09,957 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:09:09,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.11ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 78.6MB in the beginning and 162.7MB in the end (delta: -84.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.82ms. Allocated memory is still 201.3MB. Free memory was 162.7MB in the beginning and 158.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,958 INFO L158 Benchmark]: Boogie Preprocessor took 82.57ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,958 INFO L158 Benchmark]: RCFGBuilder took 1017.03ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 132.7kB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,958 INFO L158 Benchmark]: TraceAbstraction took 3945.42ms. Allocated memory was 201.3MB in the beginning and 354.4MB in the end (delta: 153.1MB). Free memory was 153.1MB in the beginning and 138.2MB in the end (delta: 14.9MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-01-31 16:09:09,959 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.11ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 78.6MB in the beginning and 162.7MB in the end (delta: -84.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.82ms. Allocated memory is still 201.3MB. Free memory was 162.7MB in the beginning and 158.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.57ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.03ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 132.7kB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3945.42ms. Allocated memory was 201.3MB in the beginning and 354.4MB in the end (delta: 153.1MB). Free memory was 153.1MB in the beginning and 138.2MB in the end (delta: 14.9MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 113]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L39] int* A; [L40] int bag1, bag2, cap1, cap2, sum1, sum2, i, j, N; [L80] pthread_t t1, t2; VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L83] bag1 = __VERIFIER_nondet_int() [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L84] bag2 = __VERIFIER_nondet_int() [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L86] cap2 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L87] sum1 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L89] i = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L90] j = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L91] N = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(N) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size >= 0) [L36] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size >= 0) [L110] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L110] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE !(!cond) [L110] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L112] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=0, i=2, j=0, size=0, sum1=0, sum2=0] - UnprovableResult [Line: 46]: 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: 47]: 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: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 48]: 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: 120]: 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: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: 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: 64]: 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: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: 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: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: 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: 98]: 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: 97]: 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, 189 locations, 82 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: 3.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1397 IncrementalHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 72 mSDtfsCounter, 1397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:09:09,999 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