./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 cb09d658 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-cb09d65-m [2024-01-27 23:07:53,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:07:53,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:07:53,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:07:53,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:07:53,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:07:53,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:07:53,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:07:53,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:07:53,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:07:53,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:07:53,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:07:53,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:07:53,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:07:53,745 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:07:53,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:07:53,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:07:53,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:07:53,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:07:53,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:07:53,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:07:53,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:07:53,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:07:53,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:07:53,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:07:53,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:07:53,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:07:53,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:07:53,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:07:53,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:07:53,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:07:53,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:07:53,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:53,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:07:53,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:07:53,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:07:53,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:07:53,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:07:53,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:07:53,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:07:53,752 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:07:53,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:07:53,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:07:53,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:07:53,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:07:54,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:07:54,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:07:54,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:07:54,018 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:07:54,019 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-01-27 23:07:55,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:07:55,333 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:07:55,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-01-27 23:07:55,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675e04fee/7430117e4b164e1d8e7bb7d587900705/FLAG7a0c8f0aa [2024-01-27 23:07:55,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675e04fee/7430117e4b164e1d8e7bb7d587900705 [2024-01-27 23:07:55,361 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:07:55,361 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:07:55,363 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-01-27 23:07:55,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:07:55,505 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:07:55,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:55,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:07:55,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:07:55,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:55" (1/2) ... [2024-01-27 23:07:55,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a2ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:55, skipping insertion in model container [2024-01-27 23:07:55,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:55" (1/2) ... [2024-01-27 23:07:55,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1dc71d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:55, skipping insertion in model container [2024-01-27 23:07:55,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (2/2) ... [2024-01-27 23:07:55,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a2ce17 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55, skipping insertion in model container [2024-01-27 23:07:55,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (2/2) ... [2024-01-27 23:07:55,514 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:07:55,550 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:07:55,551 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_10 == 0 [2024-01-27 23:07:55,551 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_14 == 0 [2024-01-27 23:07:55,551 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_6 == 0 [2024-01-27 23:07:55,551 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_13 == 0 [2024-01-27 23:07:55,551 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_9 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_11 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardSet_8 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_7 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_12 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_5 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_7 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_13 == 0 [2024-01-27 23:07:55,552 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_9 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_4 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_14 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_8 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_10 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_11 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_12 == 0 [2024-01-27 23:07:55,553 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_6 == 0 [2024-01-27 23:07:55,554 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_5 == 0 [2024-01-27 23:07:55,554 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,554 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,554 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,554 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_13 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_12 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_11 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_7 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardSet_8 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardId_10 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_14 == 0 [2024-01-27 23:07:55,555 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardRarity_9 == 0 [2024-01-27 23:07:55,556 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] b != 0 [2024-01-27 23:07:55,556 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] 1 <= b [2024-01-27 23:07:55,556 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,556 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_5 == 0 [2024-01-27 23:07:55,556 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_8 == 0 [2024-01-27 23:07:55,557 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_4 == 0 [2024-01-27 23:07:55,557 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_13 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_12 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_14 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_10 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_6 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_3 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_7 == 0 [2024-01-27 23:07:55,558 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_11 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_2 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_9 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_1 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardType_11 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardSet_8 == 0 [2024-01-27 23:07:55,559 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_13 == 0 [2024-01-27 23:07:55,560 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_12 == 0 [2024-01-27 23:07:55,560 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardId_10 == 0 [2024-01-27 23:07:55,560 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_14 == 0 [2024-01-27 23:07:55,561 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardRarity_9 == 0 [2024-01-27 23:07:55,561 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_14 == 0 [2024-01-27 23:07:55,561 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_13 == 0 [2024-01-27 23:07:55,561 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_12 == 0 [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] b <= -1 [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] b != 0 [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_14 == 0 [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] cardType_11 == 0 [2024-01-27 23:07:55,562 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_13 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_12 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_14 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cardType_11 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_12 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_13 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_8 == 0 [2024-01-27 23:07:55,563 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_6 == 0 [2024-01-27 23:07:55,564 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_14 == 0 [2024-01-27 23:07:55,564 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_7 == 0 [2024-01-27 23:07:55,564 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_4 == 0 [2024-01-27 23:07:55,564 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_5 == 0 [2024-01-27 23:07:55,564 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_11 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_10 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_13 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_2 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_12 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_9 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_3 == 0 [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,565 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_14 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_5 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_6 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_11 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_3 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_12 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_13 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_10 == 0 [2024-01-27 23:07:55,566 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_7 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_4 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_9 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_8 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardType_11 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_12 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_14 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_13 == 0 [2024-01-27 23:07:55,567 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardRarity_9 == 0 [2024-01-27 23:07:55,568 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardId_10 == 0 [2024-01-27 23:07:55,568 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,569 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,569 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_4 == 0 [2024-01-27 23:07:55,569 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_6 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_3 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_11 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_10 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_2 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_8 == 0 [2024-01-27 23:07:55,570 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_12 == 0 [2024-01-27 23:07:55,571 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_5 == 0 [2024-01-27 23:07:55,571 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_1 == 0 [2024-01-27 23:07:55,571 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_13 == 0 [2024-01-27 23:07:55,571 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_7 == 0 [2024-01-27 23:07:55,571 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_9 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_14 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_0 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardType_11 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_13 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardId_10 == 0 [2024-01-27 23:07:55,572 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_12 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_14 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_6 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardSet_8 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_7 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_11 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_14 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardRarity_9 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_13 == 0 [2024-01-27 23:07:55,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_10 == 0 [2024-01-27 23:07:55,574 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_12 == 0 [2024-01-27 23:07:55,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:07:55,793 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-01-27 23:07:55,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:55,814 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:07:55,825 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:07:55,925 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 Start Parsing Local Start Parsing Local [2024-01-27 23:07:55,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:55,953 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:07:55,953 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55 WrapperNode [2024-01-27 23:07:55,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:55,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:55,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:07:55,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:07:55,961 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 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:55,968 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 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,000 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 544 [2024-01-27 23:07:56,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:56,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:07:56,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:07:56,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:07:56,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,045 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-01-27 23:07:56,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:07:56,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:07:56,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:07:56,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:07:56,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (1/1) ... [2024-01-27 23:07:56,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:56,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:07:56,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:07:56,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:07:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:07:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:07:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:07:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:07:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:07:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 23:07:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 23:07:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:07:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:07:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:07:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:07:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:07:56,168 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:07:56,281 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:07:56,283 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:07:56,855 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:07:56,855 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:07:57,811 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:07:57,812 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:07:57,812 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:57 BoogieIcfgContainer [2024-01-27 23:07:57,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:07:57,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:07:57,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:07:57,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:07:57,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:07:55" (1/4) ... [2024-01-27 23:07:57,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c11d80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (2/4) ... [2024-01-27 23:07:57,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c11d80f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:55" (3/4) ... [2024-01-27 23:07:57,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c11d80f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:57" (4/4) ... [2024-01-27 23:07:57,819 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2024-01-27 23:07:57,834 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:07:57,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 178 error locations. [2024-01-27 23:07:57,835 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:07:58,083 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 23:07:58,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 324 transitions, 669 flow [2024-01-27 23:07:58,223 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2024-01-27 23:07:58,223 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 23:07:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 321 events. 0/321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 572 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-27 23:07:58,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 324 transitions, 669 flow [2024-01-27 23:07:58,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 320 transitions, 658 flow [2024-01-27 23:07:58,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:07:58,252 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;@45ff8daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:07:58,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 241 error locations. [2024-01-27 23:07:58,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:07:58,254 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:07:58,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:58,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:58,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:07:58,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:58,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 66742, now seen corresponding path program 1 times [2024-01-27 23:07:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981530642] [2024-01-27 23:07:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:58,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981530642] [2024-01-27 23:07:58,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981530642] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:58,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555345468] [2024-01-27 23:07:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:58,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 324 [2024-01-27 23:07:58,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 320 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:58,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:58,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 324 [2024-01-27 23:07:58,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:58,724 INFO L124 PetriNetUnfolderBase]: 279/744 cut-off events. [2024-01-27 23:07:58,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:58,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 744 events. 279/744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3340 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 995. Up to 461 conditions per place. [2024-01-27 23:07:58,731 INFO L140 encePairwiseOnDemand]: 273/324 looper letters, 28 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-01-27 23:07:58,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 258 transitions, 585 flow [2024-01-27 23:07:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-01-27 23:07:58,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8065843621399177 [2024-01-27 23:07:58,745 INFO L175 Difference]: Start difference. First operand has 330 places, 320 transitions, 658 flow. Second operand 3 states and 784 transitions. [2024-01-27 23:07:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 258 transitions, 585 flow [2024-01-27 23:07:58,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 258 transitions, 582 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:07:58,753 INFO L231 Difference]: Finished difference. Result has 267 places, 258 transitions, 526 flow [2024-01-27 23:07:58,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=267, PETRI_TRANSITIONS=258} [2024-01-27 23:07:58,757 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -63 predicate places. [2024-01-27 23:07:58,758 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 258 transitions, 526 flow [2024-01-27 23:07:58,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:58,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:58,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:07:58,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:07:58,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:58,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2070920, now seen corresponding path program 1 times [2024-01-27 23:07:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269759789] [2024-01-27 23:07:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269759789] [2024-01-27 23:07:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269759789] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062452756] [2024-01-27 23:07:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:58,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:58,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 324 [2024-01-27 23:07:58,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:58,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:58,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 324 [2024-01-27 23:07:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:58,915 INFO L124 PetriNetUnfolderBase]: 279/731 cut-off events. [2024-01-27 23:07:58,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 731 events. 279/731 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3321 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1212. Up to 471 conditions per place. [2024-01-27 23:07:58,920 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 38 selfloop transitions, 1 changer transitions 0/245 dead transitions. [2024-01-27 23:07:58,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 578 flow [2024-01-27 23:07:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2024-01-27 23:07:58,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7139917695473251 [2024-01-27 23:07:58,922 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 526 flow. Second operand 3 states and 694 transitions. [2024-01-27 23:07:58,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 578 flow [2024-01-27 23:07:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 245 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:58,926 INFO L231 Difference]: Finished difference. Result has 254 places, 245 transitions, 498 flow [2024-01-27 23:07:58,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=254, PETRI_TRANSITIONS=245} [2024-01-27 23:07:58,927 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -76 predicate places. [2024-01-27 23:07:58,927 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 245 transitions, 498 flow [2024-01-27 23:07:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:58,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:58,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:07:58,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:07:58,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:58,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash 64200518, now seen corresponding path program 1 times [2024-01-27 23:07:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204195753] [2024-01-27 23:07:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204195753] [2024-01-27 23:07:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204195753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:58,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350703133] [2024-01-27 23:07:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:58,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:58,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:58,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 324 [2024-01-27 23:07:58,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:58,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:58,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 324 [2024-01-27 23:07:58,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,081 INFO L124 PetriNetUnfolderBase]: 279/721 cut-off events. [2024-01-27 23:07:59,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:59,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 721 events. 279/721 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3285 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1232. Up to 452 conditions per place. [2024-01-27 23:07:59,085 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-01-27 23:07:59,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 235 transitions, 556 flow [2024-01-27 23:07:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-01-27 23:07:59,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.720164609053498 [2024-01-27 23:07:59,087 INFO L175 Difference]: Start difference. First operand has 254 places, 245 transitions, 498 flow. Second operand 3 states and 700 transitions. [2024-01-27 23:07:59,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 235 transitions, 556 flow [2024-01-27 23:07:59,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 235 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:07:59,090 INFO L231 Difference]: Finished difference. Result has 245 places, 235 transitions, 481 flow [2024-01-27 23:07:59,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=245, PETRI_TRANSITIONS=235} [2024-01-27 23:07:59,091 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -85 predicate places. [2024-01-27 23:07:59,092 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 235 transitions, 481 flow [2024-01-27 23:07:59,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:07:59,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:07:59,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1990218163, now seen corresponding path program 1 times [2024-01-27 23:07:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027280647] [2024-01-27 23:07:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027280647] [2024-01-27 23:07:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027280647] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729784262] [2024-01-27 23:07:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-27 23:07:59,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 235 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-27 23:07:59,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,225 INFO L124 PetriNetUnfolderBase]: 279/713 cut-off events. [2024-01-27 23:07:59,225 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 713 events. 279/713 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3283 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1222. Up to 454 conditions per place. [2024-01-27 23:07:59,229 INFO L140 encePairwiseOnDemand]: 314/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-01-27 23:07:59,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 227 transitions, 537 flow [2024-01-27 23:07:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-01-27 23:07:59,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7304526748971193 [2024-01-27 23:07:59,231 INFO L175 Difference]: Start difference. First operand has 245 places, 235 transitions, 481 flow. Second operand 3 states and 710 transitions. [2024-01-27 23:07:59,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 227 transitions, 537 flow [2024-01-27 23:07:59,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 227 transitions, 533 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,234 INFO L231 Difference]: Finished difference. Result has 237 places, 227 transitions, 465 flow [2024-01-27 23:07:59,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=237, PETRI_TRANSITIONS=227} [2024-01-27 23:07:59,235 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -93 predicate places. [2024-01-27 23:07:59,236 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 227 transitions, 465 flow [2024-01-27 23:07:59,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:07:59,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1567222948, now seen corresponding path program 1 times [2024-01-27 23:07:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388428625] [2024-01-27 23:07:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388428625] [2024-01-27 23:07:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388428625] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201466872] [2024-01-27 23:07:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 324 [2024-01-27 23:07:59,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 227 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 324 [2024-01-27 23:07:59,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,403 INFO L124 PetriNetUnfolderBase]: 279/700 cut-off events. [2024-01-27 23:07:59,403 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 700 events. 279/700 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3284 event pairs, 279 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1214. Up to 473 conditions per place. [2024-01-27 23:07:59,407 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 40 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2024-01-27 23:07:59,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 214 transitions, 521 flow [2024-01-27 23:07:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-01-27 23:07:59,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2024-01-27 23:07:59,409 INFO L175 Difference]: Start difference. First operand has 237 places, 227 transitions, 465 flow. Second operand 3 states and 690 transitions. [2024-01-27 23:07:59,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 214 transitions, 521 flow [2024-01-27 23:07:59,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 214 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,412 INFO L231 Difference]: Finished difference. Result has 224 places, 214 transitions, 437 flow [2024-01-27 23:07:59,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=224, PETRI_TRANSITIONS=214} [2024-01-27 23:07:59,413 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -106 predicate places. [2024-01-27 23:07:59,414 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 214 transitions, 437 flow [2024-01-27 23:07:59,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:07:59,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1339273066, now seen corresponding path program 1 times [2024-01-27 23:07:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945913686] [2024-01-27 23:07:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945913686] [2024-01-27 23:07:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945913686] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210365923] [2024-01-27 23:07:59,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-27 23:07:59,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 214 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-27 23:07:59,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,571 INFO L124 PetriNetUnfolderBase]: 279/698 cut-off events. [2024-01-27 23:07:59,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:59,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 698 events. 279/698 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3254 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1201. Up to 460 conditions per place. [2024-01-27 23:07:59,575 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-01-27 23:07:59,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 212 transitions, 495 flow [2024-01-27 23:07:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-27 23:07:59,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-27 23:07:59,578 INFO L175 Difference]: Start difference. First operand has 224 places, 214 transitions, 437 flow. Second operand 3 states and 732 transitions. [2024-01-27 23:07:59,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 212 transitions, 495 flow [2024-01-27 23:07:59,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 212 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:07:59,581 INFO L231 Difference]: Finished difference. Result has 223 places, 212 transitions, 436 flow [2024-01-27 23:07:59,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=223, PETRI_TRANSITIONS=212} [2024-01-27 23:07:59,585 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -107 predicate places. [2024-01-27 23:07:59,585 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 212 transitions, 436 flow [2024-01-27 23:07:59,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:07:59,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205737, now seen corresponding path program 1 times [2024-01-27 23:07:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265326261] [2024-01-27 23:07:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265326261] [2024-01-27 23:07:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265326261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227842851] [2024-01-27 23:07:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-27 23:07:59,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 212 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-27 23:07:59,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,708 INFO L124 PetriNetUnfolderBase]: 279/692 cut-off events. [2024-01-27 23:07:59,709 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 692 events. 279/692 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3267 event pairs, 279 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1199. Up to 456 conditions per place. [2024-01-27 23:07:59,734 INFO L140 encePairwiseOnDemand]: 316/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-01-27 23:07:59,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 206 transitions, 492 flow [2024-01-27 23:07:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-01-27 23:07:59,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7386831275720165 [2024-01-27 23:07:59,736 INFO L175 Difference]: Start difference. First operand has 223 places, 212 transitions, 436 flow. Second operand 3 states and 718 transitions. [2024-01-27 23:07:59,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 206 transitions, 492 flow [2024-01-27 23:07:59,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 206 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,738 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 424 flow [2024-01-27 23:07:59,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2024-01-27 23:07:59,739 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -113 predicate places. [2024-01-27 23:07:59,740 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 424 flow [2024-01-27 23:07:59,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:07:59,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1448702854, now seen corresponding path program 1 times [2024-01-27 23:07:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068987753] [2024-01-27 23:07:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068987753] [2024-01-27 23:07:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068987753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280323675] [2024-01-27 23:07:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 324 [2024-01-27 23:07:59,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 324 [2024-01-27 23:07:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,859 INFO L124 PetriNetUnfolderBase]: 279/679 cut-off events. [2024-01-27 23:07:59,859 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 679 events. 279/679 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3281 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1194. Up to 474 conditions per place. [2024-01-27 23:07:59,863 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 41 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2024-01-27 23:07:59,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 193 transitions, 482 flow [2024-01-27 23:07:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2024-01-27 23:07:59,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7078189300411523 [2024-01-27 23:07:59,865 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 424 flow. Second operand 3 states and 688 transitions. [2024-01-27 23:07:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 193 transitions, 482 flow [2024-01-27 23:07:59,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 193 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,867 INFO L231 Difference]: Finished difference. Result has 204 places, 193 transitions, 396 flow [2024-01-27 23:07:59,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=204, PETRI_TRANSITIONS=193} [2024-01-27 23:07:59,868 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -126 predicate places. [2024-01-27 23:07:59,868 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 193 transitions, 396 flow [2024-01-27 23:07:59,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:07:59,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1960113356, now seen corresponding path program 1 times [2024-01-27 23:07:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447911605] [2024-01-27 23:07:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447911605] [2024-01-27 23:07:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447911605] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873563308] [2024-01-27 23:07:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 324 [2024-01-27 23:07:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 324 [2024-01-27 23:07:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,986 INFO L124 PetriNetUnfolderBase]: 279/670 cut-off events. [2024-01-27 23:07:59,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 670 events. 279/670 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3267 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1179. Up to 453 conditions per place. [2024-01-27 23:07:59,990 INFO L140 encePairwiseOnDemand]: 313/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2024-01-27 23:07:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 184 transitions, 452 flow [2024-01-27 23:07:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-27 23:07:59,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-27 23:07:59,992 INFO L175 Difference]: Start difference. First operand has 204 places, 193 transitions, 396 flow. Second operand 3 states and 706 transitions. [2024-01-27 23:07:59,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 184 transitions, 452 flow [2024-01-27 23:07:59,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 184 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:07:59,995 INFO L231 Difference]: Finished difference. Result has 196 places, 184 transitions, 381 flow [2024-01-27 23:07:59,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=196, PETRI_TRANSITIONS=184} [2024-01-27 23:07:59,996 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -134 predicate places. [2024-01-27 23:07:59,996 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 184 transitions, 381 flow [2024-01-27 23:07:59,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:07:59,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:07:59,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:07:59,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash -633969820, now seen corresponding path program 1 times [2024-01-27 23:07:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006203514] [2024-01-27 23:07:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006203514] [2024-01-27 23:08:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006203514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647496083] [2024-01-27 23:08:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-27 23:08:00,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 184 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-27 23:08:00,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,179 INFO L124 PetriNetUnfolderBase]: 279/667 cut-off events. [2024-01-27 23:08:00,179 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 667 events. 279/667 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3263 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1172. Up to 459 conditions per place. [2024-01-27 23:08:00,211 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2024-01-27 23:08:00,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 181 transitions, 439 flow [2024-01-27 23:08:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-27 23:08:00,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-27 23:08:00,213 INFO L175 Difference]: Start difference. First operand has 196 places, 184 transitions, 381 flow. Second operand 3 states and 728 transitions. [2024-01-27 23:08:00,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 181 transitions, 439 flow [2024-01-27 23:08:00,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 181 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,215 INFO L231 Difference]: Finished difference. Result has 193 places, 181 transitions, 375 flow [2024-01-27 23:08:00,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=193, PETRI_TRANSITIONS=181} [2024-01-27 23:08:00,216 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -137 predicate places. [2024-01-27 23:08:00,216 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 181 transitions, 375 flow [2024-01-27 23:08:00,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:08:00,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1821774276, now seen corresponding path program 1 times [2024-01-27 23:08:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517123021] [2024-01-27 23:08:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517123021] [2024-01-27 23:08:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517123021] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627967358] [2024-01-27 23:08:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 324 [2024-01-27 23:08:00,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 181 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 324 [2024-01-27 23:08:00,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,334 INFO L124 PetriNetUnfolderBase]: 279/656 cut-off events. [2024-01-27 23:08:00,334 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 656 events. 279/656 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3227 event pairs, 279 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1168. Up to 451 conditions per place. [2024-01-27 23:08:00,337 INFO L140 encePairwiseOnDemand]: 311/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-01-27 23:08:00,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 170 transitions, 431 flow [2024-01-27 23:08:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-27 23:08:00,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181069958847737 [2024-01-27 23:08:00,339 INFO L175 Difference]: Start difference. First operand has 193 places, 181 transitions, 375 flow. Second operand 3 states and 698 transitions. [2024-01-27 23:08:00,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 170 transitions, 431 flow [2024-01-27 23:08:00,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 170 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,342 INFO L231 Difference]: Finished difference. Result has 182 places, 170 transitions, 353 flow [2024-01-27 23:08:00,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=182, PETRI_TRANSITIONS=170} [2024-01-27 23:08:00,342 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -148 predicate places. [2024-01-27 23:08:00,342 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 170 transitions, 353 flow [2024-01-27 23:08:00,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:08:00,343 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash 640429774, now seen corresponding path program 1 times [2024-01-27 23:08:00,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197535175] [2024-01-27 23:08:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197535175] [2024-01-27 23:08:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197535175] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438075142] [2024-01-27 23:08:00,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 324 [2024-01-27 23:08:00,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 170 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 324 [2024-01-27 23:08:00,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,456 INFO L124 PetriNetUnfolderBase]: 279/644 cut-off events. [2024-01-27 23:08:00,456 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 644 events. 279/644 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3227 event pairs, 279 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1155. Up to 450 conditions per place. [2024-01-27 23:08:00,459 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-01-27 23:08:00,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 158 transitions, 405 flow [2024-01-27 23:08:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-27 23:08:00,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181069958847737 [2024-01-27 23:08:00,461 INFO L175 Difference]: Start difference. First operand has 182 places, 170 transitions, 353 flow. Second operand 3 states and 698 transitions. [2024-01-27 23:08:00,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 158 transitions, 405 flow [2024-01-27 23:08:00,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 158 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,463 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 329 flow [2024-01-27 23:08:00,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-01-27 23:08:00,464 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -160 predicate places. [2024-01-27 23:08:00,464 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 329 flow [2024-01-27 23:08:00,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:08:00,465 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1621511474, now seen corresponding path program 1 times [2024-01-27 23:08:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217470871] [2024-01-27 23:08:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217470871] [2024-01-27 23:08:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217470871] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810701591] [2024-01-27 23:08:00,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-27 23:08:00,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-27 23:08:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,564 INFO L124 PetriNetUnfolderBase]: 279/640 cut-off events. [2024-01-27 23:08:00,564 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 640 events. 279/640 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3223 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1146. Up to 458 conditions per place. [2024-01-27 23:08:00,567 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-01-27 23:08:00,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 154 transitions, 387 flow [2024-01-27 23:08:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-27 23:08:00,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-27 23:08:00,569 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 329 flow. Second operand 3 states and 724 transitions. [2024-01-27 23:08:00,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 154 transitions, 387 flow [2024-01-27 23:08:00,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,584 INFO L231 Difference]: Finished difference. Result has 166 places, 154 transitions, 321 flow [2024-01-27 23:08:00,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=166, PETRI_TRANSITIONS=154} [2024-01-27 23:08:00,584 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -164 predicate places. [2024-01-27 23:08:00,585 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 154 transitions, 321 flow [2024-01-27 23:08:00,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:08:00,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1272753884, now seen corresponding path program 1 times [2024-01-27 23:08:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354805549] [2024-01-27 23:08:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354805549] [2024-01-27 23:08:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354805549] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116073458] [2024-01-27 23:08:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 324 [2024-01-27 23:08:00,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 154 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 324 [2024-01-27 23:08:00,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,682 INFO L124 PetriNetUnfolderBase]: 279/633 cut-off events. [2024-01-27 23:08:00,683 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 633 events. 279/633 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3185 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1141. Up to 455 conditions per place. [2024-01-27 23:08:00,686 INFO L140 encePairwiseOnDemand]: 315/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-27 23:08:00,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 147 transitions, 377 flow [2024-01-27 23:08:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:00,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7345679012345679 [2024-01-27 23:08:00,688 INFO L175 Difference]: Start difference. First operand has 166 places, 154 transitions, 321 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:00,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 147 transitions, 377 flow [2024-01-27 23:08:00,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 147 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,690 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 307 flow [2024-01-27 23:08:00,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-01-27 23:08:00,690 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -171 predicate places. [2024-01-27 23:08:00,690 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 307 flow [2024-01-27 23:08:00,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:08:00,691 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 800666921, now seen corresponding path program 1 times [2024-01-27 23:08:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925464815] [2024-01-27 23:08:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925464815] [2024-01-27 23:08:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925464815] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898295812] [2024-01-27 23:08:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-27 23:08:00,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-27 23:08:00,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,831 INFO L124 PetriNetUnfolderBase]: 279/628 cut-off events. [2024-01-27 23:08:00,832 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 628 events. 279/628 cut-off events. For 1/1 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/354 useless extension candidates. Maximal degree in co-relation 1134. Up to 457 conditions per place. [2024-01-27 23:08:00,838 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2024-01-27 23:08:00,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 142 transitions, 363 flow [2024-01-27 23:08:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-27 23:08:00,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-27 23:08:00,840 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 307 flow. Second operand 3 states and 722 transitions. [2024-01-27 23:08:00,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 142 transitions, 363 flow [2024-01-27 23:08:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 142 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,843 INFO L231 Difference]: Finished difference. Result has 154 places, 142 transitions, 297 flow [2024-01-27 23:08:00,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=154, PETRI_TRANSITIONS=142} [2024-01-27 23:08:00,844 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -176 predicate places. [2024-01-27 23:08:00,844 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 142 transitions, 297 flow [2024-01-27 23:08:00,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:00,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 23:08:00,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -274774340, now seen corresponding path program 1 times [2024-01-27 23:08:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164847989] [2024-01-27 23:08:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164847989] [2024-01-27 23:08:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164847989] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:08:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149534074] [2024-01-27 23:08:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:01,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:08:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:08:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:08:01,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-27 23:08:01,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 142 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:01,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:01,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-27 23:08:01,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:01,298 INFO L124 PetriNetUnfolderBase]: 279/586 cut-off events. [2024-01-27 23:08:01,298 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:01,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 586 events. 279/586 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2206 event pairs, 165 based on Foata normal form. 42/429 useless extension candidates. Maximal degree in co-relation 1088. Up to 366 conditions per place. [2024-01-27 23:08:01,301 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-27 23:08:01,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 399 flow [2024-01-27 23:08:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:08:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:08:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 978 transitions. [2024-01-27 23:08:01,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7546296296296297 [2024-01-27 23:08:01,304 INFO L175 Difference]: Start difference. First operand has 154 places, 142 transitions, 297 flow. Second operand 4 states and 978 transitions. [2024-01-27 23:08:01,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 399 flow [2024-01-27 23:08:01,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:01,306 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 293 flow [2024-01-27 23:08:01,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2024-01-27 23:08:01,306 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-27 23:08:01,307 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 293 flow [2024-01-27 23:08:01,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:01,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:01,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:01,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 23:08:01,308 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 23:08:01,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 71932274, now seen corresponding path program 1 times [2024-01-27 23:08:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353983749] [2024-01-27 23:08:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:01,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:08:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:01,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:08:01,355 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:08:01,356 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 241 remaining) [2024-01-27 23:08:01,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 241 remaining) [2024-01-27 23:08:01,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 241 remaining) [2024-01-27 23:08:01,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 241 remaining) [2024-01-27 23:08:01,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 241 remaining) [2024-01-27 23:08:01,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 241 remaining) [2024-01-27 23:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 241 remaining) [2024-01-27 23:08:01,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 241 remaining) [2024-01-27 23:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 241 remaining) [2024-01-27 23:08:01,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 241 remaining) [2024-01-27 23:08:01,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 241 remaining) [2024-01-27 23:08:01,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 241 remaining) [2024-01-27 23:08:01,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 241 remaining) [2024-01-27 23:08:01,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 241 remaining) [2024-01-27 23:08:01,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 241 remaining) [2024-01-27 23:08:01,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 241 remaining) [2024-01-27 23:08:01,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 241 remaining) [2024-01-27 23:08:01,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 241 remaining) [2024-01-27 23:08:01,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 241 remaining) [2024-01-27 23:08:01,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 241 remaining) [2024-01-27 23:08:01,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 241 remaining) [2024-01-27 23:08:01,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 241 remaining) [2024-01-27 23:08:01,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 241 remaining) [2024-01-27 23:08:01,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 241 remaining) [2024-01-27 23:08:01,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 241 remaining) [2024-01-27 23:08:01,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 241 remaining) [2024-01-27 23:08:01,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 241 remaining) [2024-01-27 23:08:01,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 241 remaining) [2024-01-27 23:08:01,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (62 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 241 remaining) [2024-01-27 23:08:01,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 241 remaining) [2024-01-27 23:08:01,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 241 remaining) [2024-01-27 23:08:01,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 241 remaining) [2024-01-27 23:08:01,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 241 remaining) [2024-01-27 23:08:01,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 241 remaining) [2024-01-27 23:08:01,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 241 remaining) [2024-01-27 23:08:01,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 241 remaining) [2024-01-27 23:08:01,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 241 remaining) [2024-01-27 23:08:01,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 241 remaining) [2024-01-27 23:08:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 23:08:01,390 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:01,395 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:08:01,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:08:01,484 INFO L503 ceAbstractionStarter]: Automizer considered 177 witness invariants [2024-01-27 23:08:01,485 INFO L504 ceAbstractionStarter]: WitnessConsidered=177 [2024-01-27 23:08:01,485 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:08:01 BasicIcfg [2024-01-27 23:08:01,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:08:01,486 INFO L158 Benchmark]: Toolchain (without parser) took 5981.29ms. Allocated memory was 130.0MB in the beginning and 320.9MB in the end (delta: 190.8MB). Free memory was 65.9MB in the beginning and 160.6MB in the end (delta: -94.8MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,486 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:01,486 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:01,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.94ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 126.7MB in the end (delta: -60.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.41ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 122.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,487 INFO L158 Benchmark]: Boogie Preprocessor took 67.04ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,487 INFO L158 Benchmark]: RCFGBuilder took 1743.78ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 119.3MB in the beginning and 120.5MB in the end (delta: -1.2MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,487 INFO L158 Benchmark]: TraceAbstraction took 3671.22ms. Allocated memory was 211.8MB in the beginning and 320.9MB in the end (delta: 109.1MB). Free memory was 119.4MB in the beginning and 160.6MB in the end (delta: -41.2MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-01-27 23:08:01,488 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.16ms. Allocated memory is still 130.0MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.94ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 126.7MB in the end (delta: -60.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.41ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 122.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.04ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1743.78ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 119.3MB in the beginning and 120.5MB in the end (delta: -1.2MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3671.22ms. Allocated memory was 211.8MB in the beginning and 320.9MB in the end (delta: 109.1MB). Free memory was 119.4MB in the beginning and 160.6MB in the end (delta: -41.2MB). Peak memory consumption was 67.9MB. 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] 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={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] [L78] 0 cardSet_0 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] [L80] 0 cardId_2 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] [L87] 0 cardRarity_9 = __VERIFIER_nondet_int() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[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={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[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={5:0}, t2={6:0}, t3={3: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[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 78]: 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: 78]: 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: 78]: 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: 78]: 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: 78]: 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: 78]: 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: 78]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 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: 80]: 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: 80]: 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: 80]: 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: 80]: 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: 80]: 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: 80]: 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: 81]: 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: 81]: 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: 81]: 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: 81]: 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: 81]: 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: 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: 82]: 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: 82]: 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: 82]: 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: 82]: 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: 82]: 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: 83]: 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: 83]: 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: 83]: 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: 83]: 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: 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: 84]: 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: 84]: 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: 84]: 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: 84]: 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: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 403 locations, 241 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: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 951 IncrementalHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 90 mSDtfsCounter, 951 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:08:01,517 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