./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x6.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-exp2x6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-59af5db-m [2024-02-02 09:18:50,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:18:50,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:18:50,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:18:50,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:18:50,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:18:50,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:18:50,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:18:50,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:18:50,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:18:50,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:18:50,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:18:50,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:18:50,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:18:50,373 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:18:50,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:18:50,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:18:50,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:18:50,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:18:50,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:18:50,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:18:50,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:18:50,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:18:50,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:18:50,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:18:50,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:18:50,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:18:50,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:18:50,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:18:50,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:18:50,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:18:50,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:18:50,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:18:50,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:18:50,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:18:50,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:18:50,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:18:50,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:18:50,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:18:50,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:18:50,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:18:50,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:18:50,643 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:18:50,643 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:18:50,644 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-exp2x6.wvr.yml/witness.yml [2024-02-02 09:18:50,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:18:50,763 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:18:50,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-02 09:18:51,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:18:52,060 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:18:52,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-02-02 09:18:52,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746785fcb/d0987dcfaec5416a8982b5abe43dc51f/FLAG54eaf8a39 [2024-02-02 09:18:52,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746785fcb/d0987dcfaec5416a8982b5abe43dc51f [2024-02-02 09:18:52,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:18:52,085 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:18:52,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:18:52,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:18:52,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:18:52,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:50" (1/2) ... [2024-02-02 09:18:52,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5bc903 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:18:52, skipping insertion in model container [2024-02-02 09:18:52,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:50" (1/2) ... [2024-02-02 09:18:52,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3556c095 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:18:52, skipping insertion in model container [2024-02-02 09:18:52,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:18:52" (2/2) ... [2024-02-02 09:18:52,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5bc903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52, skipping insertion in model container [2024-02-02 09:18:52,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:18:52" (2/2) ... [2024-02-02 09:18:52,097 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:18:52,122 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:18:52,127 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,127 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,127 INFO L101 nessWitnessExtractor]: Location invariant after [L38-L43] n == 0U [2024-02-02 09:18:52,127 INFO L101 nessWitnessExtractor]: Loop invariant at [L38-L43] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,127 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,128 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,128 INFO L101 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,132 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,132 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (x4 == 0U) && (n == 0U) [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((((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)) && (x1 == 0U)) && (x2 == 0U)) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Loop invariant at [L60-L65] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,133 INFO L101 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Loop invariant at [L49-L54] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Location invariant before [L41-L41] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Loop invariant at [L71-L76] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,134 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] (((x2 == 0U) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0U [2024-02-02 09:18:52,135 INFO L101 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-02-02 09:18:52,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:18:52,360 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-exp2x6.wvr.c[2505,2518] [2024-02-02 09:18:52,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:18:52,369 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 [2024-02-02 09:18:52,463 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-exp2x6.wvr.c[2505,2518] [2024-02-02 09:18:52,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:18:52,484 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:18:52,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52 WrapperNode [2024-02-02 09:18:52,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:18:52,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:18:52,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:18:52,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:18:52,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,523 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-02-02 09:18:52,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:18:52,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:18:52,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:18:52,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:18:52,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,559 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-02-02 09:18:52,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:18:52,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:18:52,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:18:52,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:18:52,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (1/1) ... [2024-02-02 09:18:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:18:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:52,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:18:52,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:18:52,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:18:52,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:18:52,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:18:52,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:18:52,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:18:52,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-02 09:18:52,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-02 09:18:52,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-02 09:18:52,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-02 09:18:52,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:18:52,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:18:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:18:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:18:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-02 09:18:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:18:52,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:18:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:18:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:18:52,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:18:52,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:18:52,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-02 09:18:52,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:18:52,668 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:18:52,790 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:18:52,792 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:18:53,096 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:18:53,097 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:18:53,278 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:18:53,279 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-02 09:18:53,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:18:53 BoogieIcfgContainer [2024-02-02 09:18:53,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:18:53,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:18:53,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:18:53,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:18:53,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:50" (1/4) ... [2024-02-02 09:18:53,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf98d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:18:53, skipping insertion in model container [2024-02-02 09:18:53,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:18:52" (2/4) ... [2024-02-02 09:18:53,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:18:53, skipping insertion in model container [2024-02-02 09:18:53,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:52" (3/4) ... [2024-02-02 09:18:53,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bf98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:18:53, skipping insertion in model container [2024-02-02 09:18:53,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:18:53" (4/4) ... [2024-02-02 09:18:53,290 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-02-02 09:18:53,303 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:18:53,303 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-02-02 09:18:53,304 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:18:53,392 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-02 09:18:53,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 103 transitions, 234 flow [2024-02-02 09:18:53,502 INFO L124 PetriNetUnfolderBase]: 4/99 cut-off events. [2024-02-02 09:18:53,503 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-02 09:18:53,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 99 events. 4/99 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 324 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-02-02 09:18:53,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 103 transitions, 234 flow [2024-02-02 09:18:53,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 98 transitions, 220 flow [2024-02-02 09:18:53,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:18:53,525 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;@2f33eac0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:18:53,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-02-02 09:18:53,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:18:53,529 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:18:53,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:18:53,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:53,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:18:53,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:18:53,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 13293, now seen corresponding path program 1 times [2024-02-02 09:18:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393657746] [2024-02-02 09:18:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393657746] [2024-02-02 09:18:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393657746] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:18:54,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:18:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:18:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257799771] [2024-02-02 09:18:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:18:54,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:18:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:18:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:18:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 103 [2024-02-02 09:18:54,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:18:54,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:54,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 103 [2024-02-02 09:18:54,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:58,683 INFO L124 PetriNetUnfolderBase]: 44633/67988 cut-off events. [2024-02-02 09:18:58,684 INFO L125 PetriNetUnfolderBase]: For 2106/2106 co-relation queries the response was YES. [2024-02-02 09:18:58,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126158 conditions, 67988 events. 44633/67988 cut-off events. For 2106/2106 co-relation queries the response was YES. Maximal size of possible extension queue 3418. Compared 556809 event pairs, 34013 based on Foata normal form. 0/53432 useless extension candidates. Maximal degree in co-relation 115550. Up to 56263 conditions per place. [2024-02-02 09:18:59,287 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 53 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2024-02-02 09:18:59,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 97 transitions, 328 flow [2024-02-02 09:18:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:18:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:18:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-02-02 09:18:59,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627831715210356 [2024-02-02 09:18:59,299 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 220 flow. Second operand 3 states and 194 transitions. [2024-02-02 09:18:59,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 97 transitions, 328 flow [2024-02-02 09:18:59,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 312 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-02 09:18:59,357 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 206 flow [2024-02-02 09:18:59,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, 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-02-02 09:18:59,361 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -7 predicate places. [2024-02-02 09:18:59,362 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 206 flow [2024-02-02 09:18:59,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:18:59,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:59,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:18:59,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:18:59,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:18:59,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash 412473, now seen corresponding path program 1 times [2024-02-02 09:18:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996024463] [2024-02-02 09:18:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996024463] [2024-02-02 09:18:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996024463] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:18:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:18:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:18:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458266870] [2024-02-02 09:18:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:18:59,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:18:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:18:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:18:59,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 103 [2024-02-02 09:18:59,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:18:59,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:59,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 103 [2024-02-02 09:18:59,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:02,759 INFO L124 PetriNetUnfolderBase]: 44633/67987 cut-off events. [2024-02-02 09:19:02,759 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-02-02 09:19:02,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124912 conditions, 67987 events. 44633/67987 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 3418. Compared 556638 event pairs, 34013 based on Foata normal form. 0/53432 useless extension candidates. Maximal degree in co-relation 124903. Up to 56261 conditions per place. [2024-02-02 09:19:03,138 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 52 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-02-02 09:19:03,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 312 flow [2024-02-02 09:19:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2024-02-02 09:19:03,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6343042071197411 [2024-02-02 09:19:03,140 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 206 flow. Second operand 3 states and 196 transitions. [2024-02-02 09:19:03,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 312 flow [2024-02-02 09:19:03,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:03,143 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 204 flow [2024-02-02 09:19:03,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, 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-02-02 09:19:03,144 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -8 predicate places. [2024-02-02 09:19:03,144 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 204 flow [2024-02-02 09:19:03,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:03,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:03,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:19:03,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:19:03,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:03,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash 12787095, now seen corresponding path program 1 times [2024-02-02 09:19:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:03,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302551540] [2024-02-02 09:19:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302551540] [2024-02-02 09:19:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302551540] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036925791] [2024-02-02 09:19:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:03,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 103 [2024-02-02 09:19:03,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:03,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:03,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 103 [2024-02-02 09:19:03,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:06,629 INFO L124 PetriNetUnfolderBase]: 44633/67986 cut-off events. [2024-02-02 09:19:06,630 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-02-02 09:19:06,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124910 conditions, 67986 events. 44633/67986 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 3418. Compared 556589 event pairs, 34013 based on Foata normal form. 0/53432 useless extension candidates. Maximal degree in co-relation 124899. Up to 56259 conditions per place. [2024-02-02 09:19:07,043 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 51 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-02-02 09:19:07,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 308 flow [2024-02-02 09:19:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-02-02 09:19:07,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6407766990291263 [2024-02-02 09:19:07,047 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 204 flow. Second operand 3 states and 198 transitions. [2024-02-02 09:19:07,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 308 flow [2024-02-02 09:19:07,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:07,049 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 202 flow [2024-02-02 09:19:07,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, 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-02-02 09:19:07,050 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -9 predicate places. [2024-02-02 09:19:07,050 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 202 flow [2024-02-02 09:19:07,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:07,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:07,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:19:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:19:07,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:07,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash 396400406, now seen corresponding path program 1 times [2024-02-02 09:19:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708021584] [2024-02-02 09:19:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:07,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708021584] [2024-02-02 09:19:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708021584] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:07,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099289347] [2024-02-02 09:19:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:07,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:07,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:07,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 103 [2024-02-02 09:19:07,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:07,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:07,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 103 [2024-02-02 09:19:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:10,378 INFO L124 PetriNetUnfolderBase]: 44633/67985 cut-off events. [2024-02-02 09:19:10,378 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-02-02 09:19:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124908 conditions, 67985 events. 44633/67985 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 3418. Compared 556789 event pairs, 34013 based on Foata normal form. 0/53432 useless extension candidates. Maximal degree in co-relation 124895. Up to 56257 conditions per place. [2024-02-02 09:19:10,810 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 50 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-02-02 09:19:10,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 304 flow [2024-02-02 09:19:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2024-02-02 09:19:10,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472491909385113 [2024-02-02 09:19:10,814 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 202 flow. Second operand 3 states and 200 transitions. [2024-02-02 09:19:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 304 flow [2024-02-02 09:19:10,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:10,818 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 200 flow [2024-02-02 09:19:10,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, 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-02-02 09:19:10,819 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2024-02-02 09:19:10,821 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 200 flow [2024-02-02 09:19:10,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:10,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:10,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:19:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:19:10,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:10,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -596488858, now seen corresponding path program 1 times [2024-02-02 09:19:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962515286] [2024-02-02 09:19:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962515286] [2024-02-02 09:19:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962515286] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:10,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:10,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930523344] [2024-02-02 09:19:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:10,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 103 [2024-02-02 09:19:10,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:10,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:10,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 103 [2024-02-02 09:19:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:14,565 INFO L124 PetriNetUnfolderBase]: 46532/70840 cut-off events. [2024-02-02 09:19:14,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:14,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130917 conditions, 70840 events. 46532/70840 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3436. Compared 583113 event pairs, 27503 based on Foata normal form. 0/57279 useless extension candidates. Maximal degree in co-relation 130902. Up to 45759 conditions per place. [2024-02-02 09:19:15,013 INFO L140 encePairwiseOnDemand]: 96/103 looper letters, 74 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-02-02 09:19:15,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 405 flow [2024-02-02 09:19:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2024-02-02 09:19:15,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7378640776699029 [2024-02-02 09:19:15,016 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 200 flow. Second operand 3 states and 228 transitions. [2024-02-02 09:19:15,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 405 flow [2024-02-02 09:19:15,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 118 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:15,018 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 209 flow [2024-02-02 09:19:15,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-02-02 09:19:15,019 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2024-02-02 09:19:15,019 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 209 flow [2024-02-02 09:19:15,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:15,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:15,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:15,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:19:15,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:15,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1719312309, now seen corresponding path program 1 times [2024-02-02 09:19:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367854542] [2024-02-02 09:19:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367854542] [2024-02-02 09:19:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367854542] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:19:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599311087] [2024-02-02 09:19:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:15,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:15,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:15,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:15,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 103 [2024-02-02 09:19:15,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:15,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:15,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 103 [2024-02-02 09:19:15,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:16,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 58#L97-4true, 127#true]) [2024-02-02 09:19:16,793 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-02-02 09:19:16,793 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:16,793 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-02 09:19:16,793 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:16,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 22#L98-1true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 127#true]) [2024-02-02 09:19:16,996 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:16,996 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:16,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:16,996 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 77#L38true, 67#L72true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,399 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,400 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L60-4-->L61: Formula: (< (mod v_~x3~0_2 4294967296) (mod v_~n~0_8 4294967296)) InVars {~x3~0=v_~x3~0_2, ~n~0=v_~n~0_8} OutVars{~x3~0=v_~x3~0_2, ~n~0=v_~n~0_8} AuxVars[] AssignedVars[][48], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 58#L97-4true, 127#true]) [2024-02-02 09:19:17,411 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,411 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:17,411 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-02 09:19:17,411 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 77#L38true, 67#L72true, 22#L98-1true, 127#true]) [2024-02-02 09:19:17,568 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,568 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,568 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,568 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 22#L98-1true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 127#true]) [2024-02-02 09:19:17,571 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,571 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,571 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,571 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 6#$Ultimate##0true, 50#L60-5true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 58#L97-4true, 127#true]) [2024-02-02 09:19:17,576 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,576 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-02 09:19:17,577 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:17,577 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 20#L38-5true, 67#L72true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,697 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,697 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,698 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,698 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 77#L38true, 67#L72true, 50#L60-5true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,709 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,709 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,709 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,709 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 6#$Ultimate##0true, 50#L60-5true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 22#L98-1true, 127#true]) [2024-02-02 09:19:17,713 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,713 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,714 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,714 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 58#L97-4true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:17,714 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,714 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:17,714 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,715 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:17,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 63#L40true, 67#L72true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,778 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,778 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:17,778 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,778 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:17,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 20#L38-5true, 67#L72true, 22#L98-1true, 127#true]) [2024-02-02 09:19:17,837 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:17,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:17,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 77#L38true, 67#L72true, 50#L60-5true, 22#L98-1true, 127#true]) [2024-02-02 09:19:17,844 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 77#L38true, 67#L72true, 58#L97-4true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:17,844 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,844 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,845 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 6#$Ultimate##0true, 22#L98-1true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:17,847 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,847 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,847 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:17,847 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:17,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 58#L97-4true, 127#true, 68#L41true]) [2024-02-02 09:19:17,892 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:17,892 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:17,892 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:17,893 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:17,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 63#L40true, 22#L98-1true, 127#true]) [2024-02-02 09:19:17,901 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:17,902 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:17,902 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:17,902 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:17,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L38-5true, 67#L72true, 50#L60-5true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,947 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,948 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,948 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,948 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 77#L38true, 67#L72true, 22#L98-1true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:17,951 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,951 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,951 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-02-02 09:19:17,951 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-02-02 09:19:17,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 28#L42true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,988 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:17,988 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,988 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:17,988 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 22#L98-1true, 127#true, 68#L41true]) [2024-02-02 09:19:17,989 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:17,989 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,989 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:17,989 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:17,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 63#L40true, 50#L60-5true, 58#L97-4true, 127#true]) [2024-02-02 09:19:17,996 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,996 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:17,996 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:17,996 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:18,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L38-5true, 67#L72true, 22#L98-1true, 50#L60-5true, 127#true]) [2024-02-02 09:19:18,023 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:18,023 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:18,023 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:18,023 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:18,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L38-5true, 67#L72true, 58#L97-4true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,024 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:18,024 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:18,024 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:18,024 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:18,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 58#L97-4true, 127#true]) [2024-02-02 09:19:18,026 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,026 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:18,026 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-02 09:19:18,027 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,027 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 28#L42true, 67#L72true, 22#L98-1true, 127#true]) [2024-02-02 09:19:18,052 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,052 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,052 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,052 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 58#L97-4true, 45#L38-3true, 127#true]) [2024-02-02 09:19:18,054 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,054 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,054 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,054 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 50#L60-5true, 58#L97-4true, 127#true, 68#L41true]) [2024-02-02 09:19:18,055 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,055 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,055 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,056 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 63#L40true, 22#L98-1true, 50#L60-5true, 127#true]) [2024-02-02 09:19:18,059 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 63#L40true, 67#L72true, 58#L97-4true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,060 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,060 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,060 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,060 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L38-5true, 67#L72true, 22#L98-1true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,078 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,078 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:18,079 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,079 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:18,081 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 22#L98-1true, 127#true]) [2024-02-02 09:19:18,081 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:18,081 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,081 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:18,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 22#L98-1true, 45#L38-3true, 127#true]) [2024-02-02 09:19:18,352 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,352 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,352 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,352 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 28#L42true, 50#L60-5true, 58#L97-4true, 127#true]) [2024-02-02 09:19:18,353 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,354 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 22#L98-1true, 50#L60-5true, 127#true, 68#L41true]) [2024-02-02 09:19:18,355 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 58#L97-4true, 127#true, 105#thread3EXITtrue, 68#L41true]) [2024-02-02 09:19:18,355 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,355 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 63#L40true, 22#L98-1true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,375 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,375 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,375 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:18,375 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:18,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 28#L42true, 67#L72true, 50#L60-5true, 22#L98-1true, 127#true]) [2024-02-02 09:19:18,445 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,445 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,445 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,445 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 50#L60-5true, 58#L97-4true, 45#L38-3true, 127#true]) [2024-02-02 09:19:18,446 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,446 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 28#L42true, 67#L72true, 58#L97-4true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,447 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 22#L98-1true, 105#thread3EXITtrue, 127#true, 68#L41true]) [2024-02-02 09:19:18,448 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,448 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,448 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:18,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:18,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 50#L60-5true, 22#L98-1true, 45#L38-3true, 127#true]) [2024-02-02 09:19:18,465 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 28#L42true, 67#L72true, 22#L98-1true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,466 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,466 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 58#L97-4true, 45#L38-3true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,467 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,467 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-02-02 09:19:18,467 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,467 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:18,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L71-4-->L72: Formula: (< (mod v_~x4~0_2 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_2} AuxVars[] AssignedVars[][66], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 67#L72true, 22#L98-1true, 45#L38-3true, 127#true, 105#thread3EXITtrue]) [2024-02-02 09:19:18,476 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-02-02 09:19:18,477 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-02-02 09:19:18,477 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-02-02 09:19:18,477 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-02-02 09:19:18,487 INFO L124 PetriNetUnfolderBase]: 34735/55573 cut-off events. [2024-02-02 09:19:18,487 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2024-02-02 09:19:18,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101294 conditions, 55573 events. 34735/55573 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 2840. Compared 477421 event pairs, 19993 based on Foata normal form. 2080/53654 useless extension candidates. Maximal degree in co-relation 81063. Up to 38699 conditions per place. [2024-02-02 09:19:18,831 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 70 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-02-02 09:19:18,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 111 transitions, 392 flow [2024-02-02 09:19:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:19:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:19:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2024-02-02 09:19:18,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6577669902912622 [2024-02-02 09:19:18,833 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 209 flow. Second operand 4 states and 271 transitions. [2024-02-02 09:19:18,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 111 transitions, 392 flow [2024-02-02 09:19:18,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:18,867 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 193 flow [2024-02-02 09:19:18,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2024-02-02 09:19:18,867 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -16 predicate places. [2024-02-02 09:19:18,867 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 193 flow [2024-02-02 09:19:18,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:18,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:19:18,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:18,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1300595827, now seen corresponding path program 1 times [2024-02-02 09:19:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652677848] [2024-02-02 09:19:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:18,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:18,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652677848] [2024-02-02 09:19:18,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652677848] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:18,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:19:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49087947] [2024-02-02 09:19:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:18,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:18,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 103 [2024-02-02 09:19:18,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:18,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:18,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 103 [2024-02-02 09:19:18,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:20,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 6#$Ultimate##0true, 133#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0)), 22#L98-1true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:20,833 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-02 09:19:20,833 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:20,833 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-02 09:19:20,833 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:21,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 20#L38-5true, 67#L72true, 22#L98-1true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,066 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-02-02 09:19:21,066 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-02-02 09:19:21,066 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-02 09:19:21,066 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-02 09:19:21,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 58#L97-4true, 68#L41true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,097 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:21,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-02 09:19:21,097 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:21,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:21,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 63#L40true, 67#L72true, 22#L98-1true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,098 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-02-02 09:19:21,098 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-02-02 09:19:21,098 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-02 09:19:21,098 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-02 09:19:21,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 22#L98-1true, 68#L41true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,133 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:21,133 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:21,133 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:21,133 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:21,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 28#L42true, 58#L97-4true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,134 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-02-02 09:19:21,134 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-02-02 09:19:21,134 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-02-02 09:19:21,134 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-02-02 09:19:21,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 28#L42true, 22#L98-1true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,156 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:21,156 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:21,156 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:21,156 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:21,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [5#L50true, 136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 58#L97-4true, 45#L38-3true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,157 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-02-02 09:19:21,157 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-02 09:19:21,157 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-02 09:19:21,157 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-02-02 09:19:21,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([480] L49-4-->L50: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][28], [136#(and (= |thread1Thread1of1ForFork0_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork0_~_argptr.base 0) (= |thread1Thread1of1ForFork0_#in~_argptr.base| 0) (= thread1Thread1of1ForFork0_~_argptr.offset 0)), 5#L50true, Black: 129#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 101#L61true, 67#L72true, 22#L98-1true, 45#L38-3true, 142#(and (= |thread2Thread1of1ForFork2_#in~_argptr.base| 0) (= thread2Thread1of1ForFork2_~_argptr.base 0) (= 0 |thread2Thread1of1ForFork2_#in~_argptr.offset|) (= thread2Thread1of1ForFork2_~_argptr.offset 0))]) [2024-02-02 09:19:21,169 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-02-02 09:19:21,169 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-02-02 09:19:21,169 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-02-02 09:19:21,169 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-02 09:19:21,180 INFO L124 PetriNetUnfolderBase]: 31011/43951 cut-off events. [2024-02-02 09:19:21,180 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2024-02-02 09:19:21,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84541 conditions, 43951 events. 31011/43951 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 2163. Compared 315045 event pairs, 3771 based on Foata normal form. 2126/44363 useless extension candidates. Maximal degree in co-relation 84518. Up to 34669 conditions per place. [2024-02-02 09:19:21,436 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 76 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-02-02 09:19:21,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 110 transitions, 400 flow [2024-02-02 09:19:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:19:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:19:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2024-02-02 09:19:21,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723300970873787 [2024-02-02 09:19:21,438 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 193 flow. Second operand 4 states and 277 transitions. [2024-02-02 09:19:21,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 110 transitions, 400 flow [2024-02-02 09:19:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 110 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:21,440 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 180 flow [2024-02-02 09:19:21,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2024-02-02 09:19:21,441 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -22 predicate places. [2024-02-02 09:19:21,441 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 180 flow [2024-02-02 09:19:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:21,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:21,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:19:21,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-02-02 09:19:21,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1303295759, now seen corresponding path program 1 times [2024-02-02 09:19:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024986039] [2024-02-02 09:19:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:21,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:19:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:21,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:19:21,473 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:19:21,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 68 remaining) [2024-02-02 09:19:21,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 68 remaining) [2024-02-02 09:19:21,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 68 remaining) [2024-02-02 09:19:21,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 68 remaining) [2024-02-02 09:19:21,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 68 remaining) [2024-02-02 09:19:21,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 68 remaining) [2024-02-02 09:19:21,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 68 remaining) [2024-02-02 09:19:21,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (39 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 68 remaining) [2024-02-02 09:19:21,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 68 remaining) [2024-02-02 09:19:21,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 68 remaining) [2024-02-02 09:19:21,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 68 remaining) [2024-02-02 09:19:21,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 68 remaining) [2024-02-02 09:19:21,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 68 remaining) [2024-02-02 09:19:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:19:21,484 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:21,489 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:19:21,489 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:19:21,505 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-02-02 09:19:21,505 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-02-02 09:19:21,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:19:21 BasicIcfg [2024-02-02 09:19:21,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:19:21,506 INFO L158 Benchmark]: Toolchain (without parser) took 29421.76ms. Allocated memory was 138.4MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 80.6MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-02-02 09:19:21,507 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 138.4MB. Free memory was 102.0MB in the beginning and 102.0MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:21,507 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:21,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.10ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 80.6MB in the beginning and 152.8MB in the end (delta: -72.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,507 INFO L158 Benchmark]: Boogie Preprocessor took 48.36ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 147.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,508 INFO L158 Benchmark]: RCFGBuilder took 707.71ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 107.6MB in the end (delta: 40.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-02-02 09:19:21,508 INFO L158 Benchmark]: TraceAbstraction took 28222.67ms. Allocated memory was 182.5MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 106.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-02-02 09:19:21,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 138.4MB. Free memory was 102.0MB in the beginning and 102.0MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.10ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 80.6MB in the beginning and 152.8MB in the end (delta: -72.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.36ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 147.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.71ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 107.6MB in the end (delta: 40.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28222.67ms. Allocated memory was 182.5MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 106.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: 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; [L82] 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] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[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]]],BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L85] 0 x1 = __VERIFIER_nondet_uint() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L86] 0 x2 = __VERIFIER_nondet_uint() [L87] 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]]]]] [L87] 0 x3 = __VERIFIER_nondet_uint() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L88] 0 x4 = __VERIFIER_nondet_uint() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L89] 0 n = __VERIFIER_nondet_uint() [L92] CALL 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L32] COND FALSE 0 !(!cond) [L92] RET 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L94] 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] [L38] 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: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 42]: 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: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: 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: 53]: 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: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 96]: 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: 97]: 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: 95]: 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: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: 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, 174 locations, 68 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: 28.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 50 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 09:19:21,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE