./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.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/bench-exp2x4.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/bench-exp2x4.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:05,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:05,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:05,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:05,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:05,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:05,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:05,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:05,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:05,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:05,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:05,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:05,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:05,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:05,541 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:05,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:05,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:05,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:05,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:05,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:05,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:05,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:05,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:05,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:05,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:05,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:05,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:05,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:05,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:05,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:05,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:05,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:05,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:05,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:05,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:05,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:05,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:05,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:05,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:05,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:05,547 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:05,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:05,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:05,548 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:05,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:05,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:05,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:05,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:05,762 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:05,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-29 22:56:06,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:06,982 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:06,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-29 22:56:06,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ae44525/d217dcaf3e52451daaccb83f61bf51a7/FLAG94c656c3a [2024-01-29 22:56:06,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ae44525/d217dcaf3e52451daaccb83f61bf51a7 [2024-01-29 22:56:07,002 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:07,003 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:07,005 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/bench-exp2x4.wvr.yml/witness.yml [2024-01-29 22:56:07,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:07,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:07,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:07,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:07,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:07,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:07" (1/2) ... [2024-01-29 22:56:07,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5474ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:07" (1/2) ... [2024-01-29 22:56:07,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b4b1969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:07" (2/2) ... [2024-01-29 22:56:07,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5474ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:07" (2/2) ... [2024-01-29 22:56:07,090 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:07,112 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (x3 == 0U) && (x4 == 0U) [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] x3 == 0U [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] n == 0U [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L68] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,113 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L41] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] x2 == 0U [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (x2 == 0U) && (x3 == 0U) [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (x2 == 0U) && (x4 == 0U) [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (x2 == 0U) && (n == 0U) [2024-01-29 22:56:07,114 INFO L98 nessWitnessExtractor]: Loop invariant at [L56-L59] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,115 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,116 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,116 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,116 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && (x3 == 0U) [2024-01-29 22:56:07,116 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL) [2024-01-29 22:56:07,116 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && (x1 == 0U) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && (x3 == 0U)) && (x4 == 0U) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (0LL - (long long )x1) + (long long )x3 >= 0LL [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && (x3 == 0U)) && (n == 0U) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && (x2 == 0U) [2024-01-29 22:56:07,117 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (n == 0U) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:56:07,118 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] n == 0U [2024-01-29 22:56:07,118 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] x4 == 0U [2024-01-29 22:56:07,118 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (x4 == 0U) && (n == 0U) [2024-01-29 22:56:07,140 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:07,330 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/bench-exp2x4.wvr.c[2361,2374] [2024-01-29 22:56:07,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:07,349 INFO L202 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:07,413 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/bench-exp2x4.wvr.c[2361,2374] [2024-01-29 22:56:07,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:07,427 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:07,438 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07 WrapperNode [2024-01-29 22:56:07,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:07,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:07,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:07,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:07,445 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 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,460 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 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,491 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-01-29 22:56:07,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:07,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:07,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:07,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:07,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,538 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-29 22:56:07,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:07,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:07,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:07,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:07,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:07,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:56:07,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:56:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:07,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:07,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-29 22:56:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-29 22:56:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 22:56:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 22:56:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:07,616 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:07,727 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:07,729 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:08,023 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:08,023 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:08,121 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:08,122 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 22:56:08,122 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:08 BoogieIcfgContainer [2024-01-29 22:56:08,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:08,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:08,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:08,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:08,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:07" (1/4) ... [2024-01-29 22:56:08,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4810bcc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:07" (2/4) ... [2024-01-29 22:56:08,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4810bcc6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07" (3/4) ... [2024-01-29 22:56:08,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4810bcc6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:08" (4/4) ... [2024-01-29 22:56:08,128 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-01-29 22:56:08,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:08,144 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-01-29 22:56:08,144 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:08,265 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-29 22:56:08,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 115 transitions, 258 flow [2024-01-29 22:56:08,352 INFO L124 PetriNetUnfolderBase]: 4/111 cut-off events. [2024-01-29 22:56:08,352 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-29 22:56:08,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 111 events. 4/111 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 261 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2024-01-29 22:56:08,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 115 transitions, 258 flow [2024-01-29 22:56:08,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 244 flow [2024-01-29 22:56:08,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:08,377 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;@5889d188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:08,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-01-29 22:56:08,379 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:08,379 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:08,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:08,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:08,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:08,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:08,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 13165, now seen corresponding path program 1 times [2024-01-29 22:56:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785657592] [2024-01-29 22:56:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785657592] [2024-01-29 22:56:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785657592] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:08,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951528000] [2024-01-29 22:56:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:08,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:08,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 115 [2024-01-29 22:56:08,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:08,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:08,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 115 [2024-01-29 22:56:08,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:10,046 INFO L124 PetriNetUnfolderBase]: 7378/11957 cut-off events. [2024-01-29 22:56:10,047 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2024-01-29 22:56:10,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21628 conditions, 11957 events. 7378/11957 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88758 event pairs, 4752 based on Foata normal form. 6/10367 useless extension candidates. Maximal degree in co-relation 18732. Up to 9197 conditions per place. [2024-01-29 22:56:10,165 INFO L140 encePairwiseOnDemand]: 106/115 looper letters, 39 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2024-01-29 22:56:10,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 103 transitions, 312 flow [2024-01-29 22:56:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-01-29 22:56:10,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7130434782608696 [2024-01-29 22:56:10,180 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 244 flow. Second operand 3 states and 246 transitions. [2024-01-29 22:56:10,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 103 transitions, 312 flow [2024-01-29 22:56:10,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 296 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-29 22:56:10,195 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 218 flow [2024-01-29 22:56:10,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-01-29 22:56:10,199 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -13 predicate places. [2024-01-29 22:56:10,200 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 218 flow [2024-01-29 22:56:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:10,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:10,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:10,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:10,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 408572, now seen corresponding path program 1 times [2024-01-29 22:56:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287487225] [2024-01-29 22:56:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:10,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287487225] [2024-01-29 22:56:10,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287487225] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123034936] [2024-01-29 22:56:10,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:10,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:10,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 115 [2024-01-29 22:56:10,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:10,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 115 [2024-01-29 22:56:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:11,903 INFO L124 PetriNetUnfolderBase]: 16105/23673 cut-off events. [2024-01-29 22:56:11,904 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-29 22:56:11,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44162 conditions, 23673 events. 16105/23673 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 164738 event pairs, 11277 based on Foata normal form. 0/17095 useless extension candidates. Maximal degree in co-relation 44138. Up to 20171 conditions per place. [2024-01-29 22:56:12,037 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 47 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2024-01-29 22:56:12,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 101 transitions, 314 flow [2024-01-29 22:56:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-01-29 22:56:12,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-01-29 22:56:12,043 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 218 flow. Second operand 4 states and 276 transitions. [2024-01-29 22:56:12,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 101 transitions, 314 flow [2024-01-29 22:56:12,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:12,047 INFO L231 Difference]: Finished difference. Result has 105 places, 101 transitions, 216 flow [2024-01-29 22:56:12,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=105, PETRI_TRANSITIONS=101} [2024-01-29 22:56:12,048 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -14 predicate places. [2024-01-29 22:56:12,048 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 216 flow [2024-01-29 22:56:12,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:12,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:12,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:12,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:12,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:12,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -618143258, now seen corresponding path program 1 times [2024-01-29 22:56:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194152477] [2024-01-29 22:56:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194152477] [2024-01-29 22:56:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194152477] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053747430] [2024-01-29 22:56:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:12,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:12,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 115 [2024-01-29 22:56:12,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:12,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:12,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 115 [2024-01-29 22:56:12,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:13,088 INFO L124 PetriNetUnfolderBase]: 7378/11953 cut-off events. [2024-01-29 22:56:13,089 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 22:56:13,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21317 conditions, 11953 events. 7378/11953 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88826 event pairs, 4752 based on Foata normal form. 0/10360 useless extension candidates. Maximal degree in co-relation 21269. Up to 9191 conditions per place. [2024-01-29 22:56:13,160 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 43 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2024-01-29 22:56:13,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 304 flow [2024-01-29 22:56:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2024-01-29 22:56:13,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6260869565217392 [2024-01-29 22:56:13,162 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 216 flow. Second operand 4 states and 288 transitions. [2024-01-29 22:56:13,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 304 flow [2024-01-29 22:56:13,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:13,166 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 212 flow [2024-01-29 22:56:13,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-01-29 22:56:13,167 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -16 predicate places. [2024-01-29 22:56:13,167 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 212 flow [2024-01-29 22:56:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:13,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:13,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:13,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:13,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1605595354, now seen corresponding path program 1 times [2024-01-29 22:56:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284548634] [2024-01-29 22:56:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284548634] [2024-01-29 22:56:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284548634] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:13,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:13,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731083466] [2024-01-29 22:56:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:13,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:13,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 115 [2024-01-29 22:56:13,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:13,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:13,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 115 [2024-01-29 22:56:13,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:14,718 INFO L124 PetriNetUnfolderBase]: 18096/26642 cut-off events. [2024-01-29 22:56:14,719 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-01-29 22:56:14,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49678 conditions, 26642 events. 18096/26642 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 188221 event pairs, 12789 based on Foata normal form. 0/18845 useless extension candidates. Maximal degree in co-relation 49636. Up to 22679 conditions per place. [2024-01-29 22:56:14,966 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 48 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2024-01-29 22:56:14,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 97 transitions, 308 flow [2024-01-29 22:56:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-29 22:56:14,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-01-29 22:56:14,968 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 212 flow. Second operand 3 states and 235 transitions. [2024-01-29 22:56:14,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 97 transitions, 308 flow [2024-01-29 22:56:14,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:14,970 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 206 flow [2024-01-29 22:56:14,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2024-01-29 22:56:14,971 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -19 predicate places. [2024-01-29 22:56:14,971 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 206 flow [2024-01-29 22:56:14,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:14,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:14,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:14,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:14,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1766151115, now seen corresponding path program 1 times [2024-01-29 22:56:14,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019348730] [2024-01-29 22:56:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019348730] [2024-01-29 22:56:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019348730] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647546004] [2024-01-29 22:56:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:15,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:15,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 115 [2024-01-29 22:56:15,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:15,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 115 [2024-01-29 22:56:15,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:15,747 INFO L124 PetriNetUnfolderBase]: 7378/11950 cut-off events. [2024-01-29 22:56:15,747 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 22:56:15,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21312 conditions, 11950 events. 7378/11950 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88837 event pairs, 4752 based on Foata normal form. 0/10360 useless extension candidates. Maximal degree in co-relation 21284. Up to 9195 conditions per place. [2024-01-29 22:56:15,822 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 43 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-01-29 22:56:15,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 294 flow [2024-01-29 22:56:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-01-29 22:56:15,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7072463768115942 [2024-01-29 22:56:15,823 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 206 flow. Second operand 3 states and 244 transitions. [2024-01-29 22:56:15,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 294 flow [2024-01-29 22:56:15,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:15,825 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 204 flow [2024-01-29 22:56:15,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-01-29 22:56:15,826 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -20 predicate places. [2024-01-29 22:56:15,826 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 204 flow [2024-01-29 22:56:15,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:15,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:15,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:15,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:15,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1083890710, now seen corresponding path program 1 times [2024-01-29 22:56:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711165692] [2024-01-29 22:56:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711165692] [2024-01-29 22:56:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711165692] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294594932] [2024-01-29 22:56:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:15,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:15,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 115 [2024-01-29 22:56:15,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:15,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 115 [2024-01-29 22:56:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:16,481 INFO L124 PetriNetUnfolderBase]: 7378/11949 cut-off events. [2024-01-29 22:56:16,482 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 22:56:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21316 conditions, 11949 events. 7378/11949 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88822 event pairs, 4752 based on Foata normal form. 0/10358 useless extension candidates. Maximal degree in co-relation 21285. Up to 9196 conditions per place. [2024-01-29 22:56:16,650 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 48 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-01-29 22:56:16,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 302 flow [2024-01-29 22:56:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2024-01-29 22:56:16,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2024-01-29 22:56:16,652 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 204 flow. Second operand 3 states and 237 transitions. [2024-01-29 22:56:16,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 302 flow [2024-01-29 22:56:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:16,654 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 202 flow [2024-01-29 22:56:16,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-01-29 22:56:16,655 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -21 predicate places. [2024-01-29 22:56:16,655 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 202 flow [2024-01-29 22:56:16,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:16,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:16,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:16,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:16,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2058068149, now seen corresponding path program 1 times [2024-01-29 22:56:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743206421] [2024-01-29 22:56:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743206421] [2024-01-29 22:56:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743206421] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847925845] [2024-01-29 22:56:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:16,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 115 [2024-01-29 22:56:16,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:16,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:16,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 115 [2024-01-29 22:56:16,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:17,335 INFO L124 PetriNetUnfolderBase]: 7378/11948 cut-off events. [2024-01-29 22:56:17,335 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 22:56:17,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21312 conditions, 11948 events. 7378/11948 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88664 event pairs, 4752 based on Foata normal form. 0/10358 useless extension candidates. Maximal degree in co-relation 21283. Up to 9192 conditions per place. [2024-01-29 22:56:17,396 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 45 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 22:56:17,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 294 flow [2024-01-29 22:56:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-01-29 22:56:17,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7130434782608696 [2024-01-29 22:56:17,398 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 202 flow. Second operand 3 states and 246 transitions. [2024-01-29 22:56:17,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 294 flow [2024-01-29 22:56:17,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:17,400 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 200 flow [2024-01-29 22:56:17,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-01-29 22:56:17,400 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -22 predicate places. [2024-01-29 22:56:17,401 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 200 flow [2024-01-29 22:56:17,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:17,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:17,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:17,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:17,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:17,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 624397302, now seen corresponding path program 1 times [2024-01-29 22:56:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464193077] [2024-01-29 22:56:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:17,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464193077] [2024-01-29 22:56:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464193077] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:17,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:17,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657962094] [2024-01-29 22:56:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:17,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:17,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 115 [2024-01-29 22:56:17,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:17,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:17,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 115 [2024-01-29 22:56:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:18,217 INFO L124 PetriNetUnfolderBase]: 7378/11947 cut-off events. [2024-01-29 22:56:18,218 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 22:56:18,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21313 conditions, 11947 events. 7378/11947 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 88706 event pairs, 4752 based on Foata normal form. 0/10358 useless extension candidates. Maximal degree in co-relation 21276. Up to 9193 conditions per place. [2024-01-29 22:56:18,285 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 47 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 22:56:18,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 296 flow [2024-01-29 22:56:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2024-01-29 22:56:18,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6840579710144927 [2024-01-29 22:56:18,286 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 200 flow. Second operand 3 states and 236 transitions. [2024-01-29 22:56:18,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 296 flow [2024-01-29 22:56:18,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:18,288 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 198 flow [2024-01-29 22:56:18,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-01-29 22:56:18,289 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -23 predicate places. [2024-01-29 22:56:18,289 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 198 flow [2024-01-29 22:56:18,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:18,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:18,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:18,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:18,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:18,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2118519698, now seen corresponding path program 1 times [2024-01-29 22:56:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420405512] [2024-01-29 22:56:18,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420405512] [2024-01-29 22:56:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420405512] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:18,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166583150] [2024-01-29 22:56:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:18,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 115 [2024-01-29 22:56:18,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:18,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:18,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 115 [2024-01-29 22:56:18,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:19,619 INFO L124 PetriNetUnfolderBase]: 16105/23664 cut-off events. [2024-01-29 22:56:19,620 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-29 22:56:19,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44152 conditions, 23664 events. 16105/23664 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 164627 event pairs, 11277 based on Foata normal form. 1/17091 useless extension candidates. Maximal degree in co-relation 44122. Up to 20175 conditions per place. [2024-01-29 22:56:19,763 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 47 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-29 22:56:19,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 294 flow [2024-01-29 22:56:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-01-29 22:56:19,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-29 22:56:19,765 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 198 flow. Second operand 3 states and 230 transitions. [2024-01-29 22:56:19,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 294 flow [2024-01-29 22:56:19,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:19,766 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 196 flow [2024-01-29 22:56:19,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-01-29 22:56:19,767 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -24 predicate places. [2024-01-29 22:56:19,767 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 196 flow [2024-01-29 22:56:19,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:19,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:19,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:19,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:19,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:19,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1249600804, now seen corresponding path program 1 times [2024-01-29 22:56:19,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:19,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158141792] [2024-01-29 22:56:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:19,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:19,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158141792] [2024-01-29 22:56:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158141792] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619930090] [2024-01-29 22:56:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:19,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:19,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 115 [2024-01-29 22:56:19,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 115 [2024-01-29 22:56:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:21,148 INFO L124 PetriNetUnfolderBase]: 16636/24747 cut-off events. [2024-01-29 22:56:21,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:21,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46340 conditions, 24747 events. 16636/24747 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 177434 event pairs, 8555 based on Foata normal form. 0/18818 useless extension candidates. Maximal degree in co-relation 46309. Up to 15471 conditions per place. [2024-01-29 22:56:21,336 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 65 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2024-01-29 22:56:21,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 373 flow [2024-01-29 22:56:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-29 22:56:21,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6891304347826087 [2024-01-29 22:56:21,343 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 196 flow. Second operand 4 states and 317 transitions. [2024-01-29 22:56:21,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 373 flow [2024-01-29 22:56:21,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:21,344 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 207 flow [2024-01-29 22:56:21,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-01-29 22:56:21,345 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -23 predicate places. [2024-01-29 22:56:21,345 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 207 flow [2024-01-29 22:56:21,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:21,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:21,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:21,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:21,346 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:21,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2050178760, now seen corresponding path program 1 times [2024-01-29 22:56:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49177755] [2024-01-29 22:56:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49177755] [2024-01-29 22:56:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49177755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:21,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:21,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341873506] [2024-01-29 22:56:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:21,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:21,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 115 [2024-01-29 22:56:21,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:21,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:21,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 115 [2024-01-29 22:56:21,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:22,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] L47-4-->L48: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_8 4294967296)) InVars {~n~0=v_~n~0_8, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_8, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][41], [25#L90-1true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true, 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 117#$Ultimate##0true]) [2024-01-29 22:56:22,204 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,204 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,204 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,204 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][63], [75#L65-5true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 72#L38true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true, 97#L89-4true]) [2024-01-29 22:56:22,273 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,273 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,273 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,273 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [72#L38true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 97#L89-4true]) [2024-01-29 22:56:22,276 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,276 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,276 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,276 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:22,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 72#L38true, 106#L56-5true, 25#L90-1true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true]) [2024-01-29 22:56:22,332 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-01-29 22:56:22,332 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:22,332 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:22,332 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:22,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 12#L48true, 97#L89-4true]) [2024-01-29 22:56:22,372 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-29 22:56:22,372 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:22,372 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:22,372 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:22,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [30#L40true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 97#L89-4true]) [2024-01-29 22:56:22,381 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:22,381 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:22,381 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:22,381 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:22,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 25#L90-1true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 12#L48true]) [2024-01-29 22:56:22,395 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:22,395 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:22,395 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:22,395 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:22,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 161#true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 97#L89-4true, 81#L38-3true]) [2024-01-29 22:56:22,400 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [30#L40true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 25#L90-1true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true]) [2024-01-29 22:56:22,400 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:22,400 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:22,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][80], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 106#L56-5true, 25#L90-1true, 15#L66true, 161#true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 81#L38-3true]) [2024-01-29 22:56:22,409 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:22,409 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:22,409 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:22,409 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-01-29 22:56:22,418 INFO L124 PetriNetUnfolderBase]: 11157/17549 cut-off events. [2024-01-29 22:56:22,418 INFO L125 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2024-01-29 22:56:22,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32392 conditions, 17549 events. 11157/17549 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 130811 event pairs, 5811 based on Foata normal form. 855/16607 useless extension candidates. Maximal degree in co-relation 23832. Up to 11995 conditions per place. [2024-01-29 22:56:22,556 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 56 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2024-01-29 22:56:22,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 356 flow [2024-01-29 22:56:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2024-01-29 22:56:22,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7521739130434782 [2024-01-29 22:56:22,557 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 207 flow. Second operand 4 states and 346 transitions. [2024-01-29 22:56:22,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 356 flow [2024-01-29 22:56:22,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 106 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:22,560 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 195 flow [2024-01-29 22:56:22,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-29 22:56:22,561 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -27 predicate places. [2024-01-29 22:56:22,561 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 195 flow [2024-01-29 22:56:22,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:22,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:22,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:22,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:22,562 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:22,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1170749059, now seen corresponding path program 1 times [2024-01-29 22:56:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580033382] [2024-01-29 22:56:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580033382] [2024-01-29 22:56:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580033382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896193341] [2024-01-29 22:56:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:22,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:22,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 115 [2024-01-29 22:56:22,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:22,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:22,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 115 [2024-01-29 22:56:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:23,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true, 97#L89-4true]) [2024-01-29 22:56:23,272 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,272 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-29 22:56:23,272 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-29 22:56:23,272 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true, 97#L89-4true]) [2024-01-29 22:56:23,356 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,356 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,356 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-29 22:56:23,356 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-29 22:56:23,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true]) [2024-01-29 22:56:23,359 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,359 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,359 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,359 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true, 97#L89-4true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,446 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true]) [2024-01-29 22:56:23,446 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,446 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 90#L67true, 104#L38-5true, 12#L48true, 11#thread3EXITtrue, 97#L89-4true]) [2024-01-29 22:56:23,449 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,449 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,449 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-29 22:56:23,449 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 106#L56-5true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 90#L67true, 12#L48true, 97#L89-4true, 81#L38-3true]) [2024-01-29 22:56:23,466 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,466 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,466 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:23,466 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 12#L48true, 64#L57true, 97#L89-4true]) [2024-01-29 22:56:23,513 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,514 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-29 22:56:23,514 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,514 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 168#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 64#L57true, 117#$Ultimate##0true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,519 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,519 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:23,519 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,519 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:23,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 30#L40true, 90#L67true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 11#thread3EXITtrue, 97#L89-4true]) [2024-01-29 22:56:23,520 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,520 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,520 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,520 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:23,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 90#L67true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 12#L48true, 11#thread3EXITtrue]) [2024-01-29 22:56:23,522 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,522 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-29 22:56:23,522 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,522 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 106#L56-5true, 90#L67true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 81#L38-3true]) [2024-01-29 22:56:23,534 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,535 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,535 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,535 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 90#L67true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 11#thread3EXITtrue, 97#L89-4true, 81#L38-3true]) [2024-01-29 22:56:23,537 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,537 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,537 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,537 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true, 97#L89-4true]) [2024-01-29 22:56:23,538 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,538 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,538 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,538 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 64#L57true, 97#L89-4true]) [2024-01-29 22:56:23,570 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,570 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,570 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,570 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 12#L48true, 64#L57true]) [2024-01-29 22:56:23,572 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,572 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,572 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-29 22:56:23,572 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 90#L67true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 11#thread3EXITtrue]) [2024-01-29 22:56:23,574 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-01-29 22:56:23,574 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,574 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-29 22:56:23,574 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 97#L89-4true]) [2024-01-29 22:56:23,577 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,577 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,577 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,577 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([513] L66-->L67: Formula: (and (= (* v_~x4~0_24 2) v_~x4~0_23) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_24, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_23, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][84], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 90#L67true, 12#L48true, 11#thread3EXITtrue, 81#L38-3true]) [2024-01-29 22:56:23,584 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,584 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,584 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,584 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 30#L40true, 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true]) [2024-01-29 22:56:23,585 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,585 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,585 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,585 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true, 97#L89-4true, 81#L38-3true]) [2024-01-29 22:56:23,586 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,586 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,586 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,586 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 64#L57true, 97#L89-4true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,605 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,605 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,605 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,605 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 64#L57true]) [2024-01-29 22:56:23,606 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,606 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,606 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-29 22:56:23,606 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-29 22:56:23,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 97#L89-4true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,609 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,609 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,609 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,609 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true]) [2024-01-29 22:56:23,610 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 97#L89-4true, 81#L38-3true]) [2024-01-29 22:56:23,610 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,610 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,611 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,611 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L56-4-->L57: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_10} AuxVars[] AssignedVars[][62], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 12#L48true, 64#L57true, 81#L38-3true]) [2024-01-29 22:56:23,614 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,614 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,614 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,614 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 104#L38-5true, 64#L57true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,624 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,624 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,624 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-29 22:56:23,624 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-29 22:56:23,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 30#L40true, 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 54#thread2EXITtrue]) [2024-01-29 22:56:23,626 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,626 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,626 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,626 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 97#L89-4true, 54#thread2EXITtrue, 81#L38-3true]) [2024-01-29 22:56:23,627 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [38#L47-5true, 171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 81#L38-3true]) [2024-01-29 22:56:23,627 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-01-29 22:56:23,627 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-29 22:56:23,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L65-4-->L66: Formula: (< (mod v_~x4~0_6 4294967296) (mod v_~n~0_12 4294967296)) InVars {~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} OutVars{~n~0=v_~n~0_12, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[][77], [171#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 177#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 25#L90-1true, 15#L66true, Black: 163#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 64#L57true, 54#thread2EXITtrue, 81#L38-3true]) [2024-01-29 22:56:23,633 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-01-29 22:56:23,633 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-01-29 22:56:23,633 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,633 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-29 22:56:23,637 INFO L124 PetriNetUnfolderBase]: 11187/17961 cut-off events. [2024-01-29 22:56:23,637 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2024-01-29 22:56:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32843 conditions, 17961 events. 11187/17961 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 139069 event pairs, 4685 based on Foata normal form. 876/17162 useless extension candidates. Maximal degree in co-relation 32806. Up to 12152 conditions per place. [2024-01-29 22:56:23,750 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 60 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2024-01-29 22:56:23,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 105 transitions, 358 flow [2024-01-29 22:56:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2024-01-29 22:56:23,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7543478260869565 [2024-01-29 22:56:23,752 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 195 flow. Second operand 4 states and 347 transitions. [2024-01-29 22:56:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 105 transitions, 358 flow [2024-01-29 22:56:23,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:23,753 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 186 flow [2024-01-29 22:56:23,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-01-29 22:56:23,754 INFO L281 CegarLoopForPetriNet]: 119 programPoint places, -31 predicate places. [2024-01-29 22:56:23,754 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 186 flow [2024-01-29 22:56:23,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:23,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:23,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:23,755 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-01-29 22:56:23,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1168184500, now seen corresponding path program 1 times [2024-01-29 22:56:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210133817] [2024-01-29 22:56:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:23,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:56:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:23,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:56:23,791 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:56:23,791 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 66 remaining) [2024-01-29 22:56:23,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 66 remaining) [2024-01-29 22:56:23,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 66 remaining) [2024-01-29 22:56:23,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 66 remaining) [2024-01-29 22:56:23,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 66 remaining) [2024-01-29 22:56:23,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 66 remaining) [2024-01-29 22:56:23,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 66 remaining) [2024-01-29 22:56:23,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 66 remaining) [2024-01-29 22:56:23,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 66 remaining) [2024-01-29 22:56:23,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 66 remaining) [2024-01-29 22:56:23,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 66 remaining) [2024-01-29 22:56:23,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 66 remaining) [2024-01-29 22:56:23,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (29 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 66 remaining) [2024-01-29 22:56:23,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 66 remaining) [2024-01-29 22:56:23,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 66 remaining) [2024-01-29 22:56:23,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 66 remaining) [2024-01-29 22:56:23,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 66 remaining) [2024-01-29 22:56:23,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 66 remaining) [2024-01-29 22:56:23,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 66 remaining) [2024-01-29 22:56:23,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 66 remaining) [2024-01-29 22:56:23,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 66 remaining) [2024-01-29 22:56:23,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:23,806 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:23,811 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:56:23,811 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:56:23,835 INFO L503 ceAbstractionStarter]: Automizer considered 40 witness invariants [2024-01-29 22:56:23,835 INFO L504 ceAbstractionStarter]: WitnessConsidered=40 [2024-01-29 22:56:23,836 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:56:23 BasicIcfg [2024-01-29 22:56:23,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:56:23,836 INFO L158 Benchmark]: Toolchain (without parser) took 16764.75ms. Allocated memory was 169.9MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 97.0MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 4.0GB. Max. memory is 16.1GB. [2024-01-29 22:56:23,837 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory was 136.9MB in the beginning and 136.9MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:23,837 INFO L158 Benchmark]: Witness Parser took 0.39ms. Allocated memory is still 169.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:23,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.06ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 128.2MB in the end (delta: -31.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-29 22:56:23,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.88ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:56:23,838 INFO L158 Benchmark]: Boogie Preprocessor took 58.31ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:56:23,838 INFO L158 Benchmark]: RCFGBuilder took 571.00ms. Allocated memory is still 169.9MB. Free memory was 122.7MB in the beginning and 79.3MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-01-29 22:56:23,838 INFO L158 Benchmark]: TraceAbstraction took 15712.46ms. Allocated memory was 169.9MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 79.3MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 4.0GB. Max. memory is 16.1GB. [2024-01-29 22:56:23,839 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.17ms. Allocated memory is still 169.9MB. Free memory was 136.9MB in the beginning and 136.9MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.39ms. Allocated memory is still 169.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.06ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 128.2MB in the end (delta: -31.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.88ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.31ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.00ms. Allocated memory is still 169.9MB. Free memory was 122.7MB in the beginning and 79.3MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15712.46ms. Allocated memory was 169.9MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 79.3MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 4.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L35] 0 unsigned int x1, x2, x3, x4, n; [L74] 0 pthread_t t1, t2, t3, t4; VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]]] [L77] 0 x1 = __VERIFIER_nondet_uint() [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] [L78] 0 x2 = __VERIFIER_nondet_uint() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x3=0, x4=0] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x3=0, x4=0] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L79] 0 x3 = __VERIFIER_nondet_uint() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x4=0] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]] [L80] 0 x4 = __VERIFIER_nondet_uint() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L81] 0 n = __VERIFIER_nondet_uint() [L84] CALL 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L32] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L86] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=1, x2=1, x3=1, x4=1] [L38] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, x1=1, x2=1, x3=1, x4=1] [L38] COND FALSE 1 !(x1 < n) VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] - UnprovableResult [Line: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: 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: 88]: 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: 86]: 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: 87]: 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: 89]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 66 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: 15.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1047 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1720 IncrementalHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 110 mSDtfsCounter, 1720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:56:23,875 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