./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 ab2e0ac4 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-dev-ab2e0ac-m [2024-01-29 14:20:22,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:20:22,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:20:22,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:20:22,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:20:22,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:20:22,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:20:22,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:20:22,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:20:22,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:20:22,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:20:22,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:20:22,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:20:22,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:20:22,914 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:20:22,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:20:22,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:20:22,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:20:22,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:20:22,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:20:22,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:20:22,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:20:22,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:20:22,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:20:22,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:20:22,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:20:22,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:20:22,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:20:22,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:20:22,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:20:22,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:20:22,919 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-29 14:20:23,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:20:23,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:20:23,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:20:23,164 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:20:23,164 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:20:23,165 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-29 14:20:23,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:20:23,318 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:20:23,318 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-29 14:20:24,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:20:24,508 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:20:24,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-29 14:20:24,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a3fef9c/89402d0a366a466a9e2caf78b0baa839/FLAGcbb77c6c7 [2024-01-29 14:20:24,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a3fef9c/89402d0a366a466a9e2caf78b0baa839 [2024-01-29 14:20:24,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:20:24,529 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:20:24,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:20:24,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:20:24,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:20:24,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:23" (1/2) ... [2024-01-29 14:20:24,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8bc09b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:20:24, skipping insertion in model container [2024-01-29 14:20:24,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:23" (1/2) ... [2024-01-29 14:20:24,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e9280e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:20:24, skipping insertion in model container [2024-01-29 14:20:24,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:20:24" (2/2) ... [2024-01-29 14:20:24,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8bc09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24, skipping insertion in model container [2024-01-29 14:20:24,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:20:24" (2/2) ... [2024-01-29 14:20:24,538 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:20:24,562 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:20:24,562 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] -2147483647 <= q1_front [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j == 0 [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] q2 == 0 [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,563 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] -2147483647 <= q2_back [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] q2_front <= 2147483646 [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2 == 0 [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_back == 0 [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-29 14:20:24,564 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_front == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1_back == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1 == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] j == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q2 == 0 [2024-01-29 14:20:24,565 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q1 == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] i == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] q2 == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] j == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= q1_back [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] j == 0 [2024-01-29 14:20:24,566 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] ((((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-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] q2 == 0 [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] i == 0 [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] q2 == 0 [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] j == 0 [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] i == 0 [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] -2147483647 <= q2_front [2024-01-29 14:20:24,567 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2 == 0 [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q1 == 0 [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] j == 0 [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2_back == 0 [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-29 14:20:24,568 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_front == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_front == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_back == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_back == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2 == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n2 == 0 [2024-01-29 14:20:24,569 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1 == 0 [2024-01-29 14:20:24,570 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-29 14:20:24,570 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n1 == 0 [2024-01-29 14:20:24,570 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-29 14:20:24,570 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-29 14:20:24,571 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q1 == 0 [2024-01-29 14:20:24,571 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_front == 0 [2024-01-29 14:20:24,571 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2 == 0 [2024-01-29 14:20:24,571 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_back == 0 [2024-01-29 14:20:24,572 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-29 14:20:24,572 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L77] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,572 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,572 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,572 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] j == 0 [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] -2147483647 <= q1_back [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] j == 0 [2024-01-29 14:20:24,573 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] q2 == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] j == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] i == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (long long )i - (long long )size >= 0LL [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] q2 == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] 0 <= i [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_front == 0 [2024-01-29 14:20:24,574 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n2 == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_front == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2 == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_back == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1 == 0 [2024-01-29 14:20:24,575 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_back == 0 [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n1 == 0 [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] j == 0 [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] i == 0 [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] q2 == 0 [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,576 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= q1_back [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] q1_front <= 2147483646 [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] 0 <= q2_back [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] size != 0 [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 14:20:24,577 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-29 14:20:24,578 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] j == 0 [2024-01-29 14:20:24,578 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (((((((((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-29 14:20:24,578 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] q2 == 0 [2024-01-29 14:20:24,578 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] n2 == 0 [2024-01-29 14:20:24,578 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_front == 0 [2024-01-29 14:20:24,579 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_back == 0 [2024-01-29 14:20:24,579 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1 == 0 [2024-01-29 14:20:24,580 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-29 14:20:24,580 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2 == 0 [2024-01-29 14:20:24,581 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_back == 0 [2024-01-29 14:20:24,581 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_front == 0 [2024-01-29 14:20:24,581 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-29 14:20:24,582 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,582 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,582 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_front == 0 [2024-01-29 14:20:24,582 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_back == 0 [2024-01-29 14:20:24,582 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_front == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2 == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1 == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_back == 0 [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,583 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] -2147483647 <= q2_back [2024-01-29 14:20:24,584 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,584 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,584 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:20:24,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:20:24,735 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-29 14:20:24,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:20:24,756 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:20:24,771 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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 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 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-29 14:20:24,850 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 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-29 14:20:24,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:20:24,888 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:20:24,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24 WrapperNode [2024-01-29 14:20:24,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:20:24,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:20:24,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:20:24,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:20:24,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,952 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 369 [2024-01-29 14:20:24,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:20:24,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:20:24,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:20:24,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:20:24,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,979 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 6, 2]. 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, 2, 1]. [2024-01-29 14:20:24,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:24,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:25,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:20:25,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:20:25,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:20:25,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:20:25,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (1/1) ... [2024-01-29 14:20:25,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:20:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:20:25,039 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-29 14:20:25,058 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-29 14:20:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:20:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:20:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:20:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:20:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 14:20:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:20:25,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:20:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:20:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:20:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:20:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:20:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:20:25,083 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:20:25,161 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:20:25,162 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:20:25,980 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:20:25,980 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:20:26,142 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:20:26,142 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 14:20:26,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:20:26 BoogieIcfgContainer [2024-01-29 14:20:26,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:20:26,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:20:26,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:20:26,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:20:26,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:23" (1/4) ... [2024-01-29 14:20:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c15b98 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:20:26, skipping insertion in model container [2024-01-29 14:20:26,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:20:24" (2/4) ... [2024-01-29 14:20:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c15b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:20:26, skipping insertion in model container [2024-01-29 14:20:26,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:24" (3/4) ... [2024-01-29 14:20:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c15b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:20:26, skipping insertion in model container [2024-01-29 14:20:26,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:20:26" (4/4) ... [2024-01-29 14:20:26,148 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-29 14:20:26,161 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:20:26,161 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 160 error locations. [2024-01-29 14:20:26,161 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:20:26,246 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:20:26,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 319 transitions, 652 flow [2024-01-29 14:20:26,323 INFO L124 PetriNetUnfolderBase]: 4/317 cut-off events. [2024-01-29 14:20:26,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:20:26,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 317 events. 4/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 562 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 281. Up to 2 conditions per place. [2024-01-29 14:20:26,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 319 transitions, 652 flow [2024-01-29 14:20:26,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 316 transitions, 644 flow [2024-01-29 14:20:26,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:20:26,345 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;@278521c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:20:26,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 200 error locations. [2024-01-29 14:20:26,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:20:26,347 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:20:26,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:20:26,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:26,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:20:26,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:26,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 38836, now seen corresponding path program 1 times [2024-01-29 14:20:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883625862] [2024-01-29 14:20:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:26,494 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-29 14:20:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883625862] [2024-01-29 14:20:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883625862] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:26,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560745286] [2024-01-29 14:20:26,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:26,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 319 [2024-01-29 14:20:26,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-29 14:20:26,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:26,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 319 [2024-01-29 14:20:26,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:26,874 INFO L124 PetriNetUnfolderBase]: 524/1346 cut-off events. [2024-01-29 14:20:26,874 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-29 14:20:26,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 1346 events. 524/1346 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8003 event pairs, 360 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1806. Up to 822 conditions per place. [2024-01-29 14:20:26,885 INFO L140 encePairwiseOnDemand]: 299/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-01-29 14:20:26,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 714 flow [2024-01-29 14:20:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2024-01-29 14:20:26,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2024-01-29 14:20:26,901 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 644 flow. Second operand 3 states and 812 transitions. [2024-01-29 14:20:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 714 flow [2024-01-29 14:20:26,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 298 transitions, 706 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:20:26,912 INFO L231 Difference]: Finished difference. Result has 299 places, 298 transitions, 604 flow [2024-01-29 14:20:26,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=299, PETRI_TRANSITIONS=298} [2024-01-29 14:20:26,917 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -20 predicate places. [2024-01-29 14:20:26,917 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 298 transitions, 604 flow [2024-01-29 14:20:26,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-29 14:20:26,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:26,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:20:26,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:20:26,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:26,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1204979, now seen corresponding path program 1 times [2024-01-29 14:20:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:26,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044738482] [2024-01-29 14:20:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:26,968 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-29 14:20:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044738482] [2024-01-29 14:20:26,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044738482] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:26,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:26,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200787108] [2024-01-29 14:20:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:27,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 319 [2024-01-29 14:20:27,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 298 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-29 14:20:27,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:27,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 319 [2024-01-29 14:20:27,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:27,252 INFO L124 PetriNetUnfolderBase]: 524/1339 cut-off events. [2024-01-29 14:20:27,252 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:20:27,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 1339 events. 524/1339 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8063 event pairs, 360 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 2137. Up to 817 conditions per place. [2024-01-29 14:20:27,257 INFO L140 encePairwiseOnDemand]: 310/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-01-29 14:20:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 291 transitions, 706 flow [2024-01-29 14:20:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2024-01-29 14:20:27,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8108672936259144 [2024-01-29 14:20:27,260 INFO L175 Difference]: Start difference. First operand has 299 places, 298 transitions, 604 flow. Second operand 3 states and 776 transitions. [2024-01-29 14:20:27,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 291 transitions, 706 flow [2024-01-29 14:20:27,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 291 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:27,268 INFO L231 Difference]: Finished difference. Result has 292 places, 291 transitions, 590 flow [2024-01-29 14:20:27,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=292, PETRI_TRANSITIONS=291} [2024-01-29 14:20:27,273 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -27 predicate places. [2024-01-29 14:20:27,273 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 291 transitions, 590 flow [2024-01-29 14:20:27,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-29 14:20:27,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:27,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:20:27,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:20:27,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:27,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 37355424, now seen corresponding path program 1 times [2024-01-29 14:20:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:27,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018680892] [2024-01-29 14:20:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:27,350 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-29 14:20:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018680892] [2024-01-29 14:20:27,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018680892] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:27,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:27,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:27,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982575736] [2024-01-29 14:20:27,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:27,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:27,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 319 [2024-01-29 14:20:27,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-29 14:20:27,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:27,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 319 [2024-01-29 14:20:27,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:27,582 INFO L124 PetriNetUnfolderBase]: 524/1331 cut-off events. [2024-01-29 14:20:27,583 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:20:27,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1331 events. 524/1331 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8084 event pairs, 360 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 2062. Up to 810 conditions per place. [2024-01-29 14:20:27,588 INFO L140 encePairwiseOnDemand]: 309/319 looper letters, 57 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-01-29 14:20:27,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 283 transitions, 692 flow [2024-01-29 14:20:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-01-29 14:20:27,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8066875653082549 [2024-01-29 14:20:27,589 INFO L175 Difference]: Start difference. First operand has 292 places, 291 transitions, 590 flow. Second operand 3 states and 772 transitions. [2024-01-29 14:20:27,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 283 transitions, 692 flow [2024-01-29 14:20:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 283 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:27,593 INFO L231 Difference]: Finished difference. Result has 284 places, 283 transitions, 574 flow [2024-01-29 14:20:27,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=284, PETRI_TRANSITIONS=283} [2024-01-29 14:20:27,594 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -35 predicate places. [2024-01-29 14:20:27,595 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 283 transitions, 574 flow [2024-01-29 14:20:27,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-29 14:20:27,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:27,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:20:27,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:20:27,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:27,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1158019324, now seen corresponding path program 1 times [2024-01-29 14:20:27,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:27,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625116458] [2024-01-29 14:20:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:27,632 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-29 14:20:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625116458] [2024-01-29 14:20:27,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625116458] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:27,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:27,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269902697] [2024-01-29 14:20:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:27,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:27,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 319 [2024-01-29 14:20:27,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 283 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-29 14:20:27,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:27,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 319 [2024-01-29 14:20:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:27,821 INFO L124 PetriNetUnfolderBase]: 524/1326 cut-off events. [2024-01-29 14:20:27,822 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:20:27,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 1326 events. 524/1326 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8043 event pairs, 360 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1989. Up to 819 conditions per place. [2024-01-29 14:20:27,826 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 54 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-01-29 14:20:27,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 676 flow [2024-01-29 14:20:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-01-29 14:20:27,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.819226750261233 [2024-01-29 14:20:27,828 INFO L175 Difference]: Start difference. First operand has 284 places, 283 transitions, 574 flow. Second operand 3 states and 784 transitions. [2024-01-29 14:20:27,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 676 flow [2024-01-29 14:20:27,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 278 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:27,831 INFO L231 Difference]: Finished difference. Result has 279 places, 278 transitions, 564 flow [2024-01-29 14:20:27,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=279, PETRI_TRANSITIONS=278} [2024-01-29 14:20:27,832 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -40 predicate places. [2024-01-29 14:20:27,832 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 278 transitions, 564 flow [2024-01-29 14:20:27,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-29 14:20:27,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:27,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:20:27,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:20:27,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:27,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1538861994, now seen corresponding path program 1 times [2024-01-29 14:20:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839663340] [2024-01-29 14:20:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:27,856 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-29 14:20:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839663340] [2024-01-29 14:20:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839663340] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382025890] [2024-01-29 14:20:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:27,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:27,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:27,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 319 [2024-01-29 14:20:27,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-29 14:20:27,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:27,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 319 [2024-01-29 14:20:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:28,046 INFO L124 PetriNetUnfolderBase]: 524/1303 cut-off events. [2024-01-29 14:20:28,046 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:20:28,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 1303 events. 524/1303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7924 event pairs, 360 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 2078. Up to 803 conditions per place. [2024-01-29 14:20:28,051 INFO L140 encePairwiseOnDemand]: 294/319 looper letters, 68 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-01-29 14:20:28,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 255 transitions, 658 flow [2024-01-29 14:20:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-01-29 14:20:28,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523510971786834 [2024-01-29 14:20:28,053 INFO L175 Difference]: Start difference. First operand has 279 places, 278 transitions, 564 flow. Second operand 3 states and 720 transitions. [2024-01-29 14:20:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 255 transitions, 658 flow [2024-01-29 14:20:28,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 255 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:28,057 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 518 flow [2024-01-29 14:20:28,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2024-01-29 14:20:28,057 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -63 predicate places. [2024-01-29 14:20:28,058 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 518 flow [2024-01-29 14:20:28,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-29 14:20:28,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:28,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:28,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:20:28,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:28,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 460082809, now seen corresponding path program 1 times [2024-01-29 14:20:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943026137] [2024-01-29 14:20:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:28,075 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-29 14:20:28,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943026137] [2024-01-29 14:20:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943026137] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983257113] [2024-01-29 14:20:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:28,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:28,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 319 [2024-01-29 14:20:28,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-29 14:20:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 319 [2024-01-29 14:20:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:28,308 INFO L124 PetriNetUnfolderBase]: 807/1870 cut-off events. [2024-01-29 14:20:28,308 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-29 14:20:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 1870 events. 807/1870 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12798 event pairs, 294 based on Foata normal form. 1/1128 useless extension candidates. Maximal degree in co-relation 2995. Up to 677 conditions per place. [2024-01-29 14:20:28,316 INFO L140 encePairwiseOnDemand]: 293/319 looper letters, 90 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-01-29 14:20:28,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 255 transitions, 704 flow [2024-01-29 14:20:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-01-29 14:20:28,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7795193312434692 [2024-01-29 14:20:28,318 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 518 flow. Second operand 3 states and 746 transitions. [2024-01-29 14:20:28,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 255 transitions, 704 flow [2024-01-29 14:20:28,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 255 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:28,321 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 476 flow [2024-01-29 14:20:28,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2024-01-29 14:20:28,322 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -86 predicate places. [2024-01-29 14:20:28,322 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 476 flow [2024-01-29 14:20:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-29 14:20:28,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:28,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:28,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:20:28,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:28,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1377666349, now seen corresponding path program 1 times [2024-01-29 14:20:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067367386] [2024-01-29 14:20:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:28,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:28,338 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-29 14:20:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067367386] [2024-01-29 14:20:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067367386] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:28,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150712725] [2024-01-29 14:20:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:28,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 319 [2024-01-29 14:20:28,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-29 14:20:28,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:28,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 319 [2024-01-29 14:20:28,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:28,523 INFO L124 PetriNetUnfolderBase]: 807/1864 cut-off events. [2024-01-29 14:20:28,523 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-01-29 14:20:28,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1864 events. 807/1864 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12873 event pairs, 624 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 1620. Up to 1309 conditions per place. [2024-01-29 14:20:28,529 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-01-29 14:20:28,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 231 transitions, 580 flow [2024-01-29 14:20:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-01-29 14:20:28,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8359456635318704 [2024-01-29 14:20:28,531 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 476 flow. Second operand 3 states and 800 transitions. [2024-01-29 14:20:28,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 231 transitions, 580 flow [2024-01-29 14:20:28,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:20:28,534 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 476 flow [2024-01-29 14:20:28,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2024-01-29 14:20:28,534 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -86 predicate places. [2024-01-29 14:20:28,535 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 476 flow [2024-01-29 14:20:28,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-29 14:20:28,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:28,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:28,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:20:28,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:28,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash -242015110, now seen corresponding path program 1 times [2024-01-29 14:20:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343072840] [2024-01-29 14:20:28,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:28,550 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-29 14:20:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343072840] [2024-01-29 14:20:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343072840] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057828272] [2024-01-29 14:20:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:28,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:28,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 319 [2024-01-29 14:20:28,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-29 14:20:28,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:28,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 319 [2024-01-29 14:20:28,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:28,859 INFO L124 PetriNetUnfolderBase]: 1200/2812 cut-off events. [2024-01-29 14:20:28,860 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-01-29 14:20:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 2812 events. 1200/2812 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22110 event pairs, 510 based on Foata normal form. 2/1800 useless extension candidates. Maximal degree in co-relation 4978. Up to 1111 conditions per place. [2024-01-29 14:20:28,871 INFO L140 encePairwiseOnDemand]: 297/319 looper letters, 92 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 14:20:28,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 238 transitions, 685 flow [2024-01-29 14:20:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2024-01-29 14:20:28,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7941483803552769 [2024-01-29 14:20:28,873 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 476 flow. Second operand 3 states and 760 transitions. [2024-01-29 14:20:28,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 238 transitions, 685 flow [2024-01-29 14:20:28,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 238 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:28,876 INFO L231 Difference]: Finished difference. Result has 214 places, 212 transitions, 442 flow [2024-01-29 14:20:28,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=214, PETRI_TRANSITIONS=212} [2024-01-29 14:20:28,877 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -105 predicate places. [2024-01-29 14:20:28,877 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 212 transitions, 442 flow [2024-01-29 14:20:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-29 14:20:28,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:28,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:28,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:20:28,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:28,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1087467410, now seen corresponding path program 1 times [2024-01-29 14:20:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921065599] [2024-01-29 14:20:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:28,893 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-29 14:20:28,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:28,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921065599] [2024-01-29 14:20:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921065599] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505220426] [2024-01-29 14:20:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:28,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:28,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:28,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 319 [2024-01-29 14:20:28,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-29 14:20:28,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:28,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 319 [2024-01-29 14:20:28,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:29,169 INFO L124 PetriNetUnfolderBase]: 1200/2809 cut-off events. [2024-01-29 14:20:29,169 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-01-29 14:20:29,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5111 conditions, 2809 events. 1200/2809 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22029 event pairs, 1116 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 2599. Up to 2060 conditions per place. [2024-01-29 14:20:29,178 INFO L140 encePairwiseOnDemand]: 311/319 looper letters, 57 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-01-29 14:20:29,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 548 flow [2024-01-29 14:20:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-01-29 14:20:29,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8150470219435737 [2024-01-29 14:20:29,180 INFO L175 Difference]: Start difference. First operand has 214 places, 212 transitions, 442 flow. Second operand 3 states and 780 transitions. [2024-01-29 14:20:29,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 548 flow [2024-01-29 14:20:29,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 206 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:20:29,183 INFO L231 Difference]: Finished difference. Result has 209 places, 206 transitions, 432 flow [2024-01-29 14:20:29,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=209, PETRI_TRANSITIONS=206} [2024-01-29 14:20:29,183 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -110 predicate places. [2024-01-29 14:20:29,183 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 206 transitions, 432 flow [2024-01-29 14:20:29,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-29 14:20:29,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:29,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:20:29,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:29,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -648247593, now seen corresponding path program 1 times [2024-01-29 14:20:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573148349] [2024-01-29 14:20:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:29,214 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-29 14:20:29,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:29,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573148349] [2024-01-29 14:20:29,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573148349] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:29,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:29,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835667621] [2024-01-29 14:20:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:29,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 319 [2024-01-29 14:20:29,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 206 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-29 14:20:29,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:29,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 319 [2024-01-29 14:20:29,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:29,502 INFO L124 PetriNetUnfolderBase]: 1200/2806 cut-off events. [2024-01-29 14:20:29,503 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-29 14:20:29,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5066 conditions, 2806 events. 1200/2806 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22045 event pairs, 1116 based on Foata normal form. 0/1856 useless extension candidates. Maximal degree in co-relation 4992. Up to 2063 conditions per place. [2024-01-29 14:20:29,513 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 53 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-01-29 14:20:29,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 203 transitions, 536 flow [2024-01-29 14:20:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2024-01-29 14:20:29,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8296760710553814 [2024-01-29 14:20:29,514 INFO L175 Difference]: Start difference. First operand has 209 places, 206 transitions, 432 flow. Second operand 3 states and 794 transitions. [2024-01-29 14:20:29,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 203 transitions, 536 flow [2024-01-29 14:20:29,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:29,555 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 426 flow [2024-01-29 14:20:29,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2024-01-29 14:20:29,556 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -113 predicate places. [2024-01-29 14:20:29,556 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 426 flow [2024-01-29 14:20:29,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-29 14:20:29,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:29,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:20:29,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:29,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1379162192, now seen corresponding path program 1 times [2024-01-29 14:20:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908732233] [2024-01-29 14:20:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:29,586 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-29 14:20:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908732233] [2024-01-29 14:20:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908732233] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145187241] [2024-01-29 14:20:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:29,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:29,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 319 [2024-01-29 14:20:29,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-29 14:20:29,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:29,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 319 [2024-01-29 14:20:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:29,825 INFO L124 PetriNetUnfolderBase]: 1200/2802 cut-off events. [2024-01-29 14:20:29,825 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-01-29 14:20:29,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 2802 events. 1200/2802 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22042 event pairs, 1116 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 5016. Up to 2062 conditions per place. [2024-01-29 14:20:29,835 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-01-29 14:20:29,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 199 transitions, 526 flow [2024-01-29 14:20:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2024-01-29 14:20:29,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8296760710553814 [2024-01-29 14:20:29,838 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 426 flow. Second operand 3 states and 794 transitions. [2024-01-29 14:20:29,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 199 transitions, 526 flow [2024-01-29 14:20:29,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:29,841 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 418 flow [2024-01-29 14:20:29,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-01-29 14:20:29,841 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -117 predicate places. [2024-01-29 14:20:29,842 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 418 flow [2024-01-29 14:20:29,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-29 14:20:29,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:29,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:20:29,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:29,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 63432653, now seen corresponding path program 1 times [2024-01-29 14:20:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714695616] [2024-01-29 14:20:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:29,880 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-29 14:20:29,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:29,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714695616] [2024-01-29 14:20:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714695616] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:20:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391876407] [2024-01-29 14:20:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:29,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:29,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 319 [2024-01-29 14:20:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-29 14:20:29,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:29,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 319 [2024-01-29 14:20:29,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,198 INFO L124 PetriNetUnfolderBase]: 1200/2796 cut-off events. [2024-01-29 14:20:30,199 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-29 14:20:30,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 2796 events. 1200/2796 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21992 event pairs, 1116 based on Foata normal form. 2/1857 useless extension candidates. Maximal degree in co-relation 5011. Up to 2068 conditions per place. [2024-01-29 14:20:30,208 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 55 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2024-01-29 14:20:30,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 193 transitions, 532 flow [2024-01-29 14:20:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-01-29 14:20:30,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8066875653082549 [2024-01-29 14:20:30,210 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 418 flow. Second operand 3 states and 772 transitions. [2024-01-29 14:20:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 193 transitions, 532 flow [2024-01-29 14:20:30,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 193 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,213 INFO L231 Difference]: Finished difference. Result has 196 places, 193 transitions, 418 flow [2024-01-29 14:20:30,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=196, PETRI_TRANSITIONS=193} [2024-01-29 14:20:30,214 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -123 predicate places. [2024-01-29 14:20:30,214 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 193 transitions, 418 flow [2024-01-29 14:20:30,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-29 14:20:30,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:20:30,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:30,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 291420011, now seen corresponding path program 1 times [2024-01-29 14:20:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102423423] [2024-01-29 14:20:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,282 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-29 14:20:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102423423] [2024-01-29 14:20:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102423423] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:20:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866108951] [2024-01-29 14:20:30,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:20:30,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:20:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:20:30,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 319 [2024-01-29 14:20:30,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 193 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 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-29 14:20:30,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 319 [2024-01-29 14:20:30,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,623 INFO L124 PetriNetUnfolderBase]: 1200/2790 cut-off events. [2024-01-29 14:20:30,623 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-01-29 14:20:30,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 2790 events. 1200/2790 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22023 event pairs, 1116 based on Foata normal form. 2/1857 useless extension candidates. Maximal degree in co-relation 4894. Up to 2068 conditions per place. [2024-01-29 14:20:30,634 INFO L140 encePairwiseOnDemand]: 303/319 looper letters, 59 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2024-01-29 14:20:30,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 544 flow [2024-01-29 14:20:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:20:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:20:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 965 transitions. [2024-01-29 14:20:30,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562695924764891 [2024-01-29 14:20:30,637 INFO L175 Difference]: Start difference. First operand has 196 places, 193 transitions, 418 flow. Second operand 4 states and 965 transitions. [2024-01-29 14:20:30,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 544 flow [2024-01-29 14:20:30,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 187 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,640 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 410 flow [2024-01-29 14:20:30,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=410, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2024-01-29 14:20:30,640 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -128 predicate places. [2024-01-29 14:20:30,641 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 410 flow [2024-01-29 14:20:30,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 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-29 14:20:30,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:20:30,642 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:30,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 443887432, now seen corresponding path program 1 times [2024-01-29 14:20:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767252566] [2024-01-29 14:20:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,732 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-29 14:20:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767252566] [2024-01-29 14:20:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767252566] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:20:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994306066] [2024-01-29 14:20:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:20:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:20:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:20:30,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 319 [2024-01-29 14:20:30,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 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-29 14:20:30,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 319 [2024-01-29 14:20:30,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:31,138 INFO L124 PetriNetUnfolderBase]: 1200/2785 cut-off events. [2024-01-29 14:20:31,138 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-01-29 14:20:31,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5084 conditions, 2785 events. 1200/2785 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21991 event pairs, 510 based on Foata normal form. 0/1873 useless extension candidates. Maximal degree in co-relation 4892. Up to 1111 conditions per place. [2024-01-29 14:20:31,149 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 100 selfloop transitions, 12 changer transitions 0/211 dead transitions. [2024-01-29 14:20:31,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 211 transitions, 689 flow [2024-01-29 14:20:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:20:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:20:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1032 transitions. [2024-01-29 14:20:31,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6470219435736677 [2024-01-29 14:20:31,151 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 410 flow. Second operand 5 states and 1032 transitions. [2024-01-29 14:20:31,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 211 transitions, 689 flow [2024-01-29 14:20:31,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 211 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:20:31,155 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 410 flow [2024-01-29 14:20:31,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2024-01-29 14:20:31,155 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -129 predicate places. [2024-01-29 14:20:31,156 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 410 flow [2024-01-29 14:20:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 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-29 14:20:31,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:31,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:31,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:20:31,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:31,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1737671043, now seen corresponding path program 1 times [2024-01-29 14:20:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335949312] [2024-01-29 14:20:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:31,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:31,280 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-29 14:20:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335949312] [2024-01-29 14:20:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335949312] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:20:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197647685] [2024-01-29 14:20:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:31,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:20:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:31,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:20:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:20:31,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 319 [2024-01-29 14:20:31,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 234.4) internal successors, (1172), 5 states have internal predecessors, (1172), 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-29 14:20:31,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:31,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 319 [2024-01-29 14:20:31,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:31,622 INFO L124 PetriNetUnfolderBase]: 1198/2784 cut-off events. [2024-01-29 14:20:31,623 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2024-01-29 14:20:31,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5097 conditions, 2784 events. 1198/2784 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21936 event pairs, 1116 based on Foata normal form. 4/1855 useless extension candidates. Maximal degree in co-relation 2599. Up to 2056 conditions per place. [2024-01-29 14:20:31,632 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 51 selfloop transitions, 10 changer transitions 0/181 dead transitions. [2024-01-29 14:20:31,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 181 transitions, 520 flow [2024-01-29 14:20:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:20:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:20:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1218 transitions. [2024-01-29 14:20:31,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2024-01-29 14:20:31,634 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 410 flow. Second operand 5 states and 1218 transitions. [2024-01-29 14:20:31,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 181 transitions, 520 flow [2024-01-29 14:20:31,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 181 transitions, 506 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:20:31,637 INFO L231 Difference]: Finished difference. Result has 188 places, 181 transitions, 404 flow [2024-01-29 14:20:31,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=188, PETRI_TRANSITIONS=181} [2024-01-29 14:20:31,638 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -131 predicate places. [2024-01-29 14:20:31,638 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 404 flow [2024-01-29 14:20:31,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 234.4) internal successors, (1172), 5 states have internal predecessors, (1172), 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-29 14:20:31,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:31,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:31,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:20:31,639 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 14:20:31,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -840370441, now seen corresponding path program 1 times [2024-01-29 14:20:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266945654] [2024-01-29 14:20:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:20:31,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:20:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:20:31,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:20:31,684 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:20:31,685 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 200 remaining) [2024-01-29 14:20:31,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 200 remaining) [2024-01-29 14:20:31,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 200 remaining) [2024-01-29 14:20:31,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 200 remaining) [2024-01-29 14:20:31,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 200 remaining) [2024-01-29 14:20:31,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 200 remaining) [2024-01-29 14:20:31,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 200 remaining) [2024-01-29 14:20:31,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 200 remaining) [2024-01-29 14:20:31,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 200 remaining) [2024-01-29 14:20:31,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 200 remaining) [2024-01-29 14:20:31,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 200 remaining) [2024-01-29 14:20:31,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 200 remaining) [2024-01-29 14:20:31,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 200 remaining) [2024-01-29 14:20:31,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 200 remaining) [2024-01-29 14:20:31,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 200 remaining) [2024-01-29 14:20:31,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 200 remaining) [2024-01-29 14:20:31,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 200 remaining) [2024-01-29 14:20:31,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 200 remaining) [2024-01-29 14:20:31,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 200 remaining) [2024-01-29 14:20:31,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 200 remaining) [2024-01-29 14:20:31,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION (40 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 200 remaining) [2024-01-29 14:20:31,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 200 remaining) [2024-01-29 14:20:31,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 200 remaining) [2024-01-29 14:20:31,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 200 remaining) [2024-01-29 14:20:31,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 200 remaining) [2024-01-29 14:20:31,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 200 remaining) [2024-01-29 14:20:31,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 200 remaining) [2024-01-29 14:20:31,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 200 remaining) [2024-01-29 14:20:31,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:20:31,709 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:31,715 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:20:31,715 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:20:31,774 INFO L503 ceAbstractionStarter]: Automizer considered 159 witness invariants [2024-01-29 14:20:31,774 INFO L504 ceAbstractionStarter]: WitnessConsidered=159 [2024-01-29 14:20:31,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:20:31 BasicIcfg [2024-01-29 14:20:31,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:20:31,775 INFO L158 Benchmark]: Toolchain (without parser) took 7246.39ms. Allocated memory was 195.0MB in the beginning and 616.6MB in the end (delta: 421.5MB). Free memory was 153.6MB in the beginning and 268.8MB in the end (delta: -115.2MB). Peak memory consumption was 305.8MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,775 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 90.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:20:31,775 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:20:31,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.59ms. Allocated memory is still 195.0MB. Free memory was 153.2MB in the beginning and 127.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.42ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,776 INFO L158 Benchmark]: Boogie Preprocessor took 46.82ms. Allocated memory is still 195.0MB. Free memory was 124.3MB in the beginning and 120.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,776 INFO L158 Benchmark]: RCFGBuilder took 1141.42ms. Allocated memory is still 195.0MB. Free memory was 120.8MB in the beginning and 74.1MB in the end (delta: 46.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,777 INFO L158 Benchmark]: TraceAbstraction took 5631.17ms. Allocated memory was 195.0MB in the beginning and 616.6MB in the end (delta: 421.5MB). Free memory was 73.0MB in the beginning and 268.8MB in the end (delta: -195.8MB). Peak memory consumption was 226.8MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,777 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 90.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.59ms. Allocated memory is still 195.0MB. Free memory was 153.2MB in the beginning and 127.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.42ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.82ms. Allocated memory is still 195.0MB. Free memory was 124.3MB in the beginning and 120.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1141.42ms. Allocated memory is still 195.0MB. Free memory was 120.8MB in the beginning and 74.1MB in the end (delta: 46.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5631.17ms. Allocated memory was 195.0MB in the beginning and 616.6MB in the end (delta: 421.5MB). Free memory was 73.0MB in the beginning and 268.8MB in the end (delta: -195.8MB). Peak memory consumption was 226.8MB. 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L89] q1_back = q1_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L91] q2_back = q2_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],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[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],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] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] [L111] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L112] int i = 0; VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[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)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] COND TRUE i < size VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IntegerLiteral[9],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]] [L113] arr[i] = __VERIFIER_nondet_int() [L112] i++ VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[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)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] - 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: 48]: 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: 49]: 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: 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: 54]: 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: 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: 47]: 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: 66]: 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: 67]: 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: 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: 72]: 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: 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: 65]: 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: 85]: 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: 85]: 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: 85]: 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: 85]: 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: 85]: 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: 86]: 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: 86]: 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: 86]: 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: 86]: 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: 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: 87]: 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: 87]: 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: 87]: 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: 87]: 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: 88]: 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: 88]: 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: 88]: 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: 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: 89]: 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: 89]: 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: 89]: 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: 90]: 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: 90]: 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: 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: 91]: 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: 91]: 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: 92]: 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: 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: 108]: 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: 109]: 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: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: 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: 112]: 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: 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: 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: 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: 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: 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: 113]: 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: 112]: 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: 112]: 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: 112]: 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: 108]: 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: 109]: 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: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: 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: 112]: 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: 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: 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: 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: 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: 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: 113]: 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: 112]: 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: 112]: 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: 112]: 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, 378 locations, 200 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: 5.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1045 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2155 IncrementalHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 158 mSDtfsCounter, 2155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=0, InterpolantAutomatonStates: 50, 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.5s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-29 14:20:31,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE