/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/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:17:27,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:17:27,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:17:27,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:17:27,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:17:27,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:17:27,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:17:27,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:17:27,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:17:27,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:17:27,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:17:27,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:17:27,219 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:17:27,219 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:17:27,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:17:27,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:17:27,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:27,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:17:27,221 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:17:27,221 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:17:27,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:17:27,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:17:27,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:17:27,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:17:27,455 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:17:27,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2025-04-26 18:17:28,721 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f530c6215/7d5152e43cfb4f1bb4d1f3e619f8b236/FLAG900a08b18 [2025-04-26 18:17:28,944 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:17:28,945 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2025-04-26 18:17:28,961 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f530c6215/7d5152e43cfb4f1bb4d1f3e619f8b236/FLAG900a08b18 [2025-04-26 18:17:29,771 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f530c6215/7d5152e43cfb4f1bb4d1f3e619f8b236 [2025-04-26 18:17:29,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:17:29,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:17:29,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:29,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:17:29,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:17:29,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:29" (1/1) ... [2025-04-26 18:17:29,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160547ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:29, skipping insertion in model container [2025-04-26 18:17:29,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:29" (1/1) ... [2025-04-26 18:17:29,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:17:30,063 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/peterson.i[32348,32361] [2025-04-26 18:17:30,068 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/peterson.i[32502,32515] [2025-04-26 18:17:30,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:30,079 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:17:30,119 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/peterson.i[32348,32361] [2025-04-26 18:17:30,120 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/peterson.i[32502,32515] [2025-04-26 18:17:30,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:30,142 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:17:30,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30 WrapperNode [2025-04-26 18:17:30,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:30,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:30,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:17:30,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:17:30,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,171 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-04-26 18:17:30,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:30,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:17:30,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:17:30,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:17:30,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:17:30,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:17:30,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:17:30,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:17:30,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (1/1) ... [2025-04-26 18:17:30,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:30,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:30,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:17:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 18:17:30,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 18:17:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 18:17:30,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 18:17:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:17:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:17:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:17:30,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:17:30,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 18:17:30,336 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:17:30,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:17:30,422 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:17:30,422 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:17:30,431 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:17:30,431 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:17:30,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:30 BoogieIcfgContainer [2025-04-26 18:17:30,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:17:30,432 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:17:30,432 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:17:30,437 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:17:30,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:30,437 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:17:29" (1/3) ... [2025-04-26 18:17:30,438 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e2cd35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:30, skipping insertion in model container [2025-04-26 18:17:30,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:30,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:30" (2/3) ... [2025-04-26 18:17:30,438 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e2cd35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:30, skipping insertion in model container [2025-04-26 18:17:30,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:30,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:30" (3/3) ... [2025-04-26 18:17:30,441 INFO L376 chiAutomizerObserver]: Analyzing ICFG peterson.i [2025-04-26 18:17:30,485 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:17:30,514 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:30,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:30,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:17:30,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 138 flow [2025-04-26 18:17:30,597 INFO L116 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-04-26 18:17:30,599 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:17:30,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 4/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-26 18:17:30,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 62 transitions, 138 flow [2025-04-26 18:17:30,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 58 transitions, 128 flow [2025-04-26 18:17:30,607 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 61 places, 58 transitions, 128 flow [2025-04-26 18:17:30,607 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 58 transitions, 128 flow [2025-04-26 18:17:30,657 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 539 states, 535 states have (on average 2.6579439252336448) internal successors, (in total 1422), 538 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:30,659 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 539 states, 535 states have (on average 2.6579439252336448) internal successors, (in total 1422), 538 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:30,662 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:17:30,712 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 614#[L755-4, L746, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:17:30,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 788#[L755-4, thr1EXIT, L746]true [2025-04-26 18:17:30,726 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 532#[L755-4, L746, L739-3]true [2025-04-26 18:17:30,727 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 704#[thr1FINAL, L755-4, L746]true [2025-04-26 18:17:30,731 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 454#[L755-4, L739, L746]true [2025-04-26 18:17:30,747 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 388#[L755-4, L746, L738]true [2025-04-26 18:17:30,757 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 628#[L737, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L755-4]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 630#[L737, L755-4, L749]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 540#[L737, L755-4, L748-3]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 458#[L737, L755-4, L748]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 390#[L737, L755-4, L747]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 334#[L737, L755-4, L746]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288#[L737, L744-1, L755-4]true [2025-04-26 18:17:30,763 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 246#[L737, L744, L755-4]true [2025-04-26 18:17:30,776 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310#[L755-4, L735-1, L746]true [2025-04-26 18:17:30,782 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 272#[L755-4, L735, L746]true [2025-04-26 18:17:30,791 WARN L140 AmpleReduction]: Number of pruned transitions: 173 [2025-04-26 18:17:30,791 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 16 [2025-04-26 18:17:30,791 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16 [2025-04-26 18:17:30,791 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:84 [2025-04-26 18:17:30,791 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:111 [2025-04-26 18:17:30,791 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:17:30,791 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:17:30,791 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:17:30,792 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 196 states, 192 states have (on average 1.5885416666666667) internal successors, (in total 305), 195 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:30,798 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:17:30,798 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:17:30,798 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:17:30,798 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:17:30,798 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:17:30,798 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:17:30,798 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:17:30,798 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:17:30,800 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 196 states, 192 states have (on average 1.5885416666666667) internal successors, (in total 305), 195 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:30,819 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2025-04-26 18:17:30,819 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:30,819 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:30,823 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] [2025-04-26 18:17:30,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:30,824 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:17:30,824 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 196 states, 192 states have (on average 1.5885416666666667) internal successors, (in total 305), 195 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:30,833 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2025-04-26 18:17:30,833 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:30,833 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:30,833 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] [2025-04-26 18:17:30,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:30,837 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[111] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[85] 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[]" "[106] 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[]" "[104] 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[]" "[116] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (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[]" "[113] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[100] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[93] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[99] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[120] 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]" "[123] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} 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]" "[130] L753-->L753-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]" "[108] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[79] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[82] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[131] L754-2-->L754-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]" "[167] L754-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]" "[149] $Ultimate##0-->L735: 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]" "[150] L735-->L735-1: Formula: (= v_~flag1~0_4 1) InVars {} OutVars{~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[~flag1~0]" "[151] L735-1-->L737: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0]" [2025-04-26 18:17:30,837 INFO L754 eck$LassoCheckResult]: Loop: "[153] L737-->L737: Formula: (and (= v_~flag2~0_3 1) (= v_~turn~0_5 1)) InVars {~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_3} OutVars{~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[]" [2025-04-26 18:17:30,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1235395197, now seen corresponding path program 1 times [2025-04-26 18:17:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:30,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60618612] [2025-04-26 18:17:30,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:30,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:17:30,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:17:30,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:30,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:17:30,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:17:30,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:30,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:30,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 184, now seen corresponding path program 1 times [2025-04-26 18:17:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:30,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452094101] [2025-04-26 18:17:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:30,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:30,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:30,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:30,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:30,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:30,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:30,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:30,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -357454404, now seen corresponding path program 1 times [2025-04-26 18:17:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:30,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940977547] [2025-04-26 18:17:30,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:30,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:17:30,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:17:30,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:30,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:31,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940977547] [2025-04-26 18:17:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940977547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783070082] [2025-04-26 18:17:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:31,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:31,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:31,109 INFO L87 Difference]: Start difference. First operand has 196 states, 192 states have (on average 1.5885416666666667) internal successors, (in total 305), 195 states have internal predecessors, (305), 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 11.0) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:31,139 INFO L93 Difference]: Finished difference Result 196 states and 280 transitions. [2025-04-26 18:17:31,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 280 transitions. [2025-04-26 18:17:31,141 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2025-04-26 18:17:31,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 127 states and 191 transitions. [2025-04-26 18:17:31,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2025-04-26 18:17:31,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-04-26 18:17:31,147 INFO L74 IsDeterministic]: Start isDeterministic. Operand 127 states and 191 transitions. [2025-04-26 18:17:31,148 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:31,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-04-26 18:17:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 191 transitions. [2025-04-26 18:17:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-04-26 18:17:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.5039370078740157) internal successors, (in total 191), 126 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2025-04-26 18:17:31,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-04-26 18:17:31,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:31,167 INFO L438 stractBuchiCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-04-26 18:17:31,168 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:17:31,168 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 191 transitions. [2025-04-26 18:17:31,170 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2025-04-26 18:17:31,170 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:31,170 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:31,170 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] [2025-04-26 18:17:31,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:31,171 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[111] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[85] 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[]" "[106] 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[]" "[104] 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[]" "[116] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (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[]" "[113] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[100] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[93] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[99] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[120] 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]" "[123] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} 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]" "[130] L753-->L753-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]" "[108] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[79] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[82] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[131] L754-2-->L754-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]" "[167] L754-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]" "[149] $Ultimate##0-->L735: 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]" "[88] L754-4-->L754-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[103] L754-5-->L755: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[92] L755-->L755-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[132] L755-1-->L755-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[118] L755-2-->L755-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[164] L755-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]" "[136] $Ultimate##0-->L744: 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]" "[137] L744-->L744-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" "[138] L744-1-->L746: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0]" [2025-04-26 18:17:31,171 INFO L754 eck$LassoCheckResult]: Loop: "[140] L746-->L746: Formula: (and (= v_~turn~0_2 0) (= v_~flag1~0_1 1)) InVars {~turn~0=v_~turn~0_2, ~flag1~0=v_~flag1~0_1} OutVars{~turn~0=v_~turn~0_2, ~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 18:17:31,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1150080472, now seen corresponding path program 1 times [2025-04-26 18:17:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411312715] [2025-04-26 18:17:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:17:31,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:17:31,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:17:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:17:31,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:31,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash 171, now seen corresponding path program 1 times [2025-04-26 18:17:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875609147] [2025-04-26 18:17:31,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:31,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:31,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:31,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1292756124, now seen corresponding path program 1 times [2025-04-26 18:17:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897019010] [2025-04-26 18:17:31,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:31,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:31,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897019010] [2025-04-26 18:17:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897019010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722589722] [2025-04-26 18:17:31,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:31,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:31,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:31,294 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. cyclomatic complexity: 78 Second operand has 3 states, 2 states have (on average 14.5) internal successors, (in total 29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:31,307 INFO L93 Difference]: Finished difference Result 127 states and 188 transitions. [2025-04-26 18:17:31,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 188 transitions. [2025-04-26 18:17:31,308 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2025-04-26 18:17:31,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 103 states and 158 transitions. [2025-04-26 18:17:31,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 18:17:31,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-04-26 18:17:31,309 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103 states and 158 transitions. [2025-04-26 18:17:31,309 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:31,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-04-26 18:17:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 158 transitions. [2025-04-26 18:17:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-26 18:17:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5339805825242718) internal successors, (in total 158), 102 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2025-04-26 18:17:31,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-04-26 18:17:31,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:31,317 INFO L438 stractBuchiCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-04-26 18:17:31,317 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:17:31,317 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 158 transitions. [2025-04-26 18:17:31,318 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2025-04-26 18:17:31,318 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:31,318 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:31,318 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 18:17:31,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:31,319 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[111] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[85] 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[]" "[106] 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[]" "[104] 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[]" "[116] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (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[]" "[113] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[100] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[93] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[99] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[120] 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]" "[123] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} 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]" "[130] L753-->L753-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]" "[108] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[79] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[82] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[131] L754-2-->L754-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]" "[167] L754-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]" "[149] $Ultimate##0-->L735: 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]" "[150] L735-->L735-1: Formula: (= v_~flag1~0_4 1) InVars {} OutVars{~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[~flag1~0]" "[151] L735-1-->L737: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0]" "[88] L754-4-->L754-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[103] L754-5-->L755: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[92] L755-->L755-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[132] L755-1-->L755-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[118] L755-2-->L755-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[164] L755-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]" "[136] $Ultimate##0-->L744: 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]" "[137] L744-->L744-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:31,319 INFO L754 eck$LassoCheckResult]: Loop: "[153] L737-->L737: Formula: (and (= v_~flag2~0_3 1) (= v_~turn~0_5 1)) InVars {~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_3} OutVars{~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[]" [2025-04-26 18:17:31,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -573690525, now seen corresponding path program 1 times [2025-04-26 18:17:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159779287] [2025-04-26 18:17:31,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:31,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:31,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash 184, now seen corresponding path program 2 times [2025-04-26 18:17:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253561698] [2025-04-26 18:17:31,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:31,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:31,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:31,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:31,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:31,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:31,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash -604536938, now seen corresponding path program 1 times [2025-04-26 18:17:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:31,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424087525] [2025-04-26 18:17:31,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:31,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:17:31,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:17:31,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:17:31,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:17:31,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:31,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:31,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:31,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:31,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:31,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:31,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:31,747 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 18:17:31,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:17:31 BoogieIcfgContainer [2025-04-26 18:17:31,791 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:17:31,792 INFO L158 Benchmark]: Toolchain (without parser) took 2018.07ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 67.0MB in the end (delta: 33.7MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2025-04-26 18:17:31,792 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:31,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.42ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 78.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 18:17:31,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:17:31,792 INFO L158 Benchmark]: Boogie Preprocessor took 16.19ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:31,793 INFO L158 Benchmark]: RCFGBuilder took 243.62ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 63.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:17:31,793 INFO L158 Benchmark]: BuchiAutomizer took 1358.57ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 67.0MB in the end (delta: -3.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:31,794 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.13ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 368.42ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 78.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.19ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 243.62ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 63.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1358.57ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 67.0MB in the end (delta: -3.2MB). 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.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 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, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 95 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 280, Number of transitions in reduction automaton: 305, Number of states in reduction automaton: 196, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 103 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 737]: 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 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L733] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L753] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L754] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, turn=0, x=0] [L735] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L736] 1 turn = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L755] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, t1=-1, t2=0, turn=1, x=0] [L744] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] Loop: [L737] COND TRUE flag2==1 && turn==1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 737]: 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 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L733] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L753] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L754] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, turn=0, x=0] [L735] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L736] 1 turn = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L755] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, t1=-1, t2=0, turn=1, x=0] [L744] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] Loop: [L737] COND TRUE flag2==1 && turn==1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:17:31,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...