./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 fced0e87 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:08:00,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:08:00,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:08:00,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:08:00,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:08:00,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:08:00,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:08:00,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:08:00,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:08:00,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:08:00,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:08:00,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:08:00,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:08:00,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:08:00,214 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:08:00,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:08:00,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:08:00,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:08:00,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:08:00,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:08:00,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:08:00,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:08:00,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:08:00,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:08:00,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:08:00,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:08:00,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:08:00,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:08:00,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:08:00,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:08:00,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:08:00,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:08:00,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:00,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:08:00,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:08:00,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:08:00,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:08:00,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:08:00,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:08:00,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:08:00,220 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:08:00,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:08:00,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:08:00,221 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 16:08:00,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:08:00,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:08:00,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:08:00,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:08:00,459 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:08:00,460 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-31 16:08:01,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:08:01,802 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:08:01,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c [2024-01-31 16:08:01,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89019c2f6/501539c69ea74746b2b7f9867d3360d5/FLAG85a1fda68 [2024-01-31 16:08:01,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89019c2f6/501539c69ea74746b2b7f9867d3360d5 [2024-01-31 16:08:01,829 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:08:01,830 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:08:01,832 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-31 16:08:01,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:08:01,968 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:08:01,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:01,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:08:01,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:08:01,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:01" (1/2) ... [2024-01-31 16:08:01,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e7aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:01, skipping insertion in model container [2024-01-31 16:08:01,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:01" (1/2) ... [2024-01-31 16:08:01,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a6d4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:01, skipping insertion in model container [2024-01-31 16:08:01,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:01" (2/2) ... [2024-01-31 16:08:01,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e7aa0b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:01, skipping insertion in model container [2024-01-31 16:08:01,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:01" (2/2) ... [2024-01-31 16:08:01,979 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:08:02,009 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:08:02,010 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (b <= -1) && (b != 0) [2024-01-31 16:08:02,010 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((((((((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardSet_0 == 0)) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((((((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,011 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (((((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] result_9 == 0 [2024-01-31 16:08:02,012 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,013 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (1 <= b) && (b != 0) [2024-01-31 16:08:02,013 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,013 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((((((((((((0LL - (long long )result_8) + (long long )result_9 >= 0LL) && ((long long )result_8 + (long long )result_9 >= 0LL)) && ((0LL - (long long )result_8) - (long long )result_9 >= 0LL)) && ((long long )result_8 - (long long )result_9 >= 0LL)) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0)) && (cardType_7 == 0)) && (result_8 == 0)) && (result_9 == 0) [2024-01-31 16:08:02,013 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,013 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-31 16:08:02,028 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:08:02,161 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-31 16:08:02,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:02,183 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:08:02,277 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 [2024-01-31 16:08:02,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:02,291 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:08:02,291 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02 WrapperNode [2024-01-31 16:08:02,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:02,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:02,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:08:02,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:08:02,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,328 INFO L138 Inliner]: procedures = 22, calls = 35, calls flagged for inlining = 15, calls inlined = 29, statements flattened = 297 [2024-01-31 16:08:02,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:02,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:08:02,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:08:02,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:08:02,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,354 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-31 16:08:02,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:08:02,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:08:02,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:08:02,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:08:02,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (1/1) ... [2024-01-31 16:08:02,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:08:02,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 16:08:02,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 16:08:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:08:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:08:02,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:08:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:08:02,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:08:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:08:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:08:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:08:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:08:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:08:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:08:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:08:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 16:08:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 16:08:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:08:02,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:08:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:08:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:08:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:08:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:08:02,438 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:08:02,544 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:08:02,546 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:08:02,899 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:08:02,900 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:08:03,532 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:08:03,533 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:08:03,534 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:03 BoogieIcfgContainer [2024-01-31 16:08:03,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:08:03,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:08:03,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:08:03,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:08:03,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:08:01" (1/4) ... [2024-01-31 16:08:03,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea572f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:03, skipping insertion in model container [2024-01-31 16:08:03,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:01" (2/4) ... [2024-01-31 16:08:03,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea572f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:03, skipping insertion in model container [2024-01-31 16:08:03,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:02" (3/4) ... [2024-01-31 16:08:03,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea572f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:03, skipping insertion in model container [2024-01-31 16:08:03,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:03" (4/4) ... [2024-01-31 16:08:03,544 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2024-01-31 16:08:03,558 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:08:03,559 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-31 16:08:03,559 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:08:03,693 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:08:03,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 65 transitions, 144 flow [2024-01-31 16:08:03,767 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2024-01-31 16:08:03,768 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:03,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 0/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 167 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-31 16:08:03,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 65 transitions, 144 flow [2024-01-31 16:08:03,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 62 transitions, 136 flow [2024-01-31 16:08:03,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:08:03,791 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;@437f59d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:08:03,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-31 16:08:03,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:08:03,793 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:08:03,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:03,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:03,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:08:03,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:03,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash 34724, now seen corresponding path program 1 times [2024-01-31 16:08:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747217069] [2024-01-31 16:08:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747217069] [2024-01-31 16:08:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747217069] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705055090] [2024-01-31 16:08:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:04,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:04,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2024-01-31 16:08:04,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:04,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2024-01-31 16:08:04,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:04,298 INFO L124 PetriNetUnfolderBase]: 39/114 cut-off events. [2024-01-31 16:08:04,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:04,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 114 events. 39/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 489 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 179. Up to 99 conditions per place. [2024-01-31 16:08:04,301 INFO L140 encePairwiseOnDemand]: 46/65 looper letters, 28 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-01-31 16:08:04,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 138 flow [2024-01-31 16:08:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-01-31 16:08:04,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-01-31 16:08:04,311 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 3 states and 80 transitions. [2024-01-31 16:08:04,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 138 flow [2024-01-31 16:08:04,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:04,315 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2024-01-31 16:08:04,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-01-31 16:08:04,319 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2024-01-31 16:08:04,319 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2024-01-31 16:08:04,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:04,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:08:04,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:08:04,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:04,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1077540, now seen corresponding path program 1 times [2024-01-31 16:08:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515141715] [2024-01-31 16:08:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515141715] [2024-01-31 16:08:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515141715] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:04,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692822551] [2024-01-31 16:08:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:04,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2024-01-31 16:08:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2024-01-31 16:08:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:04,490 INFO L124 PetriNetUnfolderBase]: 39/113 cut-off events. [2024-01-31 16:08:04,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 113 events. 39/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 490 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 217. Up to 97 conditions per place. [2024-01-31 16:08:04,492 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2024-01-31 16:08:04,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 136 flow [2024-01-31 16:08:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-01-31 16:08:04,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2024-01-31 16:08:04,494 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 66 transitions. [2024-01-31 16:08:04,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 136 flow [2024-01-31 16:08:04,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:04,495 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2024-01-31 16:08:04,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-01-31 16:08:04,496 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -27 predicate places. [2024-01-31 16:08:04,496 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2024-01-31 16:08:04,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:04,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:08:04,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:08:04,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:04,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 33404819, now seen corresponding path program 1 times [2024-01-31 16:08:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388992079] [2024-01-31 16:08:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388992079] [2024-01-31 16:08:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388992079] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486057575] [2024-01-31 16:08:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:04,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:04,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:04,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 65 [2024-01-31 16:08:04,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:04,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 65 [2024-01-31 16:08:04,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:04,635 INFO L124 PetriNetUnfolderBase]: 39/112 cut-off events. [2024-01-31 16:08:04,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:04,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 112 events. 39/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 490 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 213. Up to 95 conditions per place. [2024-01-31 16:08:04,636 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 26 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-01-31 16:08:04,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 132 flow [2024-01-31 16:08:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-01-31 16:08:04,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3487179487179487 [2024-01-31 16:08:04,638 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 68 transitions. [2024-01-31 16:08:04,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 132 flow [2024-01-31 16:08:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:04,639 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2024-01-31 16:08:04,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-01-31 16:08:04,640 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -28 predicate places. [2024-01-31 16:08:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2024-01-31 16:08:04,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:04,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:08:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:08:04,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:04,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1035550493, now seen corresponding path program 1 times [2024-01-31 16:08:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122577227] [2024-01-31 16:08:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122577227] [2024-01-31 16:08:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122577227] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022480217] [2024-01-31 16:08:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:04,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:04,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 65 [2024-01-31 16:08:04,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:04,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 65 [2024-01-31 16:08:04,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:04,774 INFO L124 PetriNetUnfolderBase]: 39/111 cut-off events. [2024-01-31 16:08:04,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 111 events. 39/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 497 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 209. Up to 93 conditions per place. [2024-01-31 16:08:04,775 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 25 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-01-31 16:08:04,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 128 flow [2024-01-31 16:08:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-01-31 16:08:04,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2024-01-31 16:08:04,776 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 70 transitions. [2024-01-31 16:08:04,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 128 flow [2024-01-31 16:08:04,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:04,778 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2024-01-31 16:08:04,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-01-31 16:08:04,778 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -29 predicate places. [2024-01-31 16:08:04,779 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2024-01-31 16:08:04,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:04,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:08:04,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:08:04,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:04,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2037295263, now seen corresponding path program 1 times [2024-01-31 16:08:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:04,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636771401] [2024-01-31 16:08:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636771401] [2024-01-31 16:08:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636771401] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204821272] [2024-01-31 16:08:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:04,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:04,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 65 [2024-01-31 16:08:04,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:04,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 65 [2024-01-31 16:08:04,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:04,881 INFO L124 PetriNetUnfolderBase]: 39/110 cut-off events. [2024-01-31 16:08:04,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 110 events. 39/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 474 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 205. Up to 91 conditions per place. [2024-01-31 16:08:04,883 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2024-01-31 16:08:04,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 124 flow [2024-01-31 16:08:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-01-31 16:08:04,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2024-01-31 16:08:04,884 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 72 transitions. [2024-01-31 16:08:04,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 124 flow [2024-01-31 16:08:04,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:04,885 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2024-01-31 16:08:04,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-01-31 16:08:04,886 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -30 predicate places. [2024-01-31 16:08:04,886 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2024-01-31 16:08:04,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:04,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:04,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:04,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:08:04,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:04,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1268355185, now seen corresponding path program 1 times [2024-01-31 16:08:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430160941] [2024-01-31 16:08:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430160941] [2024-01-31 16:08:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430160941] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395817290] [2024-01-31 16:08:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:05,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2024-01-31 16:08:05,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2024-01-31 16:08:05,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,112 INFO L124 PetriNetUnfolderBase]: 39/109 cut-off events. [2024-01-31 16:08:05,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 109 events. 39/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 475 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 201. Up to 89 conditions per place. [2024-01-31 16:08:05,113 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-01-31 16:08:05,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 120 flow [2024-01-31 16:08:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-31 16:08:05,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37948717948717947 [2024-01-31 16:08:05,115 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 74 transitions. [2024-01-31 16:08:05,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 120 flow [2024-01-31 16:08:05,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,116 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 70 flow [2024-01-31 16:08:05,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-01-31 16:08:05,116 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -31 predicate places. [2024-01-31 16:08:05,117 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 70 flow [2024-01-31 16:08:05,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:08:05,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash -664303984, now seen corresponding path program 1 times [2024-01-31 16:08:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073173948] [2024-01-31 16:08:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073173948] [2024-01-31 16:08:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073173948] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586185625] [2024-01-31 16:08:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:05,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2024-01-31 16:08:05,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2024-01-31 16:08:05,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,205 INFO L124 PetriNetUnfolderBase]: 39/108 cut-off events. [2024-01-31 16:08:05,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 108 events. 39/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 476 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 197. Up to 87 conditions per place. [2024-01-31 16:08:05,206 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2024-01-31 16:08:05,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 116 flow [2024-01-31 16:08:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-01-31 16:08:05,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2024-01-31 16:08:05,208 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 70 flow. Second operand 3 states and 76 transitions. [2024-01-31 16:08:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 116 flow [2024-01-31 16:08:05,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,209 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2024-01-31 16:08:05,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2024-01-31 16:08:05,209 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -32 predicate places. [2024-01-31 16:08:05,209 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2024-01-31 16:08:05,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:08:05,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 881414025, now seen corresponding path program 1 times [2024-01-31 16:08:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096209599] [2024-01-31 16:08:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096209599] [2024-01-31 16:08:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096209599] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:05,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370604809] [2024-01-31 16:08:05,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:05,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:05,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-01-31 16:08:05,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-01-31 16:08:05,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,306 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2024-01-31 16:08:05,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 107 events. 39/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 481 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 193. Up to 85 conditions per place. [2024-01-31 16:08:05,307 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 21 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-01-31 16:08:05,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 112 flow [2024-01-31 16:08:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-01-31 16:08:05,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-01-31 16:08:05,308 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 3 states and 78 transitions. [2024-01-31 16:08:05,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 112 flow [2024-01-31 16:08:05,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,309 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 66 flow [2024-01-31 16:08:05,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-01-31 16:08:05,310 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -33 predicate places. [2024-01-31 16:08:05,310 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 66 flow [2024-01-31 16:08:05,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:08:05,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1554032098, now seen corresponding path program 1 times [2024-01-31 16:08:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988421134] [2024-01-31 16:08:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988421134] [2024-01-31 16:08:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988421134] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474057039] [2024-01-31 16:08:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:05,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-01-31 16:08:05,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-01-31 16:08:05,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,386 INFO L124 PetriNetUnfolderBase]: 39/106 cut-off events. [2024-01-31 16:08:05,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 106 events. 39/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 478 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 189. Up to 83 conditions per place. [2024-01-31 16:08:05,387 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-01-31 16:08:05,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 108 flow [2024-01-31 16:08:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-01-31 16:08:05,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-01-31 16:08:05,388 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 66 flow. Second operand 3 states and 80 transitions. [2024-01-31 16:08:05,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 108 flow [2024-01-31 16:08:05,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,389 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 64 flow [2024-01-31 16:08:05,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-01-31 16:08:05,390 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -34 predicate places. [2024-01-31 16:08:05,390 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 64 flow [2024-01-31 16:08:05,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:08:05,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 930355888, now seen corresponding path program 1 times [2024-01-31 16:08:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417432155] [2024-01-31 16:08:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417432155] [2024-01-31 16:08:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417432155] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551923811] [2024-01-31 16:08:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:05,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:05,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2024-01-31 16:08:05,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2024-01-31 16:08:05,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,452 INFO L124 PetriNetUnfolderBase]: 39/105 cut-off events. [2024-01-31 16:08:05,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 105 events. 39/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 482 event pairs, 39 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 185. Up to 81 conditions per place. [2024-01-31 16:08:05,453 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 19 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2024-01-31 16:08:05,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 104 flow [2024-01-31 16:08:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-01-31 16:08:05,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2024-01-31 16:08:05,454 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 64 flow. Second operand 3 states and 82 transitions. [2024-01-31 16:08:05,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 104 flow [2024-01-31 16:08:05,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,455 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2024-01-31 16:08:05,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-01-31 16:08:05,456 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -35 predicate places. [2024-01-31 16:08:05,456 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 62 flow [2024-01-31 16:08:05,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:08:05,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 809431208, now seen corresponding path program 1 times [2024-01-31 16:08:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897824702] [2024-01-31 16:08:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:05,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:05,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897824702] [2024-01-31 16:08:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897824702] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:05,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:08:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193075615] [2024-01-31 16:08:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:05,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:08:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:08:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:08:05,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-01-31 16:08:05,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:05,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-01-31 16:08:05,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:05,585 INFO L124 PetriNetUnfolderBase]: 39/97 cut-off events. [2024-01-31 16:08:05,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:05,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 97 events. 39/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 301 event pairs, 15 based on Foata normal form. 10/78 useless extension candidates. Maximal degree in co-relation 175. Up to 66 conditions per place. [2024-01-31 16:08:05,586 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 25 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-01-31 16:08:05,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 126 flow [2024-01-31 16:08:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:08:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:08:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-01-31 16:08:05,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38846153846153847 [2024-01-31 16:08:05,588 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 62 flow. Second operand 4 states and 101 transitions. [2024-01-31 16:08:05,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 126 flow [2024-01-31 16:08:05,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:05,589 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2024-01-31 16:08:05,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-01-31 16:08:05,589 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -36 predicate places. [2024-01-31 16:08:05,589 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2024-01-31 16:08:05,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:05,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:05,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:08:05,590 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-31 16:08:05,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash -677435216, now seen corresponding path program 1 times [2024-01-31 16:08:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113608665] [2024-01-31 16:08:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:05,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:08:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:05,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:08:05,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:08:05,638 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 61 remaining) [2024-01-31 16:08:05,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-31 16:08:05,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-31 16:08:05,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-31 16:08:05,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-31 16:08:05,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-31 16:08:05,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-31 16:08:05,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-31 16:08:05,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-31 16:08:05,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 61 remaining) [2024-01-31 16:08:05,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-31 16:08:05,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-31 16:08:05,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-31 16:08:05,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-31 16:08:05,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-31 16:08:05,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:08:05,652 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:05,658 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:08:05,658 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:08:05,697 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-31 16:08:05,697 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-31 16:08:05,699 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:08:05 BasicIcfg [2024-01-31 16:08:05,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:08:05,699 INFO L158 Benchmark]: Toolchain (without parser) took 3731.13ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 163.4MB in the beginning and 107.2MB in the end (delta: 56.1MB). Peak memory consumption was 184.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,700 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 91.4MB in the beginning and 91.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:05,700 INFO L158 Benchmark]: Witness Parser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:05,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.64ms. Allocated memory is still 201.3MB. Free memory was 163.4MB in the beginning and 144.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.51ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,701 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,702 INFO L158 Benchmark]: RCFGBuilder took 1165.90ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 137.8MB in the end (delta: 453.8kB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,703 INFO L158 Benchmark]: TraceAbstraction took 2161.26ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 136.7MB in the beginning and 107.2MB in the end (delta: 29.5MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. [2024-01-31 16:08:05,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 91.4MB in the beginning and 91.3MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.64ms. Allocated memory is still 201.3MB. Free memory was 163.4MB in the beginning and 144.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.51ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.90ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 137.8MB in the end (delta: 453.8kB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2161.26ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 136.7MB in the beginning and 107.2MB in the end (delta: 29.5MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 93]: 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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L67] 0 cardSet_0 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L68] 0 cardRarity_1 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L69] 0 cardId_2 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L70] 0 cardType_3 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L71] 0 cardSet_4 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L72] 0 cardRarity_5 = __VERIFIER_nondet_int() [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L73] 0 cardId_6 = __VERIFIER_nondet_int() [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [L74] 0 cardType_7 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]]] [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=0, 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=0, 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[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, 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] - 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: 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: 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: 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: 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: 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: 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: 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: 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: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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, 102 locations, 61 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: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 37 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 34, 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.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:08:05,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE