/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:35:09,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:35:09,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:35:09,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:35:09,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:35:09,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:35:09,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:35:09,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:35:09,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:35:09,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:35:09,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:35:09,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:35:09,320 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:35:09,320 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:35:09,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:35:09,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:35:09,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:35:09,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:35:09,322 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:35:09,322 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:35:09,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:35:09,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:35:09,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:35:09,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:35:09,541 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:35:09,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-26 18:35:10,751 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b271fe99/00ca0acfc33e4de39b3d38b8bf7891f1/FLAG545365733 [2025-04-26 18:35:10,960 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:35:10,960 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-26 18:35:10,969 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b271fe99/00ca0acfc33e4de39b3d38b8bf7891f1/FLAG545365733 [2025-04-26 18:35:11,802 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b271fe99/00ca0acfc33e4de39b3d38b8bf7891f1 [2025-04-26 18:35:11,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:35:11,805 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:35:11,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:35:11,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:35:11,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:35:11,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:35:11" (1/1) ... [2025-04-26 18:35:11,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d64948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:11, skipping insertion in model container [2025-04-26 18:35:11,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:35:11" (1/1) ... [2025-04-26 18:35:11,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:35:12,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:35:12,069 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:35:12,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:35:12,137 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:35:12,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12 WrapperNode [2025-04-26 18:35:12,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:35:12,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:35:12,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:35:12,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:35:12,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,164 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-04-26 18:35:12,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:35:12,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:35:12,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:35:12,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:35:12,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:35:12,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:35:12,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:35:12,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:35:12,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (1/1) ... [2025-04-26 18:35:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:35:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:35:12,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:35:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-26 18:35:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:35:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 18:35:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 18:35:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-26 18:35:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:35:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:35:12,239 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:35:12,321 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:35:12,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:35:12,401 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:35:12,401 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:35:12,415 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:35:12,415 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:35:12,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:35:12 BoogieIcfgContainer [2025-04-26 18:35:12,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:35:12,416 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:35:12,416 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:35:12,421 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:35:12,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:35:12,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:35:11" (1/3) ... [2025-04-26 18:35:12,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e8a298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:35:12, skipping insertion in model container [2025-04-26 18:35:12,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:35:12,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:35:12" (2/3) ... [2025-04-26 18:35:12,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e8a298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:35:12, skipping insertion in model container [2025-04-26 18:35:12,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:35:12,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:35:12" (3/3) ... [2025-04-26 18:35:12,424 INFO L376 chiAutomizerObserver]: Analyzing ICFG thread-join-array-const.i [2025-04-26 18:35:12,470 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 18:35:12,503 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:35:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:35:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:35:12,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:35:12,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:35:12,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 117 flow [2025-04-26 18:35:12,597 INFO L116 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-04-26 18:35:12,599 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 18:35:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 72 events. 2/72 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-26 18:35:12,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 55 transitions, 117 flow [2025-04-26 18:35:12,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 55 transitions, 117 flow [2025-04-26 18:35:12,604 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 56 places, 55 transitions, 117 flow [2025-04-26 18:35:12,604 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 55 transitions, 117 flow [2025-04-26 18:35:12,629 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 301 states, 298 states have (on average 1.8187919463087248) internal successors, (in total 542), 300 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:12,630 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 301 states, 298 states have (on average 1.8187919463087248) internal successors, (in total 542), 300 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:12,632 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:35:12,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 579#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:12,715 WARN L140 AmpleReduction]: Number of pruned transitions: 106 [2025-04-26 18:35:12,715 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:35:12,715 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:35:12,715 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:74 [2025-04-26 18:35:12,715 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:96 [2025-04-26 18:35:12,715 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:35:12,715 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:35:12,715 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:35:12,716 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:12,722 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:35:12,722 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:35:12,722 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:35:12,722 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:35:12,722 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:35:12,722 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:35:12,722 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:35:12,722 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:35:12,724 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:12,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:35:12,737 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:12,737 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:12,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:12,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:12,744 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:35:12,745 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:12,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:35:12,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:12,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:12,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:12,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:12,760 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[100] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[120] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[71] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[84] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[74] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[115] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[92] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[121] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[81] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[112] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[114] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[111] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[94] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[122] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[77] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[109] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[72] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[113] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[136] L693-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre3#1_7| v_threadThread1of1ForFork0_thidvar0_2) (= |v_threadThread1of1ForFork0_#in~arg.base_4| 0) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_7|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_6|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_7|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|, threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_8|, threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_6|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~ret0, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base, threadThread1of1ForFork0_#t~nondet1, threadThread1of1ForFork0_#t~ret2]" "[124] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of1ForFork0_~arg.base_1 |v_threadThread1of1ForFork0_#in~arg.base_1|) (= |v_threadThread1of1ForFork0_#in~arg.offset_1| v_threadThread1of1ForFork0_~arg.offset_1)) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_1|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_1|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_1|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_1, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_1, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset]" "[125] L684-->L684-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#data_mutex~0.base_15|))) (and (= (select .cse0 |v_~#data_mutex~0.offset_15|) 0) (= (store |v_#pthreadsMutex_18| |v_~#data_mutex~0.base_15| (store .cse0 |v_~#data_mutex~0.offset_15| 1)) |v_#pthreadsMutex_17|) (= |v_threadThread1of1ForFork0_#t~ret0_1| 0))) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_15|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_15|, threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret0]" "[126] L684-3-->L685: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~ret0]" "[127] L685-->L685-1: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~nondet1]" "[87] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[118] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[103] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[83] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[95] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[77] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[109] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[72] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[113] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[134] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L685-1-->L685-2: Formula: (= |v_threadThread1of1ForFork0_#t~nondet1_3| v_~data~0_3) InVars {threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_3|} OutVars{~data~0=v_~data~0_3, threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[~data~0]" "[129] L685-2-->L686: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~nondet1]" "[130] L686-->L686-3: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret2_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)))) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret2]" "[131] L686-3-->L687: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~ret2]" "[132] L687-->threadFINAL: Formula: (and (= |v_threadThread1of1ForFork0_#res.base_1| 0) (= |v_threadThread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_1|, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#res.offset]" [2025-04-26 18:35:12,760 INFO L754 eck$LassoCheckResult]: Loop: "[135] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:12,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 61607183, now seen corresponding path program 1 times [2025-04-26 18:35:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:12,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476156622] [2025-04-26 18:35:12,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:12,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:35:12,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:35:12,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:35:12,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:35:12,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:12,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 166, now seen corresponding path program 1 times [2025-04-26 18:35:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:12,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529055696] [2025-04-26 18:35:12,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:12,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:12,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:12,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:12,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:12,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:12,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:12,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1909822808, now seen corresponding path program 1 times [2025-04-26 18:35:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:12,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798792532] [2025-04-26 18:35:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:12,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:35:12,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:35:12,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:12,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:35:12,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:35:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:12,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:35:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:35:13,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:13,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:13,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:35:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:35:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:13,672 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:35:13,687 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:35:13,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:35:13,698 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:35:13,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:35:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:35:13,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:35:13,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 18:35:13,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 150 flow [2025-04-26 18:35:13,741 INFO L116 PetriNetUnfolderBase]: 4/126 cut-off events. [2025-04-26 18:35:13,742 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 18:35:13,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 126 events. 4/126 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 257 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2025-04-26 18:35:13,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 67 transitions, 150 flow [2025-04-26 18:35:13,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 150 flow [2025-04-26 18:35:13,743 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 69 places, 67 transitions, 150 flow [2025-04-26 18:35:13,743 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 67 transitions, 150 flow [2025-04-26 18:35:13,814 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3403 states, 3398 states have (on average 2.6827545615067687) internal successors, (in total 9116), 3402 states have internal predecessors, (9116), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:13,821 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 3403 states, 3398 states have (on average 2.6827545615067687) internal successors, (in total 9116), 3402 states have internal predecessors, (9116), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:13,822 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:35:13,907 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6372#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:13,918 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3096#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:13,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6400#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 18:35:13,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3526#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 18:35:13,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2462#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:13,991 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3264#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:13,991 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2554#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:13,992 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1674#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:14,002 WARN L140 AmpleReduction]: Number of pruned transitions: 1480 [2025-04-26 18:35:14,002 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 8 [2025-04-26 18:35:14,002 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 8 [2025-04-26 18:35:14,002 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:272 [2025-04-26 18:35:14,002 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:894 [2025-04-26 18:35:14,002 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:35:14,002 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:35:14,002 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:35:14,004 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:14,004 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:35:14,004 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:35:14,004 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:35:14,004 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:35:14,004 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:35:14,004 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:35:14,004 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:35:14,004 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:35:14,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:14,017 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 18:35:14,018 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:14,018 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:14,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:14,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:14,018 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:35:14,020 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:14,030 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 18:35:14,030 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:14,030 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:14,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:14,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:14,031 INFO L752 eck$LassoCheckResult]: Stem: "[182] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[193] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[213] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[164] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[177] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[167] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[208] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[185] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[214] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[174] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[205] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[207] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[204] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[187] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[215] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[239] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_13|) (= |v_threadThread1of2ForFork0_#in~arg.base_4| 0) (= |v_threadThread1of2ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_13|} OutVars{threadThread1of2ForFork0_~arg.base=v_threadThread1of2ForFork0_~arg.base_4, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_4|, threadThread1of2ForFork0_#t~ret2=|v_threadThread1of2ForFork0_#t~ret2_6|, threadThread1of2ForFork0_#t~nondet1=|v_threadThread1of2ForFork0_#t~nondet1_8|, threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_4|, threadThread1of2ForFork0_~arg.offset=v_threadThread1of2ForFork0_~arg.offset_4, threadThread1of2ForFork0_#t~ret0=|v_threadThread1of2ForFork0_#t~ret0_6|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_4|, threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_13|} AuxVars[] AssignedVars[threadThread1of2ForFork0_~arg.base, threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#t~ret2, threadThread1of2ForFork0_#t~nondet1, threadThread1of2ForFork0_thidvar0, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_~arg.offset, threadThread1of2ForFork0_#t~ret0, threadThread1of2ForFork0_#in~arg.base, threadThread1of2ForFork0_#in~arg.offset]" "[217] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of2ForFork0_~arg.offset_1 |v_threadThread1of2ForFork0_#in~arg.offset_1|) (= v_threadThread1of2ForFork0_~arg.base_1 |v_threadThread1of2ForFork0_#in~arg.base_1|)) InVars {threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_1|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_1|} OutVars{threadThread1of2ForFork0_~arg.base=v_threadThread1of2ForFork0_~arg.base_1, threadThread1of2ForFork0_~arg.offset=v_threadThread1of2ForFork0_~arg.offset_1, threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_1|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[threadThread1of2ForFork0_~arg.base, threadThread1of2ForFork0_~arg.offset]" "[180] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[211] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[196] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[176] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[188] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[240] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of2ForFork0_#in~arg.base_4| 0) (= v_threadThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_15|) (= |v_threadThread2of2ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} OutVars{threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_4|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_8|, threadThread2of2ForFork0_#t~ret2=|v_threadThread2of2ForFork0_#t~ret2_6|, threadThread2of2ForFork0_~arg.offset=v_threadThread2of2ForFork0_~arg.offset_4, threadThread2of2ForFork0_#t~ret0=|v_threadThread2of2ForFork0_#t~ret0_6|, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_4|, threadThread2of2ForFork0_~arg.base=v_threadThread2of2ForFork0_~arg.base_4, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_4|, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[threadThread2of2ForFork0_#in~arg.base, threadThread2of2ForFork0_#t~nondet1, threadThread2of2ForFork0_#t~ret2, threadThread2of2ForFork0_~arg.offset, threadThread2of2ForFork0_#t~ret0, threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_~arg.base, threadThread2of2ForFork0_thidvar0, threadThread2of2ForFork0_#in~arg.offset, threadThread2of2ForFork0_#res.base]" "[227] $Ultimate##0-->L684: Formula: (and (= v_threadThread2of2ForFork0_~arg.offset_1 |v_threadThread2of2ForFork0_#in~arg.offset_1|) (= |v_threadThread2of2ForFork0_#in~arg.base_1| v_threadThread2of2ForFork0_~arg.base_1)) InVars {threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_1|, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_1|} OutVars{threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_1|, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_1|, threadThread2of2ForFork0_~arg.offset=v_threadThread2of2ForFork0_~arg.offset_1, threadThread2of2ForFork0_~arg.base=v_threadThread2of2ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread2of2ForFork0_~arg.offset, threadThread2of2ForFork0_~arg.base]" "[180] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[211] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[196] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[176] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[188] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[237] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:14,031 INFO L754 eck$LassoCheckResult]: Loop: "[238] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:14,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -496369031, now seen corresponding path program 1 times [2025-04-26 18:35:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:14,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716872146] [2025-04-26 18:35:14,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:14,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:35:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:35:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:35:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:35:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:14,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash 269, now seen corresponding path program 1 times [2025-04-26 18:35:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:14,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130688878] [2025-04-26 18:35:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:14,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:14,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:14,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:14,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:14,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:14,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:14,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1792429461, now seen corresponding path program 1 times [2025-04-26 18:35:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:14,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711570637] [2025-04-26 18:35:14,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:14,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:35:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:35:14,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:35:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:35:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:14,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:35:14,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:35:14,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:14,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:35:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:35:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:14,717 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:35:14,729 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:35:14,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:35:14,738 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:35:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:35:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:35:14,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:35:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 18:35:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 185 flow [2025-04-26 18:35:14,785 INFO L116 PetriNetUnfolderBase]: 9/213 cut-off events. [2025-04-26 18:35:14,785 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-26 18:35:14,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 213 events. 9/213 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 547 event pairs, 1 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 133. Up to 12 conditions per place. [2025-04-26 18:35:14,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 79 transitions, 185 flow [2025-04-26 18:35:14,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 185 flow [2025-04-26 18:35:14,789 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 82 places, 79 transitions, 185 flow [2025-04-26 18:35:14,789 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 79 transitions, 185 flow [2025-04-26 18:35:15,599 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 39505 states, 39496 states have (on average 3.5422068057524814) internal successors, (in total 139903), 39504 states have internal predecessors, (139903), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:15,659 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 39505 states, 39496 states have (on average 3.5422068057524814) internal successors, (in total 139903), 39504 states have internal predecessors, (139903), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:15,659 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:35:15,779 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75125#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT, threadFINAL]true [2025-04-26 18:35:15,789 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 50629#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT, L686]true [2025-04-26 18:35:15,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75191#[threadEXIT, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:15,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 54045#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:15,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43595#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, threadEXIT]true [2025-04-26 18:35:15,920 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 50833#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, threadEXIT, L684]true [2025-04-26 18:35:15,921 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43713#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:15,921 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 32719#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT, L684]true [2025-04-26 18:35:15,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 52029#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 18:35:15,956 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37517#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684, L686]true [2025-04-26 18:35:15,986 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30219#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684]true [2025-04-26 18:35:16,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 52303#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 18:35:16,016 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37687#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686, L684]true [2025-04-26 18:35:16,016 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30321#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684]true [2025-04-26 18:35:16,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20471#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684, L684]true [2025-04-26 18:35:16,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75465#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadFINAL]true [2025-04-26 18:35:16,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55937#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 18:35:16,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 45597#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT, L685-1]true [2025-04-26 18:35:16,157 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30853#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L685-1]true [2025-04-26 18:35:16,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 56115#[threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:16,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 34589#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:16,182 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24045#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 18:35:16,218 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 45871#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:16,218 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31023#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1, L684]true [2025-04-26 18:35:16,219 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24147#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:16,219 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15631#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L684]true [2025-04-26 18:35:16,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 53447#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 18:35:16,264 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46525#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, threadEXIT]true [2025-04-26 18:35:16,264 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35483#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684, threadEXIT]true [2025-04-26 18:35:16,291 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 53563#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:16,292 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39323#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684, L686]true [2025-04-26 18:35:16,295 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31971#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:16,295 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 21893#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684, L686]true [2025-04-26 18:35:16,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46703#[threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:16,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 32039#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684]true [2025-04-26 18:35:16,341 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25119#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:16,341 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16419#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, L684]true [2025-04-26 18:35:16,365 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35757#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684]true [2025-04-26 18:35:16,365 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 22063#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684, L684]true [2025-04-26 18:35:16,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16521#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684]true [2025-04-26 18:35:16,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10255#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684, L684]true [2025-04-26 18:35:16,393 WARN L140 AmpleReduction]: Number of pruned transitions: 15037 [2025-04-26 18:35:16,393 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 41 [2025-04-26 18:35:16,393 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 41 [2025-04-26 18:35:16,394 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1097 [2025-04-26 18:35:16,394 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6542 [2025-04-26 18:35:16,394 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:35:16,394 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:35:16,394 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:35:16,401 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:16,401 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:35:16,401 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:35:16,401 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:35:16,401 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:35:16,401 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:35:16,401 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:35:16,401 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:35:16,401 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:35:16,407 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:16,484 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 42 [2025-04-26 18:35:16,484 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:16,484 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:16,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:16,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:16,485 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:35:16,491 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:16,562 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 42 [2025-04-26 18:35:16,562 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:16,562 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:16,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:16,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:16,564 INFO L752 eck$LassoCheckResult]: Stem: "[359] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[370] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[390] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[341] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[354] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[344] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[385] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[362] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[391] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[351] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[382] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[384] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[381] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[364] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[392] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[426] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread1of3ForFork0_#in~arg.offset_4| 0) (= v_threadThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_23|) (= |v_threadThread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} OutVars{threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_4|, threadThread1of3ForFork0_#t~nondet1=|v_threadThread1of3ForFork0_#t~nondet1_8|, threadThread1of3ForFork0_#t~ret2=|v_threadThread1of3ForFork0_#t~ret2_6|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_4|, threadThread1of3ForFork0_#t~ret0=|v_threadThread1of3ForFork0_#t~ret0_6|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_4|, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2, threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_4|, threadThread1of3ForFork0_~arg.base=v_threadThread1of3ForFork0_~arg.base_4, threadThread1of3ForFork0_~arg.offset=v_threadThread1of3ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} AuxVars[] AssignedVars[threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#t~nondet1, threadThread1of3ForFork0_#t~ret2, threadThread1of3ForFork0_#in~arg.base, threadThread1of3ForFork0_#t~ret0, threadThread1of3ForFork0_#res.offset, threadThread1of3ForFork0_thidvar0, threadThread1of3ForFork0_#in~arg.offset, threadThread1of3ForFork0_~arg.base, threadThread1of3ForFork0_~arg.offset]" "[414] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of3ForFork0_~arg.offset_1 |v_threadThread1of3ForFork0_#in~arg.offset_1|) (= v_threadThread1of3ForFork0_~arg.base_1 |v_threadThread1of3ForFork0_#in~arg.base_1|)) InVars {threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_1|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_1|} OutVars{threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_1|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_1|, threadThread1of3ForFork0_~arg.base=v_threadThread1of3ForFork0_~arg.base_1, threadThread1of3ForFork0_~arg.offset=v_threadThread1of3ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread1of3ForFork0_~arg.base, threadThread1of3ForFork0_~arg.offset]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[427] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of3ForFork0_#in~arg.offset_4| 0) (= |v_threadThread2of3ForFork0_#in~arg.base_4| 0) (= v_threadThread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_25|)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, threadThread2of3ForFork0_#t~nondet1=|v_threadThread2of3ForFork0_#t~nondet1_8|, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_4|, threadThread2of3ForFork0_#res.offset=|v_threadThread2of3ForFork0_#res.offset_4|, threadThread2of3ForFork0_#t~ret0=|v_threadThread2of3ForFork0_#t~ret0_6|, threadThread2of3ForFork0_#res.base=|v_threadThread2of3ForFork0_#res.base_4|, threadThread2of3ForFork0_#t~ret2=|v_threadThread2of3ForFork0_#t~ret2_6|, threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_4|, threadThread2of3ForFork0_~arg.offset=v_threadThread2of3ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, threadThread2of3ForFork0_~arg.base=v_threadThread2of3ForFork0_~arg.base_4} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0, threadThread2of3ForFork0_#t~nondet1, threadThread2of3ForFork0_#in~arg.offset, threadThread2of3ForFork0_#res.offset, threadThread2of3ForFork0_#t~ret0, threadThread2of3ForFork0_#res.base, threadThread2of3ForFork0_#t~ret2, threadThread2of3ForFork0_#in~arg.base, threadThread2of3ForFork0_~arg.offset, threadThread2of3ForFork0_~arg.base]" "[404] $Ultimate##0-->L684: Formula: (and (= |v_threadThread2of3ForFork0_#in~arg.base_1| v_threadThread2of3ForFork0_~arg.base_1) (= v_threadThread2of3ForFork0_~arg.offset_1 |v_threadThread2of3ForFork0_#in~arg.offset_1|)) InVars {threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_1|, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_1|} OutVars{threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_1|, threadThread2of3ForFork0_~arg.offset=v_threadThread2of3ForFork0_~arg.offset_1, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_1|, threadThread2of3ForFork0_~arg.base=v_threadThread2of3ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread2of3ForFork0_~arg.offset, threadThread2of3ForFork0_~arg.base]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[428] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread3of3ForFork0_#in~arg.base_4| 0) (= v_threadThread3of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_27|) (= |v_threadThread3of3ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|} OutVars{threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_4|, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_4|, threadThread3of3ForFork0_#t~ret2=|v_threadThread3of3ForFork0_#t~ret2_6|, threadThread3of3ForFork0_~arg.offset=v_threadThread3of3ForFork0_~arg.offset_4, threadThread3of3ForFork0_#t~ret0=|v_threadThread3of3ForFork0_#t~ret0_6|, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_4|, threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_4|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_8|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, threadThread3of3ForFork0_~arg.base=v_threadThread3of3ForFork0_~arg.base_4} AuxVars[] AssignedVars[threadThread3of3ForFork0_#in~arg.offset, threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#t~ret2, threadThread3of3ForFork0_~arg.offset, threadThread3of3ForFork0_#t~ret0, threadThread3of3ForFork0_thidvar0, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#in~arg.base, threadThread3of3ForFork0_#t~nondet1, threadThread3of3ForFork0_~arg.base]" "[394] $Ultimate##0-->L684: Formula: (and (= v_threadThread3of3ForFork0_~arg.offset_1 |v_threadThread3of3ForFork0_#in~arg.offset_1|) (= v_threadThread3of3ForFork0_~arg.base_1 |v_threadThread3of3ForFork0_#in~arg.base_1|)) InVars {threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_1|, threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_1|} OutVars{threadThread3of3ForFork0_~arg.offset=v_threadThread3of3ForFork0_~arg.offset_1, threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_1|, threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_1|, threadThread3of3ForFork0_~arg.base=v_threadThread3of3ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread3of3ForFork0_~arg.offset, threadThread3of3ForFork0_~arg.base]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[424] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:16,564 INFO L754 eck$LassoCheckResult]: Loop: "[425] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:16,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash 330418100, now seen corresponding path program 1 times [2025-04-26 18:35:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:16,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805380699] [2025-04-26 18:35:16,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:35:16,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:35:16,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:16,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:35:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:35:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:16,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 456, now seen corresponding path program 1 times [2025-04-26 18:35:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:16,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816037816] [2025-04-26 18:35:16,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:16,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:16,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:16,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:16,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:16,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1653026933, now seen corresponding path program 1 times [2025-04-26 18:35:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:16,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669393627] [2025-04-26 18:35:16,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:16,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:35:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:35:16,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:16,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:35:16,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:35:16,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:16,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:16,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:17,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:35:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:35:17,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:17,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:17,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:35:17,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:35:17,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:17,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:17,535 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:35:17,548 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:35:17,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2025-04-26 18:35:17,558 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:35:17,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:35:17,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:35:17,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:35:17,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 18:35:17,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 222 flow [2025-04-26 18:35:17,625 INFO L116 PetriNetUnfolderBase]: 22/368 cut-off events. [2025-04-26 18:35:17,625 INFO L117 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2025-04-26 18:35:17,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 368 events. 22/368 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1307 event pairs, 6 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 232. Up to 32 conditions per place. [2025-04-26 18:35:17,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 222 flow [2025-04-26 18:35:17,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 91 transitions, 222 flow [2025-04-26 18:35:17,633 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 95 places, 91 transitions, 222 flow [2025-04-26 18:35:17,633 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 91 transitions, 222 flow [2025-04-26 18:35:28,451 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 460387 states, 460370 states have (on average 4.398522927210722) internal successors, (in total 2024948), 460386 states have internal predecessors, (2024948), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:29,236 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 460387 states, 460370 states have (on average 4.398522927210722) internal successors, (in total 2024948), 460386 states have internal predecessors, (2024948), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:29,237 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:35:29,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 890652#[threadEXIT, threadFINAL, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:29,437 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 715766#[threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 891696#[threadEXIT, threadFINAL, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,508 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 743560#[threadEXIT, L685-1, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,508 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 659766#[threadEXIT, L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,541 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 720748#[threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 662958#[threadEXIT, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 560706#[threadEXIT, L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,558 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 711956#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L686]true [2025-04-26 18:35:29,565 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 591046#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:29,605 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 520244#[L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,639 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 721072#[threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,640 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 596872#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:29,640 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 523782#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,640 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 408288#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,732 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 890498#[threadFINAL, threadEXIT, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,732 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 737272#[L685-1, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:29,733 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 653694#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:29,750 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 518214#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:29,776 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 744022#[L685-1, threadEXIT, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,776 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 557612#[L685-1, L685-1, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:29,777 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 443744#[L685-1, L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 663420#[L685-1, threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 523926#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 447084#[L685-1, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333208#[L685-1, L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,058 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 723252#[threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,058 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 666010#[L685-1, threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 564400#[L684, threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,104 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 723718#[threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:30,104 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 600598#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L686]true [2025-04-26 18:35:30,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 527840#[L685-1, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 412370#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,159 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 666716#[threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:30,159 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 528112#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, L686]true [2025-04-26 18:35:30,160 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 451382#[L685-1, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,160 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 337062#[L684, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 565500#[threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:30,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 413080#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:30,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 337500#[L685-1, L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 235460#[L684, L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,222 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 725110#[threadEXIT, L686, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,229 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 603556#[threadEXIT, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,295 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 531552#[threadEXIT, L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 726722#[threadEXIT, L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 604792#[threadEXIT, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,338 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 532350#[threadEXIT, L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,338 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416902#[threadEXIT, L684, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,380 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 602618#[L686, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,394 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 454410#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:30,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377782#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 604918#[L686, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,462 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 455820#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:30,462 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 378630#[L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,462 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 270514#[L684, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,656 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 530106#[L685-1, L686, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,664 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377352#[L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,672 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 304216#[L685-1, L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,698 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 532538#[L685-1, L686, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,698 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 378692#[L685-1, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,699 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 304988#[L685-1, L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,699 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 208358#[L685-1, L684, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 727004#[L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:30,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 605376#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 18:35:30,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 533080#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:30,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 417804#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:30,762 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 605502#[L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 456676#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 379562#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 271392#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:30,797 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 533268#[L686, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,798 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 379624#[L686, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,798 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 305906#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:30,798 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209124#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:30,815 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 418090#[L686, L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,815 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 271558#[L686, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,815 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209228#[L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:30,816 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 134850#[L684, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:30,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 890500#[threadEXIT, threadEXIT, threadEXIT, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 753958#[threadEXIT, L685-1, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,874 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 673798#[threadEXIT, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,882 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 538182#[threadEXIT, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 754902#[threadEXIT, L685-1, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 575392#[threadEXIT, L685-1, L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 462356#[threadEXIT, L685-1, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 675410#[threadEXIT, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 539418#[threadEXIT, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,912 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 463154#[threadEXIT, L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,912 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 348186#[threadEXIT, L685-1, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:30,928 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 537244#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,935 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 384642#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:30,949 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310978#[L685-1, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,972 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 539544#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,973 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 386052#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:30,973 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311826#[L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:30,973 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213720#[L685-1, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 753730#[L685-1, L685-1, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 573822#[L685-1, L685-1, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 460910#[L685-1, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,031 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310548#[L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,044 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 575580#[L685-1, L685-1, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,045 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 347532#[L685-1, L685-1, L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,045 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243488#[L685-1, L685-1, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 463342#[L685-1, L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311888#[L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 244260#[L685-1, L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160562#[L685-1, L684, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 675692#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 540002#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 18:35:31,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 463884#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349088#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,133 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 540128#[L685-1, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 386908#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 312758#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:31,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 214598#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:31,167 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 464072#[L685-1, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,168 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 312820#[L685-1, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,168 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 245178#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:31,168 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161328#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:31,196 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349374#[L685-1, L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,196 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 214764#[L685-1, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,196 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161432#[L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,196 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 101148#[L685-1, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,239 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 734468#[L684, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,240 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 680126#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:31,240 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 582658#[L684, threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 735066#[L684, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 617842#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 547538#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L686]true [2025-04-26 18:35:31,264 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 433950#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 681070#[L684, threadEXIT, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 547976#[L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 472858#[L684, L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:31,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 358604#[L684, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 584270#[L684, threadEXIT, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435186#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 359402#[L684, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 18:35:31,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 254638#[L684, threadEXIT, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 734314#[L684, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 616896#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 546546#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 433012#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,404 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 617968#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 472474#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 395820#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 286552#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 548102#[L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396382#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 322176#[L684, L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 222898#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435312#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287962#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 223746#[L684, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145610#[L684, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,474 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 679898#[L684, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,474 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 546458#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686]true [2025-04-26 18:35:31,474 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 471288#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,474 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 357158#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 547726#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686]true [2025-04-26 18:35:31,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 395882#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686]true [2025-04-26 18:35:31,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 321670#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 18:35:31,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 222468#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 18:35:31,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 473046#[L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 322238#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 18:35:31,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 253984#[L685-1, L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,498 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 168340#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,512 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 359590#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,512 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 223808#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 18:35:31,512 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169112#[L685-1, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,512 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 106546#[L684, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 18:35:31,532 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 584552#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,532 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435770#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 18:35:31,532 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 360132#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,532 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 255540#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 18:35:31,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435896#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288818#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L686]true [2025-04-26 18:35:31,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224678#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:31,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 146488#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 18:35:31,559 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 360320#[L684, threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,559 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224740#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,559 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 170030#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:31,559 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 107312#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 18:35:31,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 255826#[L684, L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:35:31,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 146654#[L684, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 18:35:31,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 107416#[L684, L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 65672#[L684, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 18:35:31,588 WARN L140 AmpleReduction]: Number of pruned transitions: 123629 [2025-04-26 18:35:31,588 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 186 [2025-04-26 18:35:31,588 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 18:35:31,588 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:4930 [2025-04-26 18:35:31,588 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:42109 [2025-04-26 18:35:31,588 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:35:31,588 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:35:31,588 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:35:31,648 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:31,649 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:35:31,649 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:35:31,649 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:35:31,649 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:35:31,649 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:35:31,649 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:35:31,649 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:35:31,649 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:35:31,693 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:31,983 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 187 [2025-04-26 18:35:31,983 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:31,983 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:31,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:31,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:31,984 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:35:32,025 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:32,372 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 187 [2025-04-26 18:35:32,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:35:32,372 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:35:32,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:35:32,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:35:32,374 INFO L752 eck$LassoCheckResult]: Stem: "[628] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[639] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[659] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[610] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[623] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[613] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[654] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[631] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[660] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[620] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[651] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[653] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[650] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[633] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[661] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[705] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_37|) (= |v_threadThread1of4ForFork0_#in~arg.offset_4| 0) (= |v_threadThread1of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|} OutVars{threadThread1of4ForFork0_#res.base=|v_threadThread1of4ForFork0_#res.base_4|, threadThread1of4ForFork0_~arg.offset=v_threadThread1of4ForFork0_~arg.offset_4, threadThread1of4ForFork0_#res.offset=|v_threadThread1of4ForFork0_#res.offset_4|, threadThread1of4ForFork0_#t~ret0=|v_threadThread1of4ForFork0_#t~ret0_6|, threadThread1of4ForFork0_~arg.base=v_threadThread1of4ForFork0_~arg.base_4, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2, threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_4|, threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_4|, threadThread1of4ForFork0_#t~ret2=|v_threadThread1of4ForFork0_#t~ret2_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|, threadThread1of4ForFork0_#t~nondet1=|v_threadThread1of4ForFork0_#t~nondet1_8|} AuxVars[] AssignedVars[threadThread1of4ForFork0_#res.base, threadThread1of4ForFork0_~arg.offset, threadThread1of4ForFork0_#res.offset, threadThread1of4ForFork0_#t~ret0, threadThread1of4ForFork0_~arg.base, threadThread1of4ForFork0_thidvar0, threadThread1of4ForFork0_#in~arg.offset, threadThread1of4ForFork0_#in~arg.base, threadThread1of4ForFork0_#t~ret2, threadThread1of4ForFork0_#t~nondet1]" "[673] $Ultimate##0-->L684: Formula: (and (= |v_threadThread1of4ForFork0_#in~arg.offset_1| v_threadThread1of4ForFork0_~arg.offset_1) (= v_threadThread1of4ForFork0_~arg.base_1 |v_threadThread1of4ForFork0_#in~arg.base_1|)) InVars {threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_1|, threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_1|} OutVars{threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_1|, threadThread1of4ForFork0_~arg.base=v_threadThread1of4ForFork0_~arg.base_1, threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_1|, threadThread1of4ForFork0_~arg.offset=v_threadThread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread1of4ForFork0_~arg.offset, threadThread1of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[706] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of4ForFork0_#in~arg.offset_4| 0) (= v_threadThread2of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_39|) (= 0 |v_threadThread2of4ForFork0_#in~arg.base_4|)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_39|} OutVars{threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_4|, threadThread2of4ForFork0_~arg.offset=v_threadThread2of4ForFork0_~arg.offset_4, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2, threadThread2of4ForFork0_#res.base=|v_threadThread2of4ForFork0_#res.base_4|, threadThread2of4ForFork0_#t~nondet1=|v_threadThread2of4ForFork0_#t~nondet1_8|, threadThread2of4ForFork0_#t~ret2=|v_threadThread2of4ForFork0_#t~ret2_6|, threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_4|, threadThread2of4ForFork0_~arg.base=v_threadThread2of4ForFork0_~arg.base_4, threadThread2of4ForFork0_#t~ret0=|v_threadThread2of4ForFork0_#t~ret0_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_39|, threadThread2of4ForFork0_#res.offset=|v_threadThread2of4ForFork0_#res.offset_4|} AuxVars[] AssignedVars[threadThread2of4ForFork0_#in~arg.offset, threadThread2of4ForFork0_~arg.offset, threadThread2of4ForFork0_thidvar0, threadThread2of4ForFork0_#res.base, threadThread2of4ForFork0_#t~nondet1, threadThread2of4ForFork0_#t~ret2, threadThread2of4ForFork0_#in~arg.base, threadThread2of4ForFork0_~arg.base, threadThread2of4ForFork0_#t~ret0, threadThread2of4ForFork0_#res.offset]" "[683] $Ultimate##0-->L684: Formula: (and (= v_threadThread2of4ForFork0_~arg.offset_1 |v_threadThread2of4ForFork0_#in~arg.offset_1|) (= v_threadThread2of4ForFork0_~arg.base_1 |v_threadThread2of4ForFork0_#in~arg.base_1|)) InVars {threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_1|, threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_1|} OutVars{threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_1|, threadThread2of4ForFork0_~arg.base=v_threadThread2of4ForFork0_~arg.base_1, threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_1|, threadThread2of4ForFork0_~arg.offset=v_threadThread2of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread2of4ForFork0_~arg.offset, threadThread2of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[707] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread3of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_41|) (= |v_threadThread3of4ForFork0_#in~arg.base_4| 0) (= |v_threadThread3of4ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_41|} OutVars{threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_4|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, threadThread3of4ForFork0_~arg.offset=v_threadThread3of4ForFork0_~arg.offset_4, threadThread3of4ForFork0_#res.base=|v_threadThread3of4ForFork0_#res.base_4|, threadThread3of4ForFork0_~arg.base=v_threadThread3of4ForFork0_~arg.base_4, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_4|, threadThread3of4ForFork0_#t~ret2=|v_threadThread3of4ForFork0_#t~ret2_6|, threadThread3of4ForFork0_#t~nondet1=|v_threadThread3of4ForFork0_#t~nondet1_8|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_41|, threadThread3of4ForFork0_#res.offset=|v_threadThread3of4ForFork0_#res.offset_4|, threadThread3of4ForFork0_#t~ret0=|v_threadThread3of4ForFork0_#t~ret0_6|} AuxVars[] AssignedVars[threadThread3of4ForFork0_#in~arg.offset, threadThread3of4ForFork0_thidvar0, threadThread3of4ForFork0_~arg.offset, threadThread3of4ForFork0_#res.base, threadThread3of4ForFork0_~arg.base, threadThread3of4ForFork0_#in~arg.base, threadThread3of4ForFork0_#t~ret2, threadThread3of4ForFork0_#t~nondet1, threadThread3of4ForFork0_#res.offset, threadThread3of4ForFork0_#t~ret0]" "[663] $Ultimate##0-->L684: Formula: (and (= |v_threadThread3of4ForFork0_#in~arg.base_1| v_threadThread3of4ForFork0_~arg.base_1) (= v_threadThread3of4ForFork0_~arg.offset_1 |v_threadThread3of4ForFork0_#in~arg.offset_1|)) InVars {threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_1|, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_1|} OutVars{threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_1|, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_1|, threadThread3of4ForFork0_~arg.offset=v_threadThread3of4ForFork0_~arg.offset_1, threadThread3of4ForFork0_~arg.base=v_threadThread3of4ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread3of4ForFork0_~arg.offset, threadThread3of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[708] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread4of4ForFork0_#in~arg.offset_4| 0) (= v_threadThread4of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_43|) (= |v_threadThread4of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_43|} OutVars{threadThread4of4ForFork0_#res.offset=|v_threadThread4of4ForFork0_#res.offset_4|, threadThread4of4ForFork0_#t~ret0=|v_threadThread4of4ForFork0_#t~ret0_6|, threadThread4of4ForFork0_~arg.base=v_threadThread4of4ForFork0_~arg.base_4, threadThread4of4ForFork0_#res.base=|v_threadThread4of4ForFork0_#res.base_4|, threadThread4of4ForFork0_#t~ret2=|v_threadThread4of4ForFork0_#t~ret2_6|, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_4|, threadThread4of4ForFork0_~arg.offset=v_threadThread4of4ForFork0_~arg.offset_4, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2, threadThread4of4ForFork0_#t~nondet1=|v_threadThread4of4ForFork0_#t~nondet1_8|, threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_43|} AuxVars[] AssignedVars[threadThread4of4ForFork0_#res.offset, threadThread4of4ForFork0_#t~ret0, threadThread4of4ForFork0_~arg.base, threadThread4of4ForFork0_#res.base, threadThread4of4ForFork0_#t~ret2, threadThread4of4ForFork0_#in~arg.base, threadThread4of4ForFork0_~arg.offset, threadThread4of4ForFork0_thidvar0, threadThread4of4ForFork0_#t~nondet1, threadThread4of4ForFork0_#in~arg.offset]" "[693] $Ultimate##0-->L684: Formula: (and (= v_threadThread4of4ForFork0_~arg.base_1 |v_threadThread4of4ForFork0_#in~arg.base_1|) (= |v_threadThread4of4ForFork0_#in~arg.offset_1| v_threadThread4of4ForFork0_~arg.offset_1)) InVars {threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_1|, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_1|} OutVars{threadThread4of4ForFork0_~arg.base=v_threadThread4of4ForFork0_~arg.base_1, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_1|, threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_1|, threadThread4of4ForFork0_~arg.offset=v_threadThread4of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread4of4ForFork0_~arg.base, threadThread4of4ForFork0_~arg.offset]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[703] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:32,374 INFO L754 eck$LassoCheckResult]: Loop: "[704] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:35:32,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1818448778, now seen corresponding path program 1 times [2025-04-26 18:35:32,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:32,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500673054] [2025-04-26 18:35:32,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:32,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 18:35:32,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 18:35:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:35:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:35:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:35:32,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500673054] [2025-04-26 18:35:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500673054] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:35:32,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:35:32,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-26 18:35:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944122330] [2025-04-26 18:35:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:35:32,674 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:35:32,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:35:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 735, now seen corresponding path program 1 times [2025-04-26 18:35:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:35:32,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131762727] [2025-04-26 18:35:32,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:35:32,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:35:32,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:32,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:32,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:32,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:32,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:35:32,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:35:32,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:35:32,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:35:32,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:35:32,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:35:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:35:32,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 18:35:32,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-26 18:35:32,744 INFO L87 Difference]: Start difference. First operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (in total 64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:35:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:35:33,378 INFO L93 Difference]: Finished difference Result 40397 states and 52895 transitions. [2025-04-26 18:35:33,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40397 states and 52895 transitions. [2025-04-26 18:35:33,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:35:33,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40397 states to 0 states and 0 transitions. [2025-04-26 18:35:33,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:35:33,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:35:33,627 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:35:33,627 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:35:33,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:35:33,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:35:33,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 18:35:33,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:35:33,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:35:33,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:35:33,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:35:33,630 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:35:33,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:35:33,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:35:33 BoogieIcfgContainer [2025-04-26 18:35:33,638 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:35:33,639 INFO L158 Benchmark]: Toolchain (without parser) took 21833.53ms. Allocated memory was 155.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 109.3MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-26 18:35:33,639 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:35:33,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.40ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 88.0MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 18:35:33,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.63ms. Allocated memory is still 155.2MB. Free memory was 88.0MB in the beginning and 86.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:35:33,643 INFO L158 Benchmark]: Boogie Preprocessor took 17.97ms. Allocated memory is still 155.2MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:35:33,643 INFO L158 Benchmark]: RCFGBuilder took 231.95ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 72.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:35:33,643 INFO L158 Benchmark]: BuchiAutomizer took 21222.30ms. Allocated memory was 155.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 72.3MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-26 18:35:33,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.40ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 88.0MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.63ms. Allocated memory is still 155.2MB. Free memory was 88.0MB in the beginning and 86.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.97ms. Allocated memory is still 155.2MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 231.95ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 72.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 21222.30ms. Allocated memory was 155.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 72.3MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 1 iterations. TraceHistogramMax:2. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 215, Number of transitions in reduction automaton: 188, Number of states in reduction automaton: 171, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 1 iterations. TraceHistogramMax:3. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 311, Number of transitions in reduction automaton: 1437, Number of states in reduction automaton: 1167, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 1 iterations. TraceHistogramMax:4. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 1.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 1662, Number of transitions in reduction automaton: 9834, Number of states in reduction automaton: 7640, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 2 iterations. TraceHistogramMax:5. Analysis of lassos took 0.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 1336 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1094 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 242 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 14.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 14037, Number of transitions in reduction automaton: 62045, Number of states in reduction automaton: 47040, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 12 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:35:33,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...