./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-symm.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-symm.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-symm.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-ab2e0ac-m [2024-01-29 14:17:40,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:17:40,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:17:40,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:17:40,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:17:40,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:17:40,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:17:40,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:17:40,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:17:40,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:17:40,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:17:40,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:17:40,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:17:40,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:17:40,591 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:17:40,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:17:40,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:17:40,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:17:40,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:17:40,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:17:40,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:17:40,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:17:40,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:17:40,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:17:40,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:17:40,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:17:40,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:17:40,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:17:40,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:17:40,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:17:40,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:17:40,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:17:40,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:40,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:17:40,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:17:40,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:17:40,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:17:40,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:17:40,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:17:40,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:17:40,597 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:17:40,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:17:40,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:17:40,598 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:17:40,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:17:40,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:17:40,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:17:40,829 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:17:40,829 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:17:40,830 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-symm.wvr.yml/witness.yml [2024-01-29 14:17:40,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:17:40,984 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:17:40,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c [2024-01-29 14:17:41,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:17:42,151 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:17:42,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c [2024-01-29 14:17:42,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787fc8523/80e0f7fff2b84bc2886b1966def7b307/FLAGfabb85c26 [2024-01-29 14:17:42,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787fc8523/80e0f7fff2b84bc2886b1966def7b307 [2024-01-29 14:17:42,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:17:42,169 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:17:42,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:42,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:17:42,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:17:42,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:40" (1/2) ... [2024-01-29 14:17:42,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619a8772 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:40" (1/2) ... [2024-01-29 14:17:42,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@477fc32d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:42" (2/2) ... [2024-01-29 14:17:42,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619a8772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:42" (2/2) ... [2024-01-29 14:17:42,178 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:17:42,205 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] result_8 == 0 [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] result_9 == 0 [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,207 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] cardType_7 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] result_9 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] result_9 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] cardType_7 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] result_8 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] cardId_6 == 0 [2024-01-29 14:17:42,208 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_9 == 0 [2024-01-29 14:17:42,209 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardType_7 == 0 [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardSet_4 == 0 [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardRarity_5 == 0 [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_8 == 0 [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardId_6 == 0 [2024-01-29 14:17:42,210 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardRarity_5 == 0 [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardId_2 == 0 [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardId_6 == 0 [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardType_3 == 0 [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,211 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardSet_4 == 0 [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardType_7 == 0 [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_9 == 0 [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardRarity_1 == 0 [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardType_3 == 0 [2024-01-29 14:17:42,212 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardId_6 == 0 [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardSet_4 == 0 [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardRarity_5 == 0 [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_9 == 0 [2024-01-29 14:17:42,213 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_8 == 0 [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardType_7 == 0 [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] 1 <= b [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] b != 0 [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardRarity_5 == 0 [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,214 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardType_3 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardSet_4 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardId_6 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardType_7 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardId_2 == 0 [2024-01-29 14:17:42,215 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_9 == 0 [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardType_7 == 0 [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardId_6 == 0 [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,216 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardRarity_5 == 0 [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_9 == 0 [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_8 == 0 [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,217 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_9 == 0 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] b <= -1 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] b != 0 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_9 == 0 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardRarity_5 == 0 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardType_7 == 0 [2024-01-29 14:17:42,218 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardRarity_1 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardId_2 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardType_3 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_9 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardSet_0 == 0 [2024-01-29 14:17:42,219 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardId_6 == 0 [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardSet_4 == 0 [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,220 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,236 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:17:42,414 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-symm.wvr.c[3012,3025] [2024-01-29 14:17:42,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:42,439 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:17:42,452 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 [2024-01-29 14:17:42,531 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-symm.wvr.c[3012,3025] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:42,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:42,552 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:17:42,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42 WrapperNode [2024-01-29 14:17:42,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:42,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:42,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:17:42,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:17:42,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,595 INFO L138 Inliner]: procedures = 22, calls = 35, calls flagged for inlining = 15, calls inlined = 29, statements flattened = 394 [2024-01-29 14:17:42,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:42,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:17:42,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:17:42,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:17:42,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,622 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 14:17:42,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:17:42,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:17:42,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:17:42,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:17:42,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:42,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:17:42,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:17:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:17:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:17:42,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:17:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:17:42,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:17:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 14:17:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 14:17:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:17:42,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:17:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:17:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:17:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:17:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:17:42,726 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:17:42,804 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:17:42,807 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:17:43,344 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:17:43,344 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:17:44,120 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:17:44,122 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:17:44,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:44 BoogieIcfgContainer [2024-01-29 14:17:44,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:17:44,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:17:44,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:17:44,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:17:44,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:40" (1/4) ... [2024-01-29 14:17:44,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169f7058 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:17:42" (2/4) ... [2024-01-29 14:17:44,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169f7058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42" (3/4) ... [2024-01-29 14:17:44,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169f7058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:44" (4/4) ... [2024-01-29 14:17:44,135 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2024-01-29 14:17:44,151 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:17:44,151 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 132 error locations. [2024-01-29 14:17:44,156 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:17:44,317 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:17:44,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 243 transitions, 500 flow [2024-01-29 14:17:44,476 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2024-01-29 14:17:44,477 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:17:44,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 241 events. 0/241 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 368 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-29 14:17:44,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 243 transitions, 500 flow [2024-01-29 14:17:44,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 240 transitions, 492 flow [2024-01-29 14:17:44,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:17:44,507 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;@25c99052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:17:44,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 174 error locations. [2024-01-29 14:17:44,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:17:44,511 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:17:44,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:44,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:17:44,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:44,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 49064, now seen corresponding path program 1 times [2024-01-29 14:17:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309049769] [2024-01-29 14:17:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309049769] [2024-01-29 14:17:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309049769] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675508035] [2024-01-29 14:17:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 243 [2024-01-29 14:17:44,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 240 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 243 [2024-01-29 14:17:44,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,897 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2024-01-29 14:17:44,898 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:44,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 317 events. 64/317 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 833 event pairs, 49 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 271. Up to 104 conditions per place. [2024-01-29 14:17:44,902 INFO L140 encePairwiseOnDemand]: 205/243 looper letters, 32 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2024-01-29 14:17:44,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 203 transitions, 485 flow [2024-01-29 14:17:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2024-01-29 14:17:44,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8285322359396433 [2024-01-29 14:17:44,915 INFO L175 Difference]: Start difference. First operand has 247 places, 240 transitions, 492 flow. Second operand 3 states and 604 transitions. [2024-01-29 14:17:44,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 203 transitions, 485 flow [2024-01-29 14:17:44,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:44,921 INFO L231 Difference]: Finished difference. Result has 203 places, 196 transitions, 402 flow [2024-01-29 14:17:44,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=203, PETRI_TRANSITIONS=196} [2024-01-29 14:17:44,925 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -44 predicate places. [2024-01-29 14:17:44,926 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 196 transitions, 402 flow [2024-01-29 14:17:44,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:17:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:17:44,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:44,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1522578, now seen corresponding path program 1 times [2024-01-29 14:17:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833051821] [2024-01-29 14:17:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833051821] [2024-01-29 14:17:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833051821] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016265902] [2024-01-29 14:17:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 243 [2024-01-29 14:17:45,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 243 [2024-01-29 14:17:45,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,173 INFO L124 PetriNetUnfolderBase]: 64/293 cut-off events. [2024-01-29 14:17:45,173 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-29 14:17:45,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 293 events. 64/293 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 866 event pairs, 64 based on Foata normal form. 25/198 useless extension candidates. Maximal degree in co-relation 286. Up to 128 conditions per place. [2024-01-29 14:17:45,175 INFO L140 encePairwiseOnDemand]: 214/243 looper letters, 22 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-01-29 14:17:45,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 169 transitions, 396 flow [2024-01-29 14:17:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2024-01-29 14:17:45,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7078189300411523 [2024-01-29 14:17:45,178 INFO L175 Difference]: Start difference. First operand has 203 places, 196 transitions, 402 flow. Second operand 3 states and 516 transitions. [2024-01-29 14:17:45,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 169 transitions, 396 flow [2024-01-29 14:17:45,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 169 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,183 INFO L231 Difference]: Finished difference. Result has 176 places, 169 transitions, 346 flow [2024-01-29 14:17:45,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2024-01-29 14:17:45,184 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -71 predicate places. [2024-01-29 14:17:45,184 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 346 flow [2024-01-29 14:17:45,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:17:45,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:17:45,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash 47201370, now seen corresponding path program 1 times [2024-01-29 14:17:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482464261] [2024-01-29 14:17:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482464261] [2024-01-29 14:17:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482464261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662290613] [2024-01-29 14:17:45,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 243 [2024-01-29 14:17:45,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 243 [2024-01-29 14:17:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,425 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-01-29 14:17:45,425 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 275 events. 64/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 838 event pairs, 64 based on Foata normal form. 16/175 useless extension candidates. Maximal degree in co-relation 282. Up to 128 conditions per place. [2024-01-29 14:17:45,427 INFO L140 encePairwiseOnDemand]: 223/243 looper letters, 22 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-29 14:17:45,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 151 transitions, 358 flow [2024-01-29 14:17:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2024-01-29 14:17:45,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6954732510288066 [2024-01-29 14:17:45,429 INFO L175 Difference]: Start difference. First operand has 176 places, 169 transitions, 346 flow. Second operand 3 states and 507 transitions. [2024-01-29 14:17:45,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 151 transitions, 358 flow [2024-01-29 14:17:45,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,433 INFO L231 Difference]: Finished difference. Result has 158 places, 151 transitions, 310 flow [2024-01-29 14:17:45,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=158, PETRI_TRANSITIONS=151} [2024-01-29 14:17:45,434 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -89 predicate places. [2024-01-29 14:17:45,435 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 151 transitions, 310 flow [2024-01-29 14:17:45,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:17:45,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1884075220, now seen corresponding path program 1 times [2024-01-29 14:17:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386578177] [2024-01-29 14:17:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386578177] [2024-01-29 14:17:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386578177] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80498587] [2024-01-29 14:17:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 243 [2024-01-29 14:17:45,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 243 [2024-01-29 14:17:45,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,536 INFO L124 PetriNetUnfolderBase]: 64/268 cut-off events. [2024-01-29 14:17:45,536 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 268 events. 64/268 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 832 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 281. Up to 129 conditions per place. [2024-01-29 14:17:45,537 INFO L140 encePairwiseOnDemand]: 234/243 looper letters, 28 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-29 14:17:45,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 144 transitions, 356 flow [2024-01-29 14:17:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2024-01-29 14:17:45,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7462277091906722 [2024-01-29 14:17:45,539 INFO L175 Difference]: Start difference. First operand has 158 places, 151 transitions, 310 flow. Second operand 3 states and 544 transitions. [2024-01-29 14:17:45,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 144 transitions, 356 flow [2024-01-29 14:17:45,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,541 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 296 flow [2024-01-29 14:17:45,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-01-29 14:17:45,542 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -96 predicate places. [2024-01-29 14:17:45,543 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 296 flow [2024-01-29 14:17:45,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:17:45,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1723211873, now seen corresponding path program 1 times [2024-01-29 14:17:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814762349] [2024-01-29 14:17:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814762349] [2024-01-29 14:17:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814762349] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089346860] [2024-01-29 14:17:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 243 [2024-01-29 14:17:45,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 243 [2024-01-29 14:17:45,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,651 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-01-29 14:17:45,651 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 267 events. 64/267 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 826 event pairs, 51 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 299. Up to 112 conditions per place. [2024-01-29 14:17:45,653 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 26 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2024-01-29 14:17:45,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 362 flow [2024-01-29 14:17:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2024-01-29 14:17:45,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860082304526749 [2024-01-29 14:17:45,654 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 296 flow. Second operand 3 states and 573 transitions. [2024-01-29 14:17:45,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 362 flow [2024-01-29 14:17:45,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,656 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 296 flow [2024-01-29 14:17:45,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2024-01-29 14:17:45,657 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -97 predicate places. [2024-01-29 14:17:45,657 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 296 flow [2024-01-29 14:17:45,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:17:45,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1850721088, now seen corresponding path program 1 times [2024-01-29 14:17:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133156892] [2024-01-29 14:17:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133156892] [2024-01-29 14:17:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133156892] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027919001] [2024-01-29 14:17:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 243 [2024-01-29 14:17:45,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 243 [2024-01-29 14:17:45,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,818 INFO L124 PetriNetUnfolderBase]: 64/258 cut-off events. [2024-01-29 14:17:45,819 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 14:17:45,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 258 events. 64/258 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 828 event pairs, 64 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 345. Up to 127 conditions per place. [2024-01-29 14:17:45,820 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 30 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-01-29 14:17:45,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 134 transitions, 342 flow [2024-01-29 14:17:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-01-29 14:17:45,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7352537722908093 [2024-01-29 14:17:45,822 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 296 flow. Second operand 3 states and 536 transitions. [2024-01-29 14:17:45,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 134 transitions, 342 flow [2024-01-29 14:17:45,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 134 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,824 INFO L231 Difference]: Finished difference. Result has 141 places, 134 transitions, 276 flow [2024-01-29 14:17:45,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=141, PETRI_TRANSITIONS=134} [2024-01-29 14:17:45,824 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -106 predicate places. [2024-01-29 14:17:45,825 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 134 transitions, 276 flow [2024-01-29 14:17:45,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:17:45,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1537777275, now seen corresponding path program 1 times [2024-01-29 14:17:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420530017] [2024-01-29 14:17:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420530017] [2024-01-29 14:17:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420530017] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18423160] [2024-01-29 14:17:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 243 [2024-01-29 14:17:45,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 243 [2024-01-29 14:17:45,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,896 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-01-29 14:17:45,896 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 254 events. 64/254 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 817 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 281. Up to 132 conditions per place. [2024-01-29 14:17:45,898 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 25 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-29 14:17:45,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 322 flow [2024-01-29 14:17:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2024-01-29 14:17:45,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7626886145404664 [2024-01-29 14:17:45,899 INFO L175 Difference]: Start difference. First operand has 141 places, 134 transitions, 276 flow. Second operand 3 states and 556 transitions. [2024-01-29 14:17:45,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 322 flow [2024-01-29 14:17:45,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 130 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,901 INFO L231 Difference]: Finished difference. Result has 137 places, 130 transitions, 268 flow [2024-01-29 14:17:45,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=137, PETRI_TRANSITIONS=130} [2024-01-29 14:17:45,902 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -110 predicate places. [2024-01-29 14:17:45,902 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 268 flow [2024-01-29 14:17:45,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:17:45,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -426453868, now seen corresponding path program 1 times [2024-01-29 14:17:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471345772] [2024-01-29 14:17:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471345772] [2024-01-29 14:17:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471345772] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174947728] [2024-01-29 14:17:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 243 [2024-01-29 14:17:45,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 130 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 243 [2024-01-29 14:17:45,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,970 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2024-01-29 14:17:45,971 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 251 events. 64/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 814 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 332. Up to 133 conditions per place. [2024-01-29 14:17:45,972 INFO L140 encePairwiseOnDemand]: 238/243 looper letters, 24 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-01-29 14:17:45,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 314 flow [2024-01-29 14:17:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2024-01-29 14:17:45,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681755829903978 [2024-01-29 14:17:45,974 INFO L175 Difference]: Start difference. First operand has 137 places, 130 transitions, 268 flow. Second operand 3 states and 560 transitions. [2024-01-29 14:17:45,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 314 flow [2024-01-29 14:17:45,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,976 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 262 flow [2024-01-29 14:17:45,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2024-01-29 14:17:45,976 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -113 predicate places. [2024-01-29 14:17:45,977 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 262 flow [2024-01-29 14:17:45,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:17:45,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:45,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash -335166481, now seen corresponding path program 1 times [2024-01-29 14:17:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669387380] [2024-01-29 14:17:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669387380] [2024-01-29 14:17:45,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669387380] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230379402] [2024-01-29 14:17:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 243 [2024-01-29 14:17:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 243 [2024-01-29 14:17:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,041 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2024-01-29 14:17:46,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 249 events. 64/249 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 815 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 346. Up to 134 conditions per place. [2024-01-29 14:17:46,042 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 23 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-01-29 14:17:46,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 125 transitions, 308 flow [2024-01-29 14:17:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-01-29 14:17:46,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2024-01-29 14:17:46,044 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 262 flow. Second operand 3 states and 564 transitions. [2024-01-29 14:17:46,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 125 transitions, 308 flow [2024-01-29 14:17:46,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 125 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,046 INFO L231 Difference]: Finished difference. Result has 132 places, 125 transitions, 258 flow [2024-01-29 14:17:46,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2024-01-29 14:17:46,047 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -115 predicate places. [2024-01-29 14:17:46,047 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 258 flow [2024-01-29 14:17:46,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:17:46,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:46,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 27609230, now seen corresponding path program 1 times [2024-01-29 14:17:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557692198] [2024-01-29 14:17:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557692198] [2024-01-29 14:17:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557692198] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578786205] [2024-01-29 14:17:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 243 [2024-01-29 14:17:46,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 243 [2024-01-29 14:17:46,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,116 INFO L124 PetriNetUnfolderBase]: 64/241 cut-off events. [2024-01-29 14:17:46,117 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 241 events. 64/241 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 803 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 361. Up to 128 conditions per place. [2024-01-29 14:17:46,118 INFO L140 encePairwiseOnDemand]: 233/243 looper letters, 29 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-01-29 14:17:46,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 117 transitions, 304 flow [2024-01-29 14:17:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-01-29 14:17:46,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-01-29 14:17:46,120 INFO L175 Difference]: Start difference. First operand has 132 places, 125 transitions, 258 flow. Second operand 3 states and 540 transitions. [2024-01-29 14:17:46,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 117 transitions, 304 flow [2024-01-29 14:17:46,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,121 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 242 flow [2024-01-29 14:17:46,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-01-29 14:17:46,122 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -123 predicate places. [2024-01-29 14:17:46,122 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 242 flow [2024-01-29 14:17:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:17:46,123 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:46,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash 855887653, now seen corresponding path program 1 times [2024-01-29 14:17:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532088198] [2024-01-29 14:17:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532088198] [2024-01-29 14:17:46,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532088198] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295508050] [2024-01-29 14:17:46,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 243 [2024-01-29 14:17:46,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 243 [2024-01-29 14:17:46,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,190 INFO L124 PetriNetUnfolderBase]: 64/235 cut-off events. [2024-01-29 14:17:46,191 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 235 events. 64/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 788 event pairs, 64 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 288. Up to 130 conditions per place. [2024-01-29 14:17:46,192 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 24 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-29 14:17:46,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 282 flow [2024-01-29 14:17:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-01-29 14:17:46,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7599451303155007 [2024-01-29 14:17:46,194 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 242 flow. Second operand 3 states and 554 transitions. [2024-01-29 14:17:46,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 282 flow [2024-01-29 14:17:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,195 INFO L231 Difference]: Finished difference. Result has 118 places, 111 transitions, 230 flow [2024-01-29 14:17:46,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=118, PETRI_TRANSITIONS=111} [2024-01-29 14:17:46,196 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -129 predicate places. [2024-01-29 14:17:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 111 transitions, 230 flow [2024-01-29 14:17:46,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,197 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] [2024-01-29 14:17:46,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:17:46,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:46,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -101512783, now seen corresponding path program 1 times [2024-01-29 14:17:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783856454] [2024-01-29 14:17:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783856454] [2024-01-29 14:17:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783856454] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069121267] [2024-01-29 14:17:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 243 [2024-01-29 14:17:46,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 111 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 243 [2024-01-29 14:17:46,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,407 INFO L124 PetriNetUnfolderBase]: 64/234 cut-off events. [2024-01-29 14:17:46,408 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 234 events. 64/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 803 event pairs, 64 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 307. Up to 126 conditions per place. [2024-01-29 14:17:46,409 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 29 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-01-29 14:17:46,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 290 flow [2024-01-29 14:17:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-01-29 14:17:46,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7229080932784636 [2024-01-29 14:17:46,410 INFO L175 Difference]: Start difference. First operand has 118 places, 111 transitions, 230 flow. Second operand 3 states and 527 transitions. [2024-01-29 14:17:46,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 290 flow [2024-01-29 14:17:46,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,412 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 228 flow [2024-01-29 14:17:46,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2024-01-29 14:17:46,413 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -130 predicate places. [2024-01-29 14:17:46,413 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 228 flow [2024-01-29 14:17:46,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,414 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] [2024-01-29 14:17:46,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:17:46,414 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:46,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -508696212, now seen corresponding path program 1 times [2024-01-29 14:17:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118853248] [2024-01-29 14:17:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118853248] [2024-01-29 14:17:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118853248] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418164425] [2024-01-29 14:17:46,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:46,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:46,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:46,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 243 [2024-01-29 14:17:46,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 243 [2024-01-29 14:17:46,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,584 INFO L124 PetriNetUnfolderBase]: 64/231 cut-off events. [2024-01-29 14:17:46,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:46,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 231 events. 64/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 731 event pairs, 4 based on Foata normal form. 12/186 useless extension candidates. Maximal degree in co-relation 275. Up to 108 conditions per place. [2024-01-29 14:17:46,585 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 28 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-29 14:17:46,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 300 flow [2024-01-29 14:17:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 752 transitions. [2024-01-29 14:17:46,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2024-01-29 14:17:46,587 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 228 flow. Second operand 4 states and 752 transitions. [2024-01-29 14:17:46,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 300 flow [2024-01-29 14:17:46,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,589 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 224 flow [2024-01-29 14:17:46,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-01-29 14:17:46,589 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -131 predicate places. [2024-01-29 14:17:46,590 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 224 flow [2024-01-29 14:17:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,590 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] [2024-01-29 14:17:46,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:17:46,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-29 14:17:46,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1410288228, now seen corresponding path program 1 times [2024-01-29 14:17:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874734691] [2024-01-29 14:17:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:46,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:17:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:46,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:17:46,635 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:17:46,636 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 174 remaining) [2024-01-29 14:17:46,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 174 remaining) [2024-01-29 14:17:46,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 174 remaining) [2024-01-29 14:17:46,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 174 remaining) [2024-01-29 14:17:46,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 174 remaining) [2024-01-29 14:17:46,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 174 remaining) [2024-01-29 14:17:46,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 174 remaining) [2024-01-29 14:17:46,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 174 remaining) [2024-01-29 14:17:46,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 174 remaining) [2024-01-29 14:17:46,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 174 remaining) [2024-01-29 14:17:46,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 174 remaining) [2024-01-29 14:17:46,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 174 remaining) [2024-01-29 14:17:46,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 174 remaining) [2024-01-29 14:17:46,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 174 remaining) [2024-01-29 14:17:46,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 174 remaining) [2024-01-29 14:17:46,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 174 remaining) [2024-01-29 14:17:46,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 174 remaining) [2024-01-29 14:17:46,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 174 remaining) [2024-01-29 14:17:46,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 174 remaining) [2024-01-29 14:17:46,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 174 remaining) [2024-01-29 14:17:46,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION (41 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 174 remaining) [2024-01-29 14:17:46,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 174 remaining) [2024-01-29 14:17:46,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 174 remaining) [2024-01-29 14:17:46,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 174 remaining) [2024-01-29 14:17:46,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 174 remaining) [2024-01-29 14:17:46,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 174 remaining) [2024-01-29 14:17:46,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 174 remaining) [2024-01-29 14:17:46,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 174 remaining) [2024-01-29 14:17:46,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 174 remaining) [2024-01-29 14:17:46,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 174 remaining) [2024-01-29 14:17:46,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 174 remaining) [2024-01-29 14:17:46,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:17:46,662 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,667 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:17:46,667 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:17:46,726 INFO L503 ceAbstractionStarter]: Automizer considered 131 witness invariants [2024-01-29 14:17:46,726 INFO L504 ceAbstractionStarter]: WitnessConsidered=131 [2024-01-29 14:17:46,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:17:46 BasicIcfg [2024-01-29 14:17:46,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:17:46,727 INFO L158 Benchmark]: Toolchain (without parser) took 4558.11ms. Allocated memory was 213.9MB in the beginning and 350.2MB in the end (delta: 136.3MB). Free memory was 135.7MB in the beginning and 183.2MB in the end (delta: -47.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,727 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:46,727 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 213.9MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:46,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.66ms. Allocated memory is still 213.9MB. Free memory was 135.6MB in the beginning and 174.5MB in the end (delta: -38.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.53ms. Allocated memory is still 213.9MB. Free memory was 174.5MB in the beginning and 171.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,728 INFO L158 Benchmark]: Boogie Preprocessor took 52.68ms. Allocated memory is still 213.9MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,728 INFO L158 Benchmark]: RCFGBuilder took 1473.19ms. Allocated memory is still 213.9MB. Free memory was 168.3MB in the beginning and 116.2MB in the end (delta: 52.1MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,729 INFO L158 Benchmark]: TraceAbstraction took 2602.22ms. Allocated memory was 213.9MB in the beginning and 350.2MB in the end (delta: 136.3MB). Free memory was 115.1MB in the beginning and 183.2MB in the end (delta: -68.0MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,729 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 213.9MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.66ms. Allocated memory is still 213.9MB. Free memory was 135.6MB in the beginning and 174.5MB in the end (delta: -38.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.53ms. Allocated memory is still 213.9MB. Free memory was 174.5MB in the beginning and 171.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.68ms. Allocated memory is still 213.9MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1473.19ms. Allocated memory is still 213.9MB. Free memory was 168.3MB in the beginning and 116.2MB in the end (delta: 52.1MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2602.22ms. Allocated memory was 213.9MB in the beginning and 350.2MB in the end (delta: 136.3MB). Free memory was 115.1MB in the beginning and 183.2MB in the end (delta: -68.0MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 94]: 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, result_8, result_9; [L65] 0 pthread_t t1, t2; VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L67] 0 cardSet_0 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L68] 0 cardRarity_1 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L69] 0 cardId_2 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L70] 0 cardType_3 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L71] 0 cardSet_4 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L72] 0 cardRarity_5 = __VERIFIER_nondet_int() [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L73] 0 cardId_6 = __VERIFIER_nondet_int() [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L74] 0 cardType_7 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L75] 0 result_8 = __VERIFIER_nondet_int() [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L76] 0 result_9 = __VERIFIER_nondet_int() [L79] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L93] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] [L93] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] [L93] CALL 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L35] COND FALSE 1 !(!cond) [L93] RET 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L94] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] [L94] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]]]] VAL [\old(a)=0, \old(b)=1, a=0, b=1, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=1, cardType_3=0, cardType_7=0, result_8=0, result_9=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: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: 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: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: 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: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 79]: 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: 80]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 296 locations, 174 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1247 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 306 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=0, InterpolantAutomatonStates: 40, 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.3s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:17:46,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE