./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.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/popl20-two-queue.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/popl20-two-queue.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.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:11:39,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:11:39,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:11:39,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:11:39,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:11:39,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:11:39,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:11:39,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:11:39,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:11:39,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:11:39,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:11:39,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:11:39,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:11:39,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:11:39,667 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:11:39,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:11:39,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:11:39,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:11:39,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:11:39,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:11:39,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:11:39,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:11:39,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:11:39,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:11:39,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:11:39,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:11:39,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:11:39,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:11:39,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:11:39,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:11:39,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:11:39,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:11:39,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:39,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:11:39,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:11:39,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:11:39,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:11:39,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:11:39,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:11:39,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:11:39,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:11:39,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:11:39,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:11:39,682 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:11:39,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:11:39,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:11:39,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:11:39,961 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:11:39,961 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:11:39,962 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/popl20-two-queue.wvr.yml/witness.yml [2024-01-31 16:11:40,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:11:40,114 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:11:40,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-31 16:11:41,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:11:41,442 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:11:41,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-31 16:11:41,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e4a01fe/1e8249211d384717b978eb4196439281/FLAG2ff913d7b [2024-01-31 16:11:41,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e4a01fe/1e8249211d384717b978eb4196439281 [2024-01-31 16:11:41,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:11:41,472 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:11:41,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:41,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:11:41,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:11:41,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:40" (1/2) ... [2024-01-31 16:11:41,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10369533 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:41, skipping insertion in model container [2024-01-31 16:11:41,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:40" (1/2) ... [2024-01-31 16:11:41,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c7003f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:41, skipping insertion in model container [2024-01-31 16:11:41,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:41" (2/2) ... [2024-01-31 16:11:41,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10369533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41, skipping insertion in model container [2024-01-31 16:11:41,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:41" (2/2) ... [2024-01-31 16:11:41,487 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:11:41,551 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L65] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n2 == 0) [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0) [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,553 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((((((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (-2147483647 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,554 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((((q1 == 0) && (q2 == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0)) && (N == 0) [2024-01-31 16:11:41,555 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,556 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L47] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,556 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,556 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,556 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((((((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0)) && (j == 0)) && (size != 0)) && ((((((((((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)) || (((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1)) [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] ((((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (q2 == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,557 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (-2147483647 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= q1_back) && (q1_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (-2147483647 <= q2_front) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (((q1 == 0) && (q2 == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,558 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((((q1 == 0) && (q2 == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-01-31 16:11:41,559 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,559 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (-2147483647 <= q1_front) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,559 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] (i == 0) && (j == 0) [2024-01-31 16:11:41,561 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((-2147483647 <= q2_back) && (q2_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,561 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-31 16:11:41,561 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (0 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:41,561 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L112] (((q2 == 0) && (i == 0)) && (j == 0)) && (((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((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)) || (((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && size != 0) && i != 1)) [2024-01-31 16:11:41,584 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:11:41,779 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2024-01-31 16:11:41,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:41,805 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 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:11:41,910 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] Start Parsing Local Start Parsing Local [2024-01-31 16:11:41,912 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 [2024-01-31 16:11:41,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:41,943 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:11:41,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41 WrapperNode [2024-01-31 16:11:41,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:41,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:41,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:11:41,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:11:41,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:41,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,023 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 256 [2024-01-31 16:11:42,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:42,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:11:42,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:11:42,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:11:42,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,069 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 2, 6]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-01-31 16:11:42,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:11:42,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:11:42,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:11:42,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:11:42,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (1/1) ... [2024-01-31 16:11:42,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:11:42,118 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:11:42,149 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:11:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:11:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:11:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:11:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:11:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:11:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:11:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:11:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:11:42,170 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:11:42,302 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:11:42,304 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:11:42,817 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:11:42,817 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:11:43,147 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:11:43,147 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 16:11:43,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:43 BoogieIcfgContainer [2024-01-31 16:11:43,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:11:43,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:11:43,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:11:43,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:11:43,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:40" (1/4) ... [2024-01-31 16:11:43,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18067ebe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:11:43, skipping insertion in model container [2024-01-31 16:11:43,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:11:41" (2/4) ... [2024-01-31 16:11:43,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18067ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:43, skipping insertion in model container [2024-01-31 16:11:43,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:41" (3/4) ... [2024-01-31 16:11:43,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18067ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:43, skipping insertion in model container [2024-01-31 16:11:43,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:43" (4/4) ... [2024-01-31 16:11:43,159 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-31 16:11:43,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:11:43,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-01-31 16:11:43,177 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:11:43,245 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:11:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 224 flow [2024-01-31 16:11:43,338 INFO L124 PetriNetUnfolderBase]: 6/103 cut-off events. [2024-01-31 16:11:43,338 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:11:43,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 103 events. 6/103 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 219 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2024-01-31 16:11:43,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 224 flow [2024-01-31 16:11:43,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 102 transitions, 216 flow [2024-01-31 16:11:43,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:11:43,370 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;@6a6f875f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:11:43,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-01-31 16:11:43,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:11:43,373 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:11:43,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:43,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:43,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:11:43,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:43,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 24042, now seen corresponding path program 1 times [2024-01-31 16:11:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719785884] [2024-01-31 16:11:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:43,738 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:11:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719785884] [2024-01-31 16:11:43,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719785884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:43,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:43,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94997073] [2024-01-31 16:11:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:43,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:43,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 105 [2024-01-31 16:11:43,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:11:43,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:43,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 105 [2024-01-31 16:11:43,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:44,143 INFO L124 PetriNetUnfolderBase]: 240/621 cut-off events. [2024-01-31 16:11:44,144 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-31 16:11:44,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 621 events. 240/621 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3665 event pairs, 174 based on Foata normal form. 62/509 useless extension candidates. Maximal degree in co-relation 902. Up to 428 conditions per place. [2024-01-31 16:11:44,151 INFO L140 encePairwiseOnDemand]: 88/105 looper letters, 56 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-01-31 16:11:44,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 302 flow [2024-01-31 16:11:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2024-01-31 16:11:44,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-01-31 16:11:44,167 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 216 flow. Second operand 3 states and 166 transitions. [2024-01-31 16:11:44,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 302 flow [2024-01-31 16:11:44,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 294 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:11:44,176 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 182 flow [2024-01-31 16:11:44,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2024-01-31 16:11:44,183 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -15 predicate places. [2024-01-31 16:11:44,184 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 182 flow [2024-01-31 16:11:44,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:11:44,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:44,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:11:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:11:44,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:44,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 746030, now seen corresponding path program 1 times [2024-01-31 16:11:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551823632] [2024-01-31 16:11:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:44,347 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:11:44,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:44,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551823632] [2024-01-31 16:11:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551823632] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:44,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:44,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049927608] [2024-01-31 16:11:44,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:44,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:44,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 105 [2024-01-31 16:11:44,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:11:44,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:44,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 105 [2024-01-31 16:11:44,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:44,555 INFO L124 PetriNetUnfolderBase]: 215/616 cut-off events. [2024-01-31 16:11:44,556 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:44,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 616 events. 215/616 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3753 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 989. Up to 368 conditions per place. [2024-01-31 16:11:44,561 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 53 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-01-31 16:11:44,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 290 flow [2024-01-31 16:11:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2024-01-31 16:11:44,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2024-01-31 16:11:44,563 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 182 flow. Second operand 3 states and 158 transitions. [2024-01-31 16:11:44,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 290 flow [2024-01-31 16:11:44,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:44,566 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 180 flow [2024-01-31 16:11:44,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-01-31 16:11:44,567 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -16 predicate places. [2024-01-31 16:11:44,567 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 180 flow [2024-01-31 16:11:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:11:44,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:44,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:11:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:11:44,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:44,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 23127710, now seen corresponding path program 1 times [2024-01-31 16:11:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343363511] [2024-01-31 16:11:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:44,707 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:11:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343363511] [2024-01-31 16:11:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343363511] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:44,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075644419] [2024-01-31 16:11:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:44,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:44,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:44,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 105 [2024-01-31 16:11:44,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:11:44,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:44,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 105 [2024-01-31 16:11:44,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:44,901 INFO L124 PetriNetUnfolderBase]: 215/615 cut-off events. [2024-01-31 16:11:44,902 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:44,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 615 events. 215/615 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3746 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 985. Up to 366 conditions per place. [2024-01-31 16:11:44,905 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 52 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-31 16:11:44,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 286 flow [2024-01-31 16:11:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-01-31 16:11:44,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-01-31 16:11:44,907 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 180 flow. Second operand 3 states and 160 transitions. [2024-01-31 16:11:44,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 286 flow [2024-01-31 16:11:44,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 85 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:44,909 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 178 flow [2024-01-31 16:11:44,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2024-01-31 16:11:44,910 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -17 predicate places. [2024-01-31 16:11:44,910 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 178 flow [2024-01-31 16:11:44,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:11:44,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:44,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:11:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:11:44,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:44,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 716959811, now seen corresponding path program 1 times [2024-01-31 16:11:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101039090] [2024-01-31 16:11:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:45,006 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:11:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101039090] [2024-01-31 16:11:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101039090] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842126214] [2024-01-31 16:11:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:45,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:45,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2024-01-31 16:11:45,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:11:45,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:45,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2024-01-31 16:11:45,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:45,173 INFO L124 PetriNetUnfolderBase]: 215/614 cut-off events. [2024-01-31 16:11:45,174 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:45,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 614 events. 215/614 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3745 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 981. Up to 364 conditions per place. [2024-01-31 16:11:45,177 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 51 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2024-01-31 16:11:45,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 282 flow [2024-01-31 16:11:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-01-31 16:11:45,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-01-31 16:11:45,179 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 178 flow. Second operand 3 states and 162 transitions. [2024-01-31 16:11:45,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 282 flow [2024-01-31 16:11:45,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:45,182 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 176 flow [2024-01-31 16:11:45,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2024-01-31 16:11:45,183 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -18 predicate places. [2024-01-31 16:11:45,183 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 176 flow [2024-01-31 16:11:45,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:11:45,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:45,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:11:45,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:11:45,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:45,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 750918451, now seen corresponding path program 1 times [2024-01-31 16:11:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913943433] [2024-01-31 16:11:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:45,304 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:11:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913943433] [2024-01-31 16:11:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913943433] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:45,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:45,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66280724] [2024-01-31 16:11:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:45,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:45,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2024-01-31 16:11:45,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:11:45,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:45,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2024-01-31 16:11:45,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:45,480 INFO L124 PetriNetUnfolderBase]: 215/613 cut-off events. [2024-01-31 16:11:45,480 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:45,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 613 events. 215/613 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3712 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 977. Up to 362 conditions per place. [2024-01-31 16:11:45,483 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-31 16:11:45,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 278 flow [2024-01-31 16:11:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-01-31 16:11:45,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-01-31 16:11:45,485 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 176 flow. Second operand 3 states and 164 transitions. [2024-01-31 16:11:45,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 278 flow [2024-01-31 16:11:45,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:45,487 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 174 flow [2024-01-31 16:11:45,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2024-01-31 16:11:45,488 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -19 predicate places. [2024-01-31 16:11:45,488 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 174 flow [2024-01-31 16:11:45,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:11:45,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:45,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:45,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:11:45,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:45,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1803636328, now seen corresponding path program 1 times [2024-01-31 16:11:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933843815] [2024-01-31 16:11:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:45,552 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:11:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:45,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933843815] [2024-01-31 16:11:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933843815] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928336129] [2024-01-31 16:11:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:45,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:45,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 105 [2024-01-31 16:11:45,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:11:45,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:45,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 105 [2024-01-31 16:11:45,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:45,692 INFO L124 PetriNetUnfolderBase]: 215/612 cut-off events. [2024-01-31 16:11:45,692 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:45,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 612 events. 215/612 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3744 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 973. Up to 360 conditions per place. [2024-01-31 16:11:45,695 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 49 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-01-31 16:11:45,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 274 flow [2024-01-31 16:11:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2024-01-31 16:11:45,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-01-31 16:11:45,697 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 174 flow. Second operand 3 states and 166 transitions. [2024-01-31 16:11:45,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 274 flow [2024-01-31 16:11:45,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:45,699 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 172 flow [2024-01-31 16:11:45,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-01-31 16:11:45,700 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -20 predicate places. [2024-01-31 16:11:45,700 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 172 flow [2024-01-31 16:11:45,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:11:45,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:45,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:11:45,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:45,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 78152067, now seen corresponding path program 1 times [2024-01-31 16:11:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091978756] [2024-01-31 16:11:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:45,753 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:11:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:45,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091978756] [2024-01-31 16:11:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091978756] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:45,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723182025] [2024-01-31 16:11:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:45,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 105 [2024-01-31 16:11:45,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:11:45,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:45,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 105 [2024-01-31 16:11:45,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:45,918 INFO L124 PetriNetUnfolderBase]: 215/611 cut-off events. [2024-01-31 16:11:45,918 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 611 events. 215/611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3772 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 969. Up to 358 conditions per place. [2024-01-31 16:11:45,921 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 48 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-01-31 16:11:45,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 270 flow [2024-01-31 16:11:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-01-31 16:11:45,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-01-31 16:11:45,923 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 172 flow. Second operand 3 states and 168 transitions. [2024-01-31 16:11:45,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 270 flow [2024-01-31 16:11:45,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:45,925 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 170 flow [2024-01-31 16:11:45,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-01-31 16:11:45,925 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -21 predicate places. [2024-01-31 16:11:45,925 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 170 flow [2024-01-31 16:11:45,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:11:45,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:45,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:45,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:11:45,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:45,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1872252403, now seen corresponding path program 1 times [2024-01-31 16:11:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590360531] [2024-01-31 16:11:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:45,971 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:11:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590360531] [2024-01-31 16:11:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590360531] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898090085] [2024-01-31 16:11:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:45,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:45,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:46,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 105 [2024-01-31 16:11:46,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:11:46,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:46,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 105 [2024-01-31 16:11:46,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:46,102 INFO L124 PetriNetUnfolderBase]: 215/608 cut-off events. [2024-01-31 16:11:46,102 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-31 16:11:46,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 608 events. 215/608 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3759 event pairs, 131 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 961. Up to 348 conditions per place. [2024-01-31 16:11:46,105 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 45 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-01-31 16:11:46,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 258 flow [2024-01-31 16:11:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-01-31 16:11:46,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-01-31 16:11:46,106 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 170 flow. Second operand 3 states and 170 transitions. [2024-01-31 16:11:46,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 258 flow [2024-01-31 16:11:46,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:46,108 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 164 flow [2024-01-31 16:11:46,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2024-01-31 16:11:46,109 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -24 predicate places. [2024-01-31 16:11:46,109 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 164 flow [2024-01-31 16:11:46,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:11:46,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:46,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:46,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:11:46,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 72 more)] === [2024-01-31 16:11:46,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1825289960, now seen corresponding path program 1 times [2024-01-31 16:11:46,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:46,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599076429] [2024-01-31 16:11:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:11:46,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:11:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:11:46,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:11:46,165 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:11:46,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 75 remaining) [2024-01-31 16:11:46,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 75 remaining) [2024-01-31 16:11:46,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 75 remaining) [2024-01-31 16:11:46,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 75 remaining) [2024-01-31 16:11:46,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 75 remaining) [2024-01-31 16:11:46,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 75 remaining) [2024-01-31 16:11:46,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (28 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 75 remaining) [2024-01-31 16:11:46,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 75 remaining) [2024-01-31 16:11:46,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 75 remaining) [2024-01-31 16:11:46,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 75 remaining) [2024-01-31 16:11:46,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 75 remaining) [2024-01-31 16:11:46,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:11:46,178 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:46,184 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:11:46,184 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:11:46,207 INFO L503 ceAbstractionStarter]: Automizer considered 46 witness invariants [2024-01-31 16:11:46,207 INFO L504 ceAbstractionStarter]: WitnessConsidered=46 [2024-01-31 16:11:46,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:11:46 BasicIcfg [2024-01-31 16:11:46,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:11:46,209 INFO L158 Benchmark]: Toolchain (without parser) took 4737.44ms. Allocated memory was 144.7MB in the beginning and 249.6MB in the end (delta: 104.9MB). Free memory was 95.8MB in the beginning and 104.8MB in the end (delta: -9.0MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,209 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 113.0MB in the beginning and 112.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:11:46,209 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:11:46,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.18ms. Allocated memory is still 144.7MB. Free memory was 95.5MB in the beginning and 73.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.56ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,212 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 144.7MB. Free memory was 70.3MB in the beginning and 67.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,212 INFO L158 Benchmark]: RCFGBuilder took 1056.58ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 67.1MB in the beginning and 138.3MB in the end (delta: -71.2MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,212 INFO L158 Benchmark]: TraceAbstraction took 3057.03ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 138.3MB in the beginning and 104.8MB in the end (delta: 33.5MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2024-01-31 16:11:46,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 113.0MB in the beginning and 112.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.18ms. Allocated memory is still 144.7MB. Free memory was 95.5MB in the beginning and 73.4MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.56ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 70.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 144.7MB. Free memory was 70.3MB in the beginning and 67.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1056.58ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 67.1MB in the beginning and 138.3MB in the end (delta: -71.2MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3057.03ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 138.3MB in the beginning and 104.8MB in the end (delta: 33.5MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 112]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *q1, *q2; [L42] int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N; [L83] pthread_t t1, t2; VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={3:0}, t2={5:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L89] q1_back = q1_front VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={3:0}, t2={5:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L91] q2_back = q2_front VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={3:0}, t2={5:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L108] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L108] RET assume_abort_if_not(size >= 0) [L109] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L109] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L111] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICOR,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[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]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[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[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]]] VAL [N=0, \old(size)=0, arr={-2:0}, i=-1, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0] - 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: 61]: 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: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: 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: 57]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: 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: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: 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: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 108]: 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: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: 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: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 102]: 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: 96]: 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, 148 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 89 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:11:46,242 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