./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-subst.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/chl-collitem-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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/chl-collitem-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-subst.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-59af5db-m [2024-02-02 09:19:14,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:19:14,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:19:14,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:19:14,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:19:14,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:19:14,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:19:14,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:19:14,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:19:14,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:19:14,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:19:14,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:19:14,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:19:14,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:19:14,249 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:19:14,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:19:14,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:19:14,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:19:14,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:19:14,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:19:14,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:19:14,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:19:14,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:19:14,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:19:14,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:19:14,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:19:14,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:19:14,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:19:14,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:19:14,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:19:14,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:19:14,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:19:14,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:14,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:19:14,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:19:14,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:19:14,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:19:14,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:19:14,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:19:14,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:19:14,255 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:19:14,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:19:14,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:19:14,255 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:19:14,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:19:14,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:19:14,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:19:14,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:19:14,441 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:19:14,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-02-02 09:19:15,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:19:15,624 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:19:15,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-02-02 09:19:15,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ca8385/3c532735d735456a83f845d80be09554/FLAGd84588712 [2024-02-02 09:19:15,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8ca8385/3c532735d735456a83f845d80be09554 [2024-02-02 09:19:15,643 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:19:15,643 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:19:15,643 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/chl-collitem-subst.wvr.yml/witness.yml [2024-02-02 09:19:15,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:19:15,759 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:19:15,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:15,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:19:15,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:19:15,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:15" (1/2) ... [2024-02-02 09:19:15,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779ccea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:15, skipping insertion in model container [2024-02-02 09:19:15,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:15" (1/2) ... [2024-02-02 09:19:15,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a22ebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:15, skipping insertion in model container [2024-02-02 09:19:15,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:15" (2/2) ... [2024-02-02 09:19:15,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779ccea1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:15, skipping insertion in model container [2024-02-02 09:19:15,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:15" (2/2) ... [2024-02-02 09:19:15,767 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:19:15,799 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:19:15,800 INFO L101 nessWitnessExtractor]: Location invariant before [L83-L83] (((((((((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,800 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,801 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] ((((cardId_10 == 0) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,801 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,801 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,801 INFO L101 nessWitnessExtractor]: Location invariant before [L80-L80] ((((((((((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] ((((((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] (((((((((((((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] ((((((((((((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] (((cardType_11 == 0) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,802 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (((((cardRarity_9 == 0) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L84-L84] ((((((((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L108-L108] (b <= -1) && (b != 0) [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] ((result_12 == 0) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L107-L107] (1 <= b) && (b != 0) [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,803 INFO L101 nessWitnessExtractor]: Location invariant before [L82-L82] ((((((((((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,804 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,804 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] (((cardType_11 == 0) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,804 INFO L101 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((cardType_7 == 0) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,804 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,804 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,805 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-02-02 09:19:15,805 INFO L101 nessWitnessExtractor]: Location invariant before [L81-L81] (((((((((((cardType_3 == 0) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-02-02 09:19:15,823 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:19:15,950 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/chl-collitem-subst.wvr.c[3583,3596] [2024-02-02 09:19:15,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:15,980 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:19:15,987 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 [2024-02-02 09:19:16,035 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/chl-collitem-subst.wvr.c[3583,3596] Start Parsing Local Start Parsing Local [2024-02-02 09:19:16,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:16,049 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:19:16,049 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16 WrapperNode [2024-02-02 09:19:16,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:16,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:16,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:19:16,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:19:16,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,095 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 416 [2024-02-02 09:19:16,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:16,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:19:16,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:19:16,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:19:16,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,131 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-02 09:19:16,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:19:16,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:19:16,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:19:16,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:19:16,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (1/1) ... [2024-02-02 09:19:16,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:19:16,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:19:16,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:19:16,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:19:16,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:19:16,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-02 09:19:16,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:19:16,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:19:16,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:19:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:19:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:19:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:19:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:19:16,234 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:19:16,329 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:19:16,331 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:19:16,865 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:19:16,865 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:19:17,618 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:19:17,619 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:19:17,620 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:17 BoogieIcfgContainer [2024-02-02 09:19:17,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:19:17,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:19:17,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:19:17,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:19:17,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:19:15" (1/4) ... [2024-02-02 09:19:17,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbae5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:19:17, skipping insertion in model container [2024-02-02 09:19:17,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:15" (2/4) ... [2024-02-02 09:19:17,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbae5b8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:17, skipping insertion in model container [2024-02-02 09:19:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:16" (3/4) ... [2024-02-02 09:19:17,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbae5b8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:17, skipping insertion in model container [2024-02-02 09:19:17,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:17" (4/4) ... [2024-02-02 09:19:17,629 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2024-02-02 09:19:17,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:19:17,643 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-02-02 09:19:17,643 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:19:17,836 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-02 09:19:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions, 205 flow [2024-02-02 09:19:17,898 INFO L124 PetriNetUnfolderBase]: 0/89 cut-off events. [2024-02-02 09:19:17,899 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:19:17,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 0/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 274 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-02 09:19:17,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 92 transitions, 205 flow [2024-02-02 09:19:17,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 88 transitions, 194 flow [2024-02-02 09:19:17,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:19:17,913 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;@7a543adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:19:17,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2024-02-02 09:19:17,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:19:17,915 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:19:17,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:17,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:17,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:19:17,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:17,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 48488, now seen corresponding path program 1 times [2024-02-02 09:19:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012453187] [2024-02-02 09:19:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012453187] [2024-02-02 09:19:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012453187] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066958848] [2024-02-02 09:19:18,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:18,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:18,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 92 [2024-02-02 09:19:18,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:18,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 92 [2024-02-02 09:19:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:18,579 INFO L124 PetriNetUnfolderBase]: 279/536 cut-off events. [2024-02-02 09:19:18,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:18,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 536 events. 279/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3197 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 995. Up to 473 conditions per place. [2024-02-02 09:19:18,591 INFO L140 encePairwiseOnDemand]: 65/92 looper letters, 39 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-02-02 09:19:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 191 flow [2024-02-02 09:19:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-02 09:19:18,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2024-02-02 09:19:18,603 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 194 flow. Second operand 3 states and 114 transitions. [2024-02-02 09:19:18,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 191 flow [2024-02-02 09:19:18,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:19:18,608 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2024-02-02 09:19:18,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-02-02 09:19:18,612 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2024-02-02 09:19:18,612 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2024-02-02 09:19:18,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:18,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:19:18,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:19:18,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:18,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1504662, now seen corresponding path program 1 times [2024-02-02 09:19:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740564463] [2024-02-02 09:19:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740564463] [2024-02-02 09:19:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740564463] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605203585] [2024-02-02 09:19:18,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:18,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:18,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92 [2024-02-02 09:19:18,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:18,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92 [2024-02-02 09:19:18,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:18,943 INFO L124 PetriNetUnfolderBase]: 279/535 cut-off events. [2024-02-02 09:19:18,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:18,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 535 events. 279/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3179 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1045. Up to 471 conditions per place. [2024-02-02 09:19:18,955 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-02-02 09:19:18,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 188 flow [2024-02-02 09:19:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-02-02 09:19:18,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-02-02 09:19:18,961 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 92 transitions. [2024-02-02 09:19:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 188 flow [2024-02-02 09:19:18,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:18,962 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2024-02-02 09:19:18,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-02 09:19:18,976 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2024-02-02 09:19:18,976 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2024-02-02 09:19:18,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:18,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:19:18,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:19:18,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:18,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash 46646010, now seen corresponding path program 1 times [2024-02-02 09:19:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267657976] [2024-02-02 09:19:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267657976] [2024-02-02 09:19:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267657976] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:19,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523478978] [2024-02-02 09:19:19,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:19,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:19,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 92 [2024-02-02 09:19:19,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:19,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 92 [2024-02-02 09:19:19,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:19,224 INFO L124 PetriNetUnfolderBase]: 279/534 cut-off events. [2024-02-02 09:19:19,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:19,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 534 events. 279/534 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3169 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1041. Up to 469 conditions per place. [2024-02-02 09:19:19,228 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 37 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-02-02 09:19:19,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 184 flow [2024-02-02 09:19:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-02-02 09:19:19,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34057971014492755 [2024-02-02 09:19:19,230 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 94 transitions. [2024-02-02 09:19:19,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 184 flow [2024-02-02 09:19:19,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:19,231 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2024-02-02 09:19:19,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-02-02 09:19:19,232 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -41 predicate places. [2024-02-02 09:19:19,232 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2024-02-02 09:19:19,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:19,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:19:19,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:19:19,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:19,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1446027849, now seen corresponding path program 1 times [2024-02-02 09:19:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357951796] [2024-02-02 09:19:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357951796] [2024-02-02 09:19:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357951796] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048749419] [2024-02-02 09:19:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:19,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 92 [2024-02-02 09:19:19,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:19,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 92 [2024-02-02 09:19:19,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:19,436 INFO L124 PetriNetUnfolderBase]: 279/533 cut-off events. [2024-02-02 09:19:19,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:19,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 533 events. 279/533 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3156 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1037. Up to 467 conditions per place. [2024-02-02 09:19:19,440 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-02-02 09:19:19,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 180 flow [2024-02-02 09:19:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-02-02 09:19:19,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2024-02-02 09:19:19,441 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 96 transitions. [2024-02-02 09:19:19,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 180 flow [2024-02-02 09:19:19,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:19,443 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2024-02-02 09:19:19,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-02-02 09:19:19,444 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -42 predicate places. [2024-02-02 09:19:19,444 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2024-02-02 09:19:19,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:19,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:19:19,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:19:19,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:19,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1877191867, now seen corresponding path program 1 times [2024-02-02 09:19:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788780549] [2024-02-02 09:19:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788780549] [2024-02-02 09:19:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788780549] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529636902] [2024-02-02 09:19:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:19,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 92 [2024-02-02 09:19:19,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:19,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 92 [2024-02-02 09:19:19,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:19,625 INFO L124 PetriNetUnfolderBase]: 279/532 cut-off events. [2024-02-02 09:19:19,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:19,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 532 events. 279/532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3164 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1033. Up to 465 conditions per place. [2024-02-02 09:19:19,630 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 35 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2024-02-02 09:19:19,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 176 flow [2024-02-02 09:19:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-02 09:19:19,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35507246376811596 [2024-02-02 09:19:19,633 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 98 transitions. [2024-02-02 09:19:19,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 176 flow [2024-02-02 09:19:19,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:19,634 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2024-02-02 09:19:19,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-02-02 09:19:19,636 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -43 predicate places. [2024-02-02 09:19:19,636 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2024-02-02 09:19:19,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:19,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:19,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:19:19,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:19,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1936592757, now seen corresponding path program 1 times [2024-02-02 09:19:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565511488] [2024-02-02 09:19:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565511488] [2024-02-02 09:19:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565511488] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665729862] [2024-02-02 09:19:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:19,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:19,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 92 [2024-02-02 09:19:19,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:19,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 92 [2024-02-02 09:19:19,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:19,819 INFO L124 PetriNetUnfolderBase]: 279/531 cut-off events. [2024-02-02 09:19:19,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 531 events. 279/531 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3194 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1029. Up to 463 conditions per place. [2024-02-02 09:19:19,823 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-02-02 09:19:19,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 172 flow [2024-02-02 09:19:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-02 09:19:19,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36231884057971014 [2024-02-02 09:19:19,825 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 100 transitions. [2024-02-02 09:19:19,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 172 flow [2024-02-02 09:19:19,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:19,828 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2024-02-02 09:19:19,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-02-02 09:19:19,830 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -44 predicate places. [2024-02-02 09:19:19,830 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2024-02-02 09:19:19,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:19,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:19,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:19:19,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:19,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash 95168205, now seen corresponding path program 1 times [2024-02-02 09:19:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753986404] [2024-02-02 09:19:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753986404] [2024-02-02 09:19:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753986404] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210059212] [2024-02-02 09:19:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:19,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:19,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92 [2024-02-02 09:19:19,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:19,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:19,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92 [2024-02-02 09:19:19,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,012 INFO L124 PetriNetUnfolderBase]: 279/530 cut-off events. [2024-02-02 09:19:20,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 530 events. 279/530 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3159 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1025. Up to 461 conditions per place. [2024-02-02 09:19:20,016 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2024-02-02 09:19:20,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 168 flow [2024-02-02 09:19:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-02 09:19:20,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2024-02-02 09:19:20,017 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 102 transitions. [2024-02-02 09:19:20,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 168 flow [2024-02-02 09:19:20,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,018 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2024-02-02 09:19:20,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-02-02 09:19:20,019 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -45 predicate places. [2024-02-02 09:19:20,019 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2024-02-02 09:19:20,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:19:20,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1344751420, now seen corresponding path program 1 times [2024-02-02 09:19:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106581473] [2024-02-02 09:19:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106581473] [2024-02-02 09:19:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106581473] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415838204] [2024-02-02 09:19:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 92 [2024-02-02 09:19:20,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 92 [2024-02-02 09:19:20,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,161 INFO L124 PetriNetUnfolderBase]: 279/529 cut-off events. [2024-02-02 09:19:20,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 529 events. 279/529 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3172 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1021. Up to 459 conditions per place. [2024-02-02 09:19:20,164 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 32 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-02-02 09:19:20,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 164 flow [2024-02-02 09:19:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-02 09:19:20,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2024-02-02 09:19:20,166 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 104 transitions. [2024-02-02 09:19:20,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 164 flow [2024-02-02 09:19:20,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,168 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2024-02-02 09:19:20,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-02-02 09:19:20,169 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -46 predicate places. [2024-02-02 09:19:20,169 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2024-02-02 09:19:20,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:19:20,170 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1262380392, now seen corresponding path program 1 times [2024-02-02 09:19:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583767717] [2024-02-02 09:19:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583767717] [2024-02-02 09:19:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583767717] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655920465] [2024-02-02 09:19:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2024-02-02 09:19:20,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2024-02-02 09:19:20,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,312 INFO L124 PetriNetUnfolderBase]: 279/528 cut-off events. [2024-02-02 09:19:20,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 528 events. 279/528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3178 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1017. Up to 457 conditions per place. [2024-02-02 09:19:20,315 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-02-02 09:19:20,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 160 flow [2024-02-02 09:19:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-02 09:19:20,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2024-02-02 09:19:20,317 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 106 transitions. [2024-02-02 09:19:20,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 160 flow [2024-02-02 09:19:20,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,319 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2024-02-02 09:19:20,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-02-02 09:19:20,320 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2024-02-02 09:19:20,320 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2024-02-02 09:19:20,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:19:20,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 479088025, now seen corresponding path program 1 times [2024-02-02 09:19:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381545767] [2024-02-02 09:19:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381545767] [2024-02-02 09:19:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381545767] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630404928] [2024-02-02 09:19:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 92 [2024-02-02 09:19:20,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 92 [2024-02-02 09:19:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,475 INFO L124 PetriNetUnfolderBase]: 279/527 cut-off events. [2024-02-02 09:19:20,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 527 events. 279/527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3181 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1013. Up to 455 conditions per place. [2024-02-02 09:19:20,478 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 30 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-02-02 09:19:20,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 156 flow [2024-02-02 09:19:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-02 09:19:20,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2024-02-02 09:19:20,479 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 108 transitions. [2024-02-02 09:19:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 156 flow [2024-02-02 09:19:20,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,480 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2024-02-02 09:19:20,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-02-02 09:19:20,481 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2024-02-02 09:19:20,481 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2024-02-02 09:19:20,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:19:20,482 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1966828399, now seen corresponding path program 1 times [2024-02-02 09:19:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878343887] [2024-02-02 09:19:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878343887] [2024-02-02 09:19:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878343887] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602893040] [2024-02-02 09:19:20,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2024-02-02 09:19:20,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2024-02-02 09:19:20,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,594 INFO L124 PetriNetUnfolderBase]: 279/526 cut-off events. [2024-02-02 09:19:20,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 526 events. 279/526 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3202 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1009. Up to 453 conditions per place. [2024-02-02 09:19:20,597 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 29 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-02-02 09:19:20,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 152 flow [2024-02-02 09:19:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-02 09:19:20,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39855072463768115 [2024-02-02 09:19:20,598 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 110 transitions. [2024-02-02 09:19:20,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 152 flow [2024-02-02 09:19:20,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,599 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2024-02-02 09:19:20,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-02-02 09:19:20,599 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -49 predicate places. [2024-02-02 09:19:20,600 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2024-02-02 09:19:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:19:20,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 842139682, now seen corresponding path program 1 times [2024-02-02 09:19:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126908354] [2024-02-02 09:19:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126908354] [2024-02-02 09:19:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126908354] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405904607] [2024-02-02 09:19:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2024-02-02 09:19:20,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2024-02-02 09:19:20,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,714 INFO L124 PetriNetUnfolderBase]: 279/525 cut-off events. [2024-02-02 09:19:20,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 525 events. 279/525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3196 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1005. Up to 451 conditions per place. [2024-02-02 09:19:20,717 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 28 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-02-02 09:19:20,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 148 flow [2024-02-02 09:19:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-02 09:19:20,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2024-02-02 09:19:20,718 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 112 transitions. [2024-02-02 09:19:20,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 148 flow [2024-02-02 09:19:20,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,719 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2024-02-02 09:19:20,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-02-02 09:19:20,720 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -50 predicate places. [2024-02-02 09:19:20,720 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2024-02-02 09:19:20,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:19:20,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 336527891, now seen corresponding path program 1 times [2024-02-02 09:19:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306021824] [2024-02-02 09:19:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306021824] [2024-02-02 09:19:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306021824] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264769811] [2024-02-02 09:19:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:20,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2024-02-02 09:19:20,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2024-02-02 09:19:20,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,821 INFO L124 PetriNetUnfolderBase]: 279/524 cut-off events. [2024-02-02 09:19:20,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:20,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 524 events. 279/524 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3169 event pairs, 279 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1001. Up to 461 conditions per place. [2024-02-02 09:19:20,824 INFO L140 encePairwiseOnDemand]: 90/92 looper letters, 28 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2024-02-02 09:19:20,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 144 flow [2024-02-02 09:19:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-02 09:19:20,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2024-02-02 09:19:20,825 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 3 states and 114 transitions. [2024-02-02 09:19:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 144 flow [2024-02-02 09:19:20,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:20,826 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 84 flow [2024-02-02 09:19:20,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-02-02 09:19:20,826 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2024-02-02 09:19:20,826 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 84 flow [2024-02-02 09:19:20,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:20,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:20,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 09:19:20,827 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:20,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1050310150, now seen corresponding path program 1 times [2024-02-02 09:19:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492494662] [2024-02-02 09:19:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492494662] [2024-02-02 09:19:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492494662] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:19:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322604907] [2024-02-02 09:19:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:20,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:20,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2024-02-02 09:19:20,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:20,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:20,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2024-02-02 09:19:20,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:21,036 INFO L124 PetriNetUnfolderBase]: 279/518 cut-off events. [2024-02-02 09:19:21,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:21,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 518 events. 279/518 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3039 event pairs, 39 based on Foata normal form. 42/358 useless extension candidates. Maximal degree in co-relation 1019. Up to 366 conditions per place. [2024-02-02 09:19:21,039 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 38 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-02-02 09:19:21,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 186 flow [2024-02-02 09:19:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:19:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:19:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-02 09:19:21,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967391304347826 [2024-02-02 09:19:21,040 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 84 flow. Second operand 4 states and 146 transitions. [2024-02-02 09:19:21,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 186 flow [2024-02-02 09:19:21,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:19:21,041 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 83 flow [2024-02-02 09:19:21,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-02-02 09:19:21,041 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2024-02-02 09:19:21,041 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 83 flow [2024-02-02 09:19:21,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:21,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:21,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:21,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-02 09:19:21,042 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 86 more)] === [2024-02-02 09:19:21,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1800122173, now seen corresponding path program 1 times [2024-02-02 09:19:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701181661] [2024-02-02 09:19:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:21,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:19:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:21,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:19:21,100 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:19:21,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 89 remaining) [2024-02-02 09:19:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 89 remaining) [2024-02-02 09:19:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 89 remaining) [2024-02-02 09:19:21,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 89 remaining) [2024-02-02 09:19:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 89 remaining) [2024-02-02 09:19:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 89 remaining) [2024-02-02 09:19:21,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 89 remaining) [2024-02-02 09:19:21,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 89 remaining) [2024-02-02 09:19:21,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 89 remaining) [2024-02-02 09:19:21,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 89 remaining) [2024-02-02 09:19:21,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 89 remaining) [2024-02-02 09:19:21,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 89 remaining) [2024-02-02 09:19:21,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 89 remaining) [2024-02-02 09:19:21,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (38 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 89 remaining) [2024-02-02 09:19:21,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 89 remaining) [2024-02-02 09:19:21,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 89 remaining) [2024-02-02 09:19:21,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 89 remaining) [2024-02-02 09:19:21,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 89 remaining) [2024-02-02 09:19:21,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 89 remaining) [2024-02-02 09:19:21,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 89 remaining) [2024-02-02 09:19:21,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 89 remaining) [2024-02-02 09:19:21,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-02 09:19:21,120 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:21,126 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:19:21,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:19:21,169 INFO L503 ceAbstractionStarter]: Automizer considered 49 witness invariants [2024-02-02 09:19:21,170 INFO L504 ceAbstractionStarter]: WitnessConsidered=49 [2024-02-02 09:19:21,171 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:19:21 BasicIcfg [2024-02-02 09:19:21,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:19:21,172 INFO L158 Benchmark]: Toolchain (without parser) took 5412.63ms. Allocated memory was 165.7MB in the beginning and 379.6MB in the end (delta: 213.9MB). Free memory was 87.4MB in the beginning and 282.8MB in the end (delta: -195.4MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,172 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:21,172 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:21,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.54ms. Allocated memory is still 165.7MB. Free memory was 87.1MB in the beginning and 130.4MB in the end (delta: -43.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 127.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,174 INFO L158 Benchmark]: Boogie Preprocessor took 71.35ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 122.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,174 INFO L158 Benchmark]: RCFGBuilder took 1452.76ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 122.9MB in the beginning and 150.5MB in the end (delta: -27.6MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,174 INFO L158 Benchmark]: TraceAbstraction took 3548.36ms. Allocated memory was 245.4MB in the beginning and 379.6MB in the end (delta: 134.2MB). Free memory was 150.5MB in the beginning and 282.8MB in the end (delta: -132.3MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.54ms. Allocated memory is still 165.7MB. Free memory was 87.1MB in the beginning and 130.4MB in the end (delta: -43.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 127.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.35ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 122.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1452.76ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 122.9MB in the beginning and 150.5MB in the end (delta: -27.6MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3548.36ms. Allocated memory was 245.4MB in the beginning and 379.6MB in the end (delta: 134.2MB). Free memory was 150.5MB in the beginning and 282.8MB in the end (delta: -132.3MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 107]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int cardSet_0, cardRarity_1, cardId_2, cardType_3, cardSet_4, cardRarity_5, cardId_6, cardType_7, cardSet_8, cardRarity_9, cardId_10, cardType_11, result_12, result_13, result_14; [L76] 0 pthread_t t1, t2, t3; VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={3:0}, t2={5:0}, t3={6:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L78] 0 cardSet_0 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L80] 0 cardId_2 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L87] 0 cardRarity_9 = __VERIFIER_nondet_int() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L92] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={3:0}, t2={5:0}, t3={6:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: 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: 107]: 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: 107]: 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: 107]: 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: 48]: 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: 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: 107]: 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: 107]: 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: 107]: 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: 107]: 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: 59]: 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: 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: 107]: 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: 107]: 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: 107]: 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: 107]: 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: 70]: 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: 78]: 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: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 94]: 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: 93]: 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: 92]: 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 7 procedures, 147 locations, 89 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 971 IncrementalHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 70 mSDtfsCounter, 971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, InterpolantAutomatonStates: 43, 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, 1.2s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-02-02 09:19:21,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE