/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/weaver/spaghetti.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:45:27,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:45:27,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:45:27,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:45:27,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:45:27,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:45:27,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:45:27,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:45:27,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:45:27,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:45:27,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:45:27,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:45:27,421 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:45:27,422 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:45:27,423 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:45:27,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:45:27,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:45:27,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:45:27,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:45:27,425 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:45:27,425 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:45:27,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:45:27,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:45:27,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:45:27,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:45:27,640 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:45:27,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c [2025-04-26 16:45:28,950 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4d07cb364/9fb5ce42163f488482378a267c54303a/FLAG6bffcf232 [2025-04-26 16:45:29,152 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:45:29,153 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c [2025-04-26 16:45:29,158 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4d07cb364/9fb5ce42163f488482378a267c54303a/FLAG6bffcf232 [2025-04-26 16:45:29,951 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4d07cb364/9fb5ce42163f488482378a267c54303a [2025-04-26 16:45:29,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:45:29,954 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:45:29,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:45:29,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:45:29,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:45:29,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:45:29" (1/1) ... [2025-04-26 16:45:29,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20555e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:29, skipping insertion in model container [2025-04-26 16:45:29,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:45:29" (1/1) ... [2025-04-26 16:45:29,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:45:30,128 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[2341,2354] [2025-04-26 16:45:30,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:45:30,142 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:45:30,169 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[2341,2354] [2025-04-26 16:45:30,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:45:30,183 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:45:30,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30 WrapperNode [2025-04-26 16:45:30,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:45:30,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:45:30,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:45:30,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:45:30,189 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:45:30" (1/1) ... [2025-04-26 16:45:30,196 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:45:30" (1/1) ... [2025-04-26 16:45:30,211 INFO L138 Inliner]: procedures = 20, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-04-26 16:45:30,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:45:30,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:45:30,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:45:30,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:45:30,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:45:30,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:45:30,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:45:30,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:45:30,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (1/1) ... [2025-04-26 16:45:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:45:30,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:45:30,259 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:45:30,262 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:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:45:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:45:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:45:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:45:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:45:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:45:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:45:30,279 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:45:30,338 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:45:30,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:45:30,463 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:45:30,464 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:45:30,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:45:30,471 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-26 16:45:30,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:45:30 BoogieIcfgContainer [2025-04-26 16:45:30,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:45:30,472 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:45:30,472 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:45:30,478 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:45:30,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:45:30,478 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:45:29" (1/3) ... [2025-04-26 16:45:30,479 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7502f2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:45:30, skipping insertion in model container [2025-04-26 16:45:30,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:45:30,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:45:30" (2/3) ... [2025-04-26 16:45:30,479 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7502f2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:45:30, skipping insertion in model container [2025-04-26 16:45:30,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:45:30,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:45:30" (3/3) ... [2025-04-26 16:45:30,480 INFO L376 chiAutomizerObserver]: Analyzing ICFG spaghetti.wvr.c [2025-04-26 16:45:30,553 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:45:30,581 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:45:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:45:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:45:30,585 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:45:30,586 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:45:30,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 128 transitions, 284 flow [2025-04-26 16:45:30,682 INFO L116 PetriNetUnfolderBase]: 9/120 cut-off events. [2025-04-26 16:45:30,685 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:45:30,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 9/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 166 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2025-04-26 16:45:30,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 128 transitions, 284 flow [2025-04-26 16:45:30,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 120 transitions, 264 flow [2025-04-26 16:45:30,697 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 124 places, 120 transitions, 264 flow [2025-04-26 16:45:30,701 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:45:30,967 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1063#[L63, L90-5, L72-4, thread1EXIT, thread2EXIT]true [2025-04-26 16:45:30,971 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1061#[L63, thread1EXIT, L73, thread2EXIT, L90-4]true [2025-04-26 16:45:34,107 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 76129#[thread3EXIT, L90-5, L42, L51-4, thread4EXIT]true [2025-04-26 16:45:34,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 76127#[thread3EXIT, L42, L51-4, thread4EXIT, L90-4]true [2025-04-26 16:45:34,120 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75897#[L52, L90-3, L41, thread3EXIT]true [2025-04-26 16:45:34,121 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 76029#[L90-3, L42, L51-4, thread3EXIT]true [2025-04-26 16:45:34,123 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75849#[L90-2, L52, L41, thread3EXIT]true [2025-04-26 16:45:34,124 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77619#[L42, L51-4, thread3EXIT, L90-2]true [2025-04-26 16:45:34,125 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75797#[L90-1, L52, L41, thread3EXIT]true [2025-04-26 16:45:34,125 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77687#[L42, L51-4, thread3EXIT, L90-1]true [2025-04-26 16:45:34,126 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75747#[L90, L52, L41, thread3EXIT]true [2025-04-26 16:45:34,127 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77757#[L42, L51-4, thread3EXIT, L90]true [2025-04-26 16:45:34,128 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75675#[L52, L89-5, L41, thread3EXIT]true [2025-04-26 16:45:34,128 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77823#[L89-5, L42, L51-4, thread3EXIT]true [2025-04-26 16:45:34,129 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75673#[L52, L89-4, L41, thread3EXIT]true [2025-04-26 16:45:34,130 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77883#[L89-4, L42, L51-4, thread3EXIT]true [2025-04-26 16:45:34,155 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79341#[L42, L91, L51-4, L62, L72-7]true [2025-04-26 16:45:34,156 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78975#[L63, L52, L41, L91, L72-7]true [2025-04-26 16:45:34,159 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79185#[L63, L42, L91, L51-4, L72-7]true [2025-04-26 16:45:34,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81163#[L90-5, L42, L51-4, L62, L72-7]true [2025-04-26 16:45:34,179 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78857#[L63, L52, L90-5, L41, L72-7]true [2025-04-26 16:45:34,180 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81007#[L63, L90-5, L42, L51-4, L72-7]true [2025-04-26 16:45:34,286 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 82951#[L42, L51-4, L62, L90-4, L72-7]true [2025-04-26 16:45:34,287 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78853#[L63, L52, L41, L90-4, L72-7]true [2025-04-26 16:45:34,288 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 82795#[L63, L42, L51-4, L90-4, L72-7]true [2025-04-26 16:45:34,301 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 84901#[L63, L42, L91, L51-4, L73]true [2025-04-26 16:45:34,304 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85421#[L52, L41, L91, L73, L62]true [2025-04-26 16:45:34,306 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85343#[L42, L91, L51-4, L73, L62]true [2025-04-26 16:45:34,306 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85341#[L72-4, L42, L91, L51-4, L62]true [2025-04-26 16:45:34,307 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 84689#[L63, L52, L72-4, L41, L91]true [2025-04-26 16:45:34,308 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 84899#[L63, L72-4, L42, L91, L51-4]true [2025-04-26 16:45:34,322 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86479#[L63, L90-5, L42, L51-4, L73]true [2025-04-26 16:45:34,326 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 87047#[L90-5, L52, L41, L73, L62]true [2025-04-26 16:45:34,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86969#[L90-5, L42, L51-4, L73, L62]true [2025-04-26 16:45:34,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86967#[L90-5, L72-4, L42, L51-4, L62]true [2025-04-26 16:45:34,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 84567#[L63, L52, L72-4, L90-5, L41]true [2025-04-26 16:45:34,330 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86477#[L63, L90-5, L72-4, L42, L51-4]true [2025-04-26 16:45:34,343 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88075#[L63, L42, L51-4, L73, L90-4]true [2025-04-26 16:45:34,345 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88627#[L52, L41, L73, L62, L90-4]true [2025-04-26 16:45:34,347 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88549#[L42, L51-4, L73, L62, L90-4]true [2025-04-26 16:45:34,348 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88547#[L72-4, L42, L51-4, L62, L90-4]true [2025-04-26 16:45:34,349 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 84555#[L63, L52, L72-4, L41, L90-4]true [2025-04-26 16:45:34,350 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88073#[L63, L72-4, L42, L51-4, L90-4]true [2025-04-26 16:45:34,351 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78545#[L90-3, L63, L42, L51-4]true [2025-04-26 16:45:34,353 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78277#[L52, L90-3, L62, L41]true [2025-04-26 16:45:34,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78467#[L90-3, L62, L42, L51-4]true [2025-04-26 16:45:34,359 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89969#[L63, L42, L51-4, L90-2]true [2025-04-26 16:45:34,361 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78205#[L52, L62, L41, L90-2]true [2025-04-26 16:45:34,362 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89917#[L62, L42, L51-4, L90-2]true [2025-04-26 16:45:34,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 90423#[L63, L42, L51-4, L90-1]true [2025-04-26 16:45:34,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78129#[L90-1, L52, L62, L41]true [2025-04-26 16:45:34,369 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 90371#[L62, L42, L51-4, L90-1]true [2025-04-26 16:45:34,376 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 90883#[L63, L42, L51-4, L90]true [2025-04-26 16:45:34,378 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78055#[L52, L62, L41, L90]true [2025-04-26 16:45:34,378 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 90831#[L62, L42, L51-4, L90]true [2025-04-26 16:45:34,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 91333#[L63, L89-5, L42, L51-4]true [2025-04-26 16:45:34,387 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77957#[L52, L89-5, L62, L41]true [2025-04-26 16:45:34,388 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 91281#[L89-5, L62, L42, L51-4]true [2025-04-26 16:45:34,391 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 91751#[L63, L89-4, L42, L51-4]true [2025-04-26 16:45:34,396 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77951#[L52, L89-4, L62, L41]true [2025-04-26 16:45:34,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 91699#[L89-4, L62, L42, L51-4]true [2025-04-26 16:45:34,398 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75385#[L51-4, L89-3, L42]true [2025-04-26 16:45:34,400 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75335#[L51-4, L42, L89-2]true [2025-04-26 16:45:34,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75285#[L89-1, L51-4, L42]true [2025-04-26 16:45:34,406 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75235#[L51-4, L42, L89]true [2025-04-26 16:45:34,407 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 66359#[L51-4, L42, L88-5]true [2025-04-26 16:45:34,408 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 66357#[L42, L52, L88-4]true [2025-04-26 16:45:34,410 WARN L140 AmpleReduction]: Number of pruned transitions: 114023 [2025-04-26 16:45:34,410 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 67 [2025-04-26 16:45:34,410 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3281 [2025-04-26 16:45:34,410 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:143 [2025-04-26 16:45:34,410 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:35260 [2025-04-26 16:45:34,411 WARN L145 AmpleReduction]: Times succ was already a loop node:564 [2025-04-26 16:45:34,411 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7165 [2025-04-26 16:45:34,411 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:45:34,489 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 38618 states, 38616 states have (on average 1.4676041019266626) internal successors, (in total 56673), 38617 states have internal predecessors, (56673), 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:45:34,495 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:45:34,495 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:45:34,495 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:45:34,495 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:45:34,495 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:45:34,495 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:45:34,495 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:45:34,495 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:45:34,544 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38618 states, 38616 states have (on average 1.4676041019266626) internal successors, (in total 56673), 38617 states have internal predecessors, (56673), 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:45:34,915 INFO L131 ngComponentsAnalysis]: Automaton has 964 accepting balls. 26727 [2025-04-26 16:45:34,916 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:45:34,916 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:45:34,921 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] [2025-04-26 16:45:34,922 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:45:34,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:45:34,958 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38618 states, 38616 states have (on average 1.4676041019266626) internal successors, (in total 56673), 38617 states have internal predecessors, (56673), 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:45:35,249 INFO L131 ngComponentsAnalysis]: Automaton has 964 accepting balls. 26727 [2025-04-26 16:45:35,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:45:35,249 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:45:35,250 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] [2025-04-26 16:45:35,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:45:35,257 INFO L752 eck$LassoCheckResult]: Stem: "[193] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[206] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[245] L21-->L21-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[]" "[261] L21-1-->L21-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[]" "[211] L21-2-->L21-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[]" "[239] L21-3-->L21-4: Formula: (and (= 16 (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[]" "[226] L21-4-->L36: Formula: (= v_~x_0~0_12 0) InVars {} OutVars{~x_0~0=v_~x_0~0_12} AuxVars[] AssignedVars[~x_0~0]" "[270] L36-->L-1-1: Formula: (= v_~x_1~0_7 0) InVars {} OutVars{~x_1~0=v_~x_1~0_7} AuxVars[] AssignedVars[~x_1~0]" "[272] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[273] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~t2~0#1]" "[240] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[175] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[274] L82-2-->L82-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[176] L82-3-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[262] L84-->L84-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[271] L84-1-->L84-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~x_0~0_13) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{~x_0~0=v_~x_0~0_13, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[~x_0~0]" "[191] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[203] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[215] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~x_1~0_8) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~x_1~0=v_~x_1~0_8} AuxVars[] AssignedVars[~x_1~0]" "[164] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[221] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |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_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[174] L87-1-->L87-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[168] L87-2-->L87-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_4| |v_ULTIMATE.start_main_~t1~0#1_4|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[342] L87-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_4|, thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_14|, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#in~_argptr.base, thread1Thread1of1ForFork0_#t~nondet2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_#t~nondet1, thread1Thread1of1ForFork0_~_argptr.offset]" "[282] $Ultimate##0-->L43: Formula: (and (= v_thread1Thread1of1ForFork0_~_argptr.offset_1 |v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_1| v_thread1Thread1of1ForFork0_~_argptr.base_1)) InVars {thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_1, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_~_argptr.offset]" [2025-04-26 16:45:35,257 INFO L754 eck$LassoCheckResult]: Loop: "[284] L43-->L40-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1]" "[286] L40-1-->L40-2: Formula: (or (= |v_thread1Thread1of1ForFork0_#t~nondet1_3| 1) (= |v_thread1Thread1of1ForFork0_#t~nondet1_3| 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[]" "[288] L40-2-->L40-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[]" "[291] L40-3-->L40-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1=|v_thread1Thread1of1ForFork0_#t~nondet1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1]" "[293] L40-4-->L41: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet2]" "[294] L41-->L41-1: Formula: (= v_~x_0~0_1 |v_thread1Thread1of1ForFork0_#t~nondet2_3|) InVars {thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_3|} OutVars{~x_0~0=v_~x_0~0_1, thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~x_0~0]" "[295] L41-1-->L42: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet2=|v_thread1Thread1of1ForFork0_#t~nondet2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet2]" "[296] L42-->L42-1: Formula: (= v_~x_0~0_2 (+ 3 v_~x_0~0_3)) InVars {~x_0~0=v_~x_0~0_3} OutVars{~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~x_0~0]" "[297] L42-1-->L43: Formula: (= (* 2 v_~x_0~0_5) v_~x_0~0_4) InVars {~x_0~0=v_~x_0~0_5} OutVars{~x_0~0=v_~x_0~0_4} AuxVars[] AssignedVars[~x_0~0]" [2025-04-26 16:45:35,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:45:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash 597280277, now seen corresponding path program 1 times [2025-04-26 16:45:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:45:35,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145660437] [2025-04-26 16:45:35,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:45:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:45:35,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:45:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:45:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:45:35,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:45:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:45:35,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:45:35,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:45:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 33857889, now seen corresponding path program 1 times [2025-04-26 16:45:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:45:35,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191190136] [2025-04-26 16:45:35,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:45:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:45:35,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:45:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:45:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:45:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:45:35,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:45:35,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:45:35,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:45:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1111068211, now seen corresponding path program 1 times [2025-04-26 16:45:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:45:35,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438893134] [2025-04-26 16:45:35,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:45:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:45:35,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:45:35,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:45:35,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:45:35,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:45:35,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:45:35,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:45:35,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:45:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:45:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:45:35,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:45:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:45:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:45:35,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:45:35,681 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:45:35,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:45:35 BoogieIcfgContainer [2025-04-26 16:45:35,711 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:45:35,713 INFO L158 Benchmark]: Toolchain (without parser) took 5757.91ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 99.7MB in the beginning and 201.3MB in the end (delta: -101.6MB). Peak memory consumption was 484.9MB. Max. memory is 8.0GB. [2025-04-26 16:45:35,714 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:45:35,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.20ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 85.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:45:35,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.18ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.9MB in the end (delta: 896.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:45:35,714 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:45:35,716 INFO L158 Benchmark]: RCFGBuilder took 236.30ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 69.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:45:35,716 INFO L158 Benchmark]: BuchiAutomizer took 5239.27ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 69.9MB in the beginning and 201.3MB in the end (delta: -131.4MB). Peak memory consumption was 455.5MB. Max. memory is 8.0GB. [2025-04-26 16:45:35,717 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.68ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.20ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 85.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.18ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.9MB in the end (delta: 896.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 236.30ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 69.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5239.27ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 69.9MB in the beginning and 201.3MB in the end (delta: -131.4MB). Peak memory consumption was 455.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.9s InitialAbstraction: Time to compute Ample Reduction [ms]: 3832, Number of transitions in reduction automaton: 56673, Number of states in reduction automaton: 38618, Underlying: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 40]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L36] 0 _Atomic unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L82] 0 pthread_t t1, t2, t3, t4; VAL [x_0=0, x_1=0] [L84] 0 x_0 = __VERIFIER_nondet_uint() VAL [x_0=0, x_1=0] [L85] 0 x_1 = __VERIFIER_nondet_uint() VAL [x_0=0, x_1=4] [L87] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, t1=-1, x_0=0, x_1=4] Loop: [L40] COND TRUE __VERIFIER_nondet_bool() [L41] x_0 = __VERIFIER_nondet_uint() [L42] x_0 += 3 [L43] x_0 *= 2 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 40]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L36] 0 _Atomic unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L82] 0 pthread_t t1, t2, t3, t4; VAL [x_0=0, x_1=0] [L84] 0 x_0 = __VERIFIER_nondet_uint() VAL [x_0=0, x_1=0] [L85] 0 x_1 = __VERIFIER_nondet_uint() VAL [x_0=0, x_1=4] [L87] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, t1=-1, x_0=0, x_1=4] Loop: [L40] COND TRUE __VERIFIER_nondet_bool() [L41] x_0 = __VERIFIER_nondet_uint() [L42] x_0 += 3 [L43] x_0 *= 2 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:45:35,730 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...