/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-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:29:07,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:29:07,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:29:07,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:29:07,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:29:07,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:29:07,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:29:07,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:29:07,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:29:07,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:29:07,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:29:07,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:29:07,096 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:29:07,096 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:29:07,096 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:29:07,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:29:07,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:29:07,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:29:07,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:29:07,098 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:29:07,098 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:29:07,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:29:07,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:29:07,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:29:07,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:29:07,346 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:29:07,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2025-04-26 16:29:08,691 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/49aaab062/de1627d3ef694612b680a0bc3d4f157e/FLAG8ccf8ea89 [2025-04-26 16:29:08,916 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:29:08,916 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2025-04-26 16:29:08,926 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/49aaab062/de1627d3ef694612b680a0bc3d4f157e/FLAG8ccf8ea89 [2025-04-26 16:29:09,692 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/49aaab062/de1627d3ef694612b680a0bc3d4f157e [2025-04-26 16:29:09,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:29:09,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:29:09,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:29:09,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:29:09,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:29:09,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:29:09" (1/1) ... [2025-04-26 16:29:09,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db01ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:09, skipping insertion in model container [2025-04-26 16:29:09,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:29:09" (1/1) ... [2025-04-26 16:29:09,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:29:10,018 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32419,32432] [2025-04-26 16:29:10,027 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32696,32709] [2025-04-26 16:29:10,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:29:10,037 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:29:10,089 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32419,32432] [2025-04-26 16:29:10,091 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32696,32709] [2025-04-26 16:29:10,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:29:10,116 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:29:10,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10 WrapperNode [2025-04-26 16:29:10,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:29:10,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:29:10,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:29:10,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:29:10,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,145 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-04-26 16:29:10,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:29:10,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:29:10,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:29:10,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:29:10,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:29:10,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:29:10,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:29:10,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:29:10,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (1/1) ... [2025-04-26 16:29:10,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:29:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:29:10,201 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 16:29:10,206 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 16:29:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 16:29:10,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 16:29:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 16:29:10,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 16:29:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:29:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:29:10,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:29:10,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:29:10,233 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 16:29:10,321 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:29:10,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:29:10,416 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:29:10,416 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:29:10,426 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:29:10,426 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:29:10,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:29:10 BoogieIcfgContainer [2025-04-26 16:29:10,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:29:10,429 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:29:10,429 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:29:10,433 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:29:10,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:29:10,433 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:29:09" (1/3) ... [2025-04-26 16:29:10,434 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6090009e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:29:10, skipping insertion in model container [2025-04-26 16:29:10,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:29:10,434 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:29:10" (2/3) ... [2025-04-26 16:29:10,434 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6090009e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:29:10, skipping insertion in model container [2025-04-26 16:29:10,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:29:10,435 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:29:10" (3/3) ... [2025-04-26 16:29:10,436 INFO L376 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2025-04-26 16:29:10,493 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:29:10,524 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:29:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:29:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:29:10,526 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 16:29:10,528 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 16:29:10,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 81 transitions, 176 flow [2025-04-26 16:29:10,617 INFO L116 PetriNetUnfolderBase]: 12/77 cut-off events. [2025-04-26 16:29:10,618 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:29:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 77 events. 12/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-04-26 16:29:10,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 81 transitions, 176 flow [2025-04-26 16:29:10,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 77 transitions, 166 flow [2025-04-26 16:29:10,629 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 72 places, 77 transitions, 166 flow [2025-04-26 16:29:10,634 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:29:10,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4, L761]true [2025-04-26 16:29:10,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4, L758]true [2025-04-26 16:29:10,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4, L755]true [2025-04-26 16:29:10,723 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[L751, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4]true [2025-04-26 16:29:10,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 321#[L768-4, thr1EXIT, L761]true [2025-04-26 16:29:10,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 305#[L768-4, L758, thr1EXIT]true [2025-04-26 16:29:10,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 299#[L768-4, L755, thr1EXIT]true [2025-04-26 16:29:10,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283#[L751, L768-4, thr1EXIT]true [2025-04-26 16:29:10,769 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 429#[L746, L768-4, L761]true [2025-04-26 16:29:10,770 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 477#[L768-4, thr1FINAL, L761]true [2025-04-26 16:29:10,770 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 405#[L746, L768-4, L758]true [2025-04-26 16:29:10,772 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 483#[L768-4, L758, thr1FINAL]true [2025-04-26 16:29:10,772 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 395#[L746, L768-4, L755]true [2025-04-26 16:29:10,773 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 501#[L768-4, L755, thr1FINAL]true [2025-04-26 16:29:10,774 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 373#[L746, L751, L768-4]true [2025-04-26 16:29:10,776 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 521#[L751, L768-4, thr1FINAL]true [2025-04-26 16:29:10,799 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 579#[L768-4, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 587#[L768-4, L745, L762-1]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 585#[L762, L768-4, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 575#[L768-4, L745, L761]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 559#[L768-4, L758, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 549#[L768-4, L753-1, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 553#[L768-4, L755, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 547#[L754, L768-4, L745]true [2025-04-26 16:29:10,803 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 543#[L768-4, L752-1, L745]true [2025-04-26 16:29:10,804 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 541#[L768-4, L752, L745]true [2025-04-26 16:29:10,804 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 537#[L751, L768-4, L745]true [2025-04-26 16:29:10,804 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 533#[L750, L768-4, L745]true [2025-04-26 16:29:10,814 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 645#[L768-4, L744, L758]true [2025-04-26 16:29:10,815 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 635#[L768-4, L744, L755]true [2025-04-26 16:29:10,818 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 611#[L751, L768-4, L744]true [2025-04-26 16:29:10,834 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 721#[L743, L768-4, L758]true [2025-04-26 16:29:10,835 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 715#[L743, L768-4, L755]true [2025-04-26 16:29:10,835 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 699#[L751, L743, L768-4]true [2025-04-26 16:29:10,874 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 811#[L742, L768-4, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 16:29:10,879 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 825#[L742, L768-4, L762-1]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 823#[L742, L762, L768-4]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 807#[L742, L768-4, L761]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 799#[L742, L768-4, L760]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 795#[L742, L759, L768-4]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 791#[L742, L768-4, L758]true [2025-04-26 16:29:10,880 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 781#[L742, L768-4, L753-1]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 785#[L742, L768-4, L755]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 779#[L742, L754, L768-4]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 775#[L742, L768-4, L752-1]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 773#[L742, L768-4, L752]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 769#[L742, L751, L768-4]true [2025-04-26 16:29:10,881 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 765#[L742, L750, L768-4]true [2025-04-26 16:29:10,899 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 901#[L768-4, L761, L737-1]true [2025-04-26 16:29:10,899 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 885#[L768-4, L758, L737-1]true [2025-04-26 16:29:10,899 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 879#[L768-4, L755, L737-1]true [2025-04-26 16:29:10,899 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 863#[L751, L768-4, L737-1]true [2025-04-26 16:29:10,929 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 965#[L739, L768-4, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 973#[L739, L768-4, L762-1]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 971#[L739, L762, L768-4]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 961#[L739, L768-4, L761]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 953#[L739, L768-4, L760]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 949#[L739, L759, L768-4]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 945#[L739, L768-4, L758]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 935#[L739, L768-4, L753-1]true [2025-04-26 16:29:10,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 939#[L739, L768-4, L755]true [2025-04-26 16:29:10,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 933#[L739, L754, L768-4]true [2025-04-26 16:29:10,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 929#[L739, L768-4, L752-1]true [2025-04-26 16:29:10,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 927#[L739, L768-4, L752]true [2025-04-26 16:29:10,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 923#[L739, L751, L768-4]true [2025-04-26 16:29:10,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 919#[L739, L750, L768-4]true [2025-04-26 16:29:10,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1029#[L738, L768-4, L761]true [2025-04-26 16:29:10,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1013#[L738, L768-4, L758]true [2025-04-26 16:29:10,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1007#[L738, L768-4, L755]true [2025-04-26 16:29:10,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 991#[L738, L751, L768-4]true [2025-04-26 16:29:10,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1089#[L768-4, L736-1, L761]true [2025-04-26 16:29:10,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1073#[L768-4, L758, L736-1]true [2025-04-26 16:29:10,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1067#[L768-4, L755, L736-1]true [2025-04-26 16:29:10,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1051#[L751, L768-4, L736-1]true [2025-04-26 16:29:11,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1157#[L736, L768-4, L761]true [2025-04-26 16:29:11,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1141#[L736, L768-4, L758]true [2025-04-26 16:29:11,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1135#[L736, L768-4, L755]true [2025-04-26 16:29:11,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1119#[L736, L751, L768-4]true [2025-04-26 16:29:11,034 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1221#[L768-4, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L735]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1229#[L768-4, L735, L762-1]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1227#[L762, L768-4, L735]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1217#[L768-4, L735, L761]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1209#[L768-4, L760, L735]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1205#[L759, L768-4, L735]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1201#[L768-4, L758, L735]true [2025-04-26 16:29:11,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1191#[L768-4, L753-1, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1195#[L768-4, L755, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1189#[L754, L768-4, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1185#[L768-4, L752-1, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1183#[L768-4, L752, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1179#[L751, L768-4, L735]true [2025-04-26 16:29:11,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1175#[L750, L768-4, L735]true [2025-04-26 16:29:11,056 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1285#[L768-4, L734, L761]true [2025-04-26 16:29:11,056 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1269#[L768-4, L734, L758]true [2025-04-26 16:29:11,056 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1263#[L768-4, L734, L755]true [2025-04-26 16:29:11,057 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1247#[L751, L768-4, L734]true [2025-04-26 16:29:11,071 WARN L140 AmpleReduction]: Number of pruned transitions: 394 [2025-04-26 16:29:11,071 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 96 [2025-04-26 16:29:11,071 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 96 [2025-04-26 16:29:11,071 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:119 [2025-04-26 16:29:11,072 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:280 [2025-04-26 16:29:11,072 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:29:11,072 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:29:11,072 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:29:11,074 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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 16:29:11,083 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:29:11,083 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:29:11,083 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:29:11,083 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:29:11,083 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:29:11,083 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:29:11,084 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:29:11,084 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:29:11,088 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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 16:29:11,117 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 120 [2025-04-26 16:29:11,118 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:11,118 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:11,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:11,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:11,124 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:29:11,124 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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 16:29:11,135 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 120 [2025-04-26 16:29:11,135 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:11,135 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:11,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:11,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:11,140 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[167] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[165] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[197] L-1-2-->L766: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[132] L766-->L766-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[153] L766-1-->L767: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[174] L767-->L767-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" [2025-04-26 16:29:11,140 INFO L754 eck$LassoCheckResult]: Loop: "[230] L735-->L735: Formula: (<= 3 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[]" [2025-04-26 16:29:11,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2016825051, now seen corresponding path program 1 times [2025-04-26 16:29:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873178920] [2025-04-26 16:29:11,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:29:11,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:29:11,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:29:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:29:11,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 261, now seen corresponding path program 1 times [2025-04-26 16:29:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795634252] [2025-04-26 16:29:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1902932629, now seen corresponding path program 1 times [2025-04-26 16:29:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583949965] [2025-04-26 16:29:11,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:29:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:29:11,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:29:11,390 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 16:29:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:29:11,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583949965] [2025-04-26 16:29:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583949965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:29:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:29:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:29:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098807031] [2025-04-26 16:29:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:29:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:29:11,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:29:11,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:29:11,422 INFO L87 Difference]: Start difference. First operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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 3 states, 2 states have (on average 10.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 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 16:29:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:29:11,481 INFO L93 Difference]: Finished difference Result 383 states and 733 transitions. [2025-04-26 16:29:11,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 733 transitions. [2025-04-26 16:29:11,487 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 16:29:11,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 332 states and 668 transitions. [2025-04-26 16:29:11,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2025-04-26 16:29:11,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2025-04-26 16:29:11,500 INFO L74 IsDeterministic]: Start isDeterministic. Operand 332 states and 668 transitions. [2025-04-26 16:29:11,503 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:29:11,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 16:29:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 668 transitions. [2025-04-26 16:29:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-04-26 16:29:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.0120481927710845) internal successors, (in total 668), 331 states have internal predecessors, (668), 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 16:29:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 668 transitions. [2025-04-26 16:29:11,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 16:29:11,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:29:11,542 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 16:29:11,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:29:11,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 668 transitions. [2025-04-26 16:29:11,545 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 16:29:11,545 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:11,545 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:11,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:11,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:11,548 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[167] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[165] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[197] L-1-2-->L766: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[132] L766-->L766-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[153] L766-1-->L767: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[174] L767-->L767-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[195] L767-5-->L768: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[133] L768-->L768-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:29:11,548 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 16:29:11,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1739774568, now seen corresponding path program 1 times [2025-04-26 16:29:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055145272] [2025-04-26 16:29:11,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:29:11,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:29:11,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:29:11,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:29:11,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 1 times [2025-04-26 16:29:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191996364] [2025-04-26 16:29:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1901563447, now seen corresponding path program 1 times [2025-04-26 16:29:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953082772] [2025-04-26 16:29:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:29:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:29:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:29:11,658 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 16:29:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:29:11,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953082772] [2025-04-26 16:29:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953082772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:29:11,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:29:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:29:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96736556] [2025-04-26 16:29:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:29:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:29:11,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:29:11,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:29:11,682 INFO L87 Difference]: Start difference. First operand 332 states and 668 transitions. cyclomatic complexity: 425 Second operand has 3 states, 2 states have (on average 13.5) internal successors, (in total 27), 3 states have internal predecessors, (27), 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 16:29:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:29:11,718 INFO L93 Difference]: Finished difference Result 328 states and 647 transitions. [2025-04-26 16:29:11,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 647 transitions. [2025-04-26 16:29:11,721 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79 [2025-04-26 16:29:11,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 288 states and 596 transitions. [2025-04-26 16:29:11,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2025-04-26 16:29:11,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2025-04-26 16:29:11,723 INFO L74 IsDeterministic]: Start isDeterministic. Operand 288 states and 596 transitions. [2025-04-26 16:29:11,724 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:29:11,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 16:29:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 596 transitions. [2025-04-26 16:29:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-04-26 16:29:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 288 states have (on average 2.0694444444444446) internal successors, (in total 596), 287 states have internal predecessors, (596), 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 16:29:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 596 transitions. [2025-04-26 16:29:11,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 16:29:11,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:29:11,741 INFO L438 stractBuchiCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 16:29:11,741 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:29:11,741 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 596 transitions. [2025-04-26 16:29:11,743 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79 [2025-04-26 16:29:11,743 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:11,743 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:11,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:11,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:11,744 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[167] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[165] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[197] L-1-2-->L766: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[132] L766-->L766-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[153] L766-1-->L767: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[174] L767-->L767-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[195] L767-5-->L768: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[133] L768-->L768-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:29:11,744 INFO L754 eck$LassoCheckResult]: Loop: "[230] L735-->L735: Formula: (<= 3 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[]" [2025-04-26 16:29:11,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1601014012, now seen corresponding path program 1 times [2025-04-26 16:29:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551343617] [2025-04-26 16:29:11,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:29:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:29:11,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:29:11,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:29:11,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 261, now seen corresponding path program 2 times [2025-04-26 16:29:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63199370] [2025-04-26 16:29:11,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:29:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:29:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1908173410, now seen corresponding path program 1 times [2025-04-26 16:29:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137711634] [2025-04-26 16:29:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:29:11,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:29:11,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:29:11,806 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 16:29:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:29:11,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137711634] [2025-04-26 16:29:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137711634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:29:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:29:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:29:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698872533] [2025-04-26 16:29:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:29:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:29:11,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:29:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:29:11,814 INFO L87 Difference]: Start difference. First operand 288 states and 596 transitions. cyclomatic complexity: 387 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (in total 28), 3 states have internal predecessors, (28), 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 16:29:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:29:11,868 INFO L93 Difference]: Finished difference Result 310 states and 635 transitions. [2025-04-26 16:29:11,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 635 transitions. [2025-04-26 16:29:11,870 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 16:29:11,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 310 states and 635 transitions. [2025-04-26 16:29:11,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2025-04-26 16:29:11,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2025-04-26 16:29:11,873 INFO L74 IsDeterministic]: Start isDeterministic. Operand 310 states and 635 transitions. [2025-04-26 16:29:11,873 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:29:11,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 16:29:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 635 transitions. [2025-04-26 16:29:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-04-26 16:29:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 310 states have (on average 2.0483870967741935) internal successors, (in total 635), 309 states have internal predecessors, (635), 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 16:29:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 635 transitions. [2025-04-26 16:29:11,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 16:29:11,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:29:11,886 INFO L438 stractBuchiCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 16:29:11,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:29:11,886 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states and 635 transitions. [2025-04-26 16:29:11,888 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 16:29:11,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:11,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:11,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:11,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:11,889 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[167] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[165] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[197] L-1-2-->L766: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[132] L766-->L766-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[153] L766-1-->L767: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[174] L767-->L767-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[195] L767-5-->L768: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[133] L768-->L768-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:29:11,889 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 16:29:11,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1601014012, now seen corresponding path program 2 times [2025-04-26 16:29:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948470405] [2025-04-26 16:29:11,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:29:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:29:11,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:29:11,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:29:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:29:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:29:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 2 times [2025-04-26 16:29:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744520055] [2025-04-26 16:29:11,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:29:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:29:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:11,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:11,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:11,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:11,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:11,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1908173387, now seen corresponding path program 1 times [2025-04-26 16:29:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:11,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072857419] [2025-04-26 16:29:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:29:11,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:29:11,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:11,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:29:11,965 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 16:29:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:29:11,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072857419] [2025-04-26 16:29:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072857419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:29:11,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:29:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:29:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902803113] [2025-04-26 16:29:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:29:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:29:11,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:29:11,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:29:11,971 INFO L87 Difference]: Start difference. First operand 310 states and 635 transitions. cyclomatic complexity: 414 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (in total 28), 3 states have internal predecessors, (28), 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 16:29:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:29:12,018 INFO L93 Difference]: Finished difference Result 334 states and 678 transitions. [2025-04-26 16:29:12,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 678 transitions. [2025-04-26 16:29:12,020 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 100 [2025-04-26 16:29:12,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 334 states and 678 transitions. [2025-04-26 16:29:12,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2025-04-26 16:29:12,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2025-04-26 16:29:12,024 INFO L74 IsDeterministic]: Start isDeterministic. Operand 334 states and 678 transitions. [2025-04-26 16:29:12,026 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:29:12,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 16:29:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 678 transitions. [2025-04-26 16:29:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-04-26 16:29:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 2.029940119760479) internal successors, (in total 678), 333 states have internal predecessors, (678), 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 16:29:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 678 transitions. [2025-04-26 16:29:12,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 16:29:12,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:29:12,037 INFO L438 stractBuchiCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 16:29:12,037 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:29:12,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 678 transitions. [2025-04-26 16:29:12,039 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 100 [2025-04-26 16:29:12,039 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:29:12,039 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:29:12,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:29:12,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:29:12,040 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[167] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[165] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[197] L-1-2-->L766: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[132] L766-->L766-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[153] L766-1-->L767: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[174] L767-->L767-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[195] L767-5-->L768: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[229] L735-->L736: Formula: (< v_~flag2~0_11 3) InVars {~flag2~0=v_~flag2~0_11} OutVars{~flag2~0=v_~flag2~0_11} AuxVars[] AssignedVars[]" "[133] L768-->L768-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[231] L736-->L736-1: Formula: (= v_~flag1~0_13 3) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:29:12,040 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 16:29:12,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 450500130, now seen corresponding path program 1 times [2025-04-26 16:29:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:12,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115547115] [2025-04-26 16:29:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:12,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:29:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:29:12,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:12,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:29:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:29:12,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:12,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 3 times [2025-04-26 16:29:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:12,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977225116] [2025-04-26 16:29:12,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:29:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:12,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:12,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:12,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:29:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:29:12,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:29:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:12,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:29:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1080602349, now seen corresponding path program 1 times [2025-04-26 16:29:12,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:29:12,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505539772] [2025-04-26 16:29:12,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:29:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:29:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:29:12,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:29:12,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:12,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:29:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:29:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:29:12,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:29:12,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:29:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:29:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:29:12,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:29:12,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:29:12,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:29:12,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:29:12,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:29:12 BoogieIcfgContainer [2025-04-26 16:29:12,566 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:29:12,566 INFO L158 Benchmark]: Toolchain (without parser) took 2871.51ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 72.4MB in the end (delta: 25.6MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2025-04-26 16:29:12,569 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:29:12,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.36ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 76.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-26 16:29:12,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:29:12,570 INFO L158 Benchmark]: Boogie Preprocessor took 24.50ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:29:12,570 INFO L158 Benchmark]: RCFGBuilder took 258.02ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 60.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:29:12,570 INFO L158 Benchmark]: BuchiAutomizer took 2136.88ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 72.4MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:29:12,571 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.80ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.36ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 76.3MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.58ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.50ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 258.02ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 60.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2136.88ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 72.4MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 299 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 551, Number of transitions in reduction automaton: 838, Number of states in reduction automaton: 400, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 334 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 751]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 int x; VAL [flag1=0, flag2=0, x=0] [L766] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, x=0] [L767] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, x=0] [L734] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L735] COND FALSE 1 !(flag2 >= 3) VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L736] 1 flag1 = 3 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, x=0] [L768] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, t1=-1, t2=0, x=0] [L750] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, x=0] Loop: [L751] COND TRUE flag1 >= 3 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 751]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 int x; VAL [flag1=0, flag2=0, x=0] [L766] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, x=0] [L767] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, x=0] [L734] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L735] COND FALSE 1 !(flag2 >= 3) VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L736] 1 flag1 = 3 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, x=0] [L768] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, t1=-1, t2=0, x=0] [L750] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, x=0] Loop: [L751] COND TRUE flag1 >= 3 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:29:12,583 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...