/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:02:17,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:02:17,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:02:17,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:02:17,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:02:17,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:02:17,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:02:17,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:02:17,712 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:02:17,712 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:02:17,713 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:02:17,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:02:17,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:02:17,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:02:17,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:02:17,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:02:17,714 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:02:17,715 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:02:17,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:02:17,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:02:17,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:02:17,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:02:17,930 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:02:17,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2025-04-26 16:02:19,214 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e59bac2b9/9b693bd7631f40c3af5291c635a87db4/FLAG6cc9f2dfe [2025-04-26 16:02:19,474 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:02:19,474 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2025-04-26 16:02:19,485 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e59bac2b9/9b693bd7631f40c3af5291c635a87db4/FLAG6cc9f2dfe [2025-04-26 16:02:20,415 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e59bac2b9/9b693bd7631f40c3af5291c635a87db4 [2025-04-26 16:02:20,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:02:20,418 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:02:20,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:20,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:02:20,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:02:20,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576cea5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20, skipping insertion in model container [2025-04-26 16:02:20,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:02:20,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:20,755 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:02:20,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:20,832 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:02:20,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20 WrapperNode [2025-04-26 16:02:20,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:20,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:20,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:02:20,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:02:20,837 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:02:20" (1/1) ... [2025-04-26 16:02:20,850 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:02:20" (1/1) ... [2025-04-26 16:02:20,866 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-04-26 16:02:20,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:20,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:02:20,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:02:20,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:02:20,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:02:20,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:02:20,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:02:20,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:02:20,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (1/1) ... [2025-04-26 16:02:20,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:02:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:02:20,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:02:20,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:02:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 16:02:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 16:02:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 16:02:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 16:02:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:02:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:02:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:02:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:02:20,928 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:02:21,015 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:02:21,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:02:21,103 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:02:21,103 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:02:21,108 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:02:21,109 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:02:21,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:21 BoogieIcfgContainer [2025-04-26 16:02:21,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:02:21,110 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:02:21,111 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:02:21,114 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:02:21,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:21,115 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:02:20" (1/3) ... [2025-04-26 16:02:21,115 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fea4b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:21, skipping insertion in model container [2025-04-26 16:02:21,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:21,116 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:20" (2/3) ... [2025-04-26 16:02:21,116 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fea4b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:21, skipping insertion in model container [2025-04-26 16:02:21,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:21,116 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:21" (3/3) ... [2025-04-26 16:02:21,117 INFO L376 chiAutomizerObserver]: Analyzing ICFG dekker.i [2025-04-26 16:02:21,166 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:02:21,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 88 transitions, 190 flow [2025-04-26 16:02:21,218 INFO L116 PetriNetUnfolderBase]: 11/84 cut-off events. [2025-04-26 16:02:21,219 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:02:21,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 11/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 55. Up to 3 conditions per place. [2025-04-26 16:02:21,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 88 transitions, 190 flow [2025-04-26 16:02:21,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 84 transitions, 180 flow [2025-04-26 16:02:21,225 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 80 places, 84 transitions, 180 flow [2025-04-26 16:02:21,233 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:02:21,233 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:02:21,233 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:02:21,233 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:02:21,233 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:02:21,233 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:02:21,233 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:02:21,234 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:02:21,235 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:02:21,355 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 500 [2025-04-26 16:02:21,356 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:21,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:21,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:21,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:02:21,361 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:02:21,361 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1127 states, but on-demand construction may add more states [2025-04-26 16:02:21,394 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 500 [2025-04-26 16:02:21,394 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:21,394 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:21,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:21,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:02:21,399 INFO L752 eck$LassoCheckResult]: Stem: "[168] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[177] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[171] L16-->L16-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[]" "[134] L16-1-->L16-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[]" "[209] L16-2-->L16-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[]" "[185] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[186] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[155] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[147] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[175] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[203] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[205] L-1-2-->L780: 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_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_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} 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]" "[136] L780-->L780-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]" "[138] L780-1-->L781: 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]" "[166] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[150] L781-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[135] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[202] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[169] L2-1-->L781-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[153] L781-2-->L782: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[195] L782-->L782-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]" "[140] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L782-2-->L782-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]" "[262] L782-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base]" "[238] $Ultimate##0-->L750: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base]" "[239] L750-->L752-1: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0]" [2025-04-26 16:02:21,400 INFO L754 eck$LassoCheckResult]: Loop: "[241] L752-1-->L752: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[]" "[244] L752-->L752-1: Formula: (= v_~turn~0_10 0) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10} AuxVars[] AssignedVars[]" [2025-04-26 16:02:21,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1183819133, now seen corresponding path program 1 times [2025-04-26 16:02:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308025833] [2025-04-26 16:02:21,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:02:21,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:02:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:02:21,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:02:21,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:21,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 8676, now seen corresponding path program 1 times [2025-04-26 16:02:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831956000] [2025-04-26 16:02:21,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:21,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:21,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:21,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:21,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:21,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 516154342, now seen corresponding path program 1 times [2025-04-26 16:02:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005470305] [2025-04-26 16:02:21,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:02:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:02:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:02:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:02:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:02:21,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005470305] [2025-04-26 16:02:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005470305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:02:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:02:21,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:02:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043254876] [2025-04-26 16:02:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:02:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:02:21,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:02:21,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:02:21,699 INFO L87 Difference]: Start difference. First operand currently 1127 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (in total 28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:02:21,749 INFO L93 Difference]: Finished difference Result 968 states and 2635 transitions. [2025-04-26 16:02:21,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 2635 transitions. [2025-04-26 16:02:21,759 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 374 [2025-04-26 16:02:21,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 616 states and 1704 transitions. [2025-04-26 16:02:21,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 616 [2025-04-26 16:02:21,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 616 [2025-04-26 16:02:21,782 INFO L74 IsDeterministic]: Start isDeterministic. Operand 616 states and 1704 transitions. [2025-04-26 16:02:21,789 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:02:21,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 616 states and 1704 transitions. [2025-04-26 16:02:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states and 1704 transitions. [2025-04-26 16:02:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2025-04-26 16:02:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 616 states have (on average 2.7662337662337664) internal successors, (in total 1704), 615 states have internal predecessors, (1704), 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:02:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1704 transitions. [2025-04-26 16:02:21,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 616 states and 1704 transitions. [2025-04-26 16:02:21,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:02:21,849 INFO L438 stractBuchiCegarLoop]: Abstraction has 616 states and 1704 transitions. [2025-04-26 16:02:21,849 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:02:21,849 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 616 states and 1704 transitions. [2025-04-26 16:02:21,852 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 374 [2025-04-26 16:02:21,852 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:21,852 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:21,853 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, 1, 1, 1] [2025-04-26 16:02:21,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:02:21,855 INFO L752 eck$LassoCheckResult]: Stem: "[168] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[177] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[171] L16-->L16-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[]" "[134] L16-1-->L16-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[]" "[209] L16-2-->L16-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[]" "[185] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[186] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[155] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[147] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[175] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[203] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[205] L-1-2-->L780: 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_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_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} 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]" "[136] L780-->L780-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]" "[138] L780-1-->L781: 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]" "[166] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[150] L781-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[135] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[202] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[169] L2-1-->L781-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[153] L781-2-->L782: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[195] L782-->L782-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]" "[140] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L782-2-->L782-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]" "[262] L782-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base]" "[187] L782-4-->L782-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]" "[212] L782-5-->L783: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[145] L783-->L783-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[193] L783-1-->L783-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[188] L783-2-->L783-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_4| |v_ULTIMATE.start_main_#t~pre11#1_4|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[265] L783-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_6|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_6|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base, thr2Thread1of1ForFork1_#in~_#1.offset]" "[216] $Ultimate##0-->L765: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset]" "[217] L765-->L767-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:02:21,855 INFO L754 eck$LassoCheckResult]: Loop: "[219] L767-1-->L767: Formula: (<= 1 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" "[222] L767-->L767-1: Formula: (= v_~turn~0_5 1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[]" [2025-04-26 16:02:21,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1537680935, now seen corresponding path program 1 times [2025-04-26 16:02:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387910465] [2025-04-26 16:02:21,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:02:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:02:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:21,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:02:21,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:02:21,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:21,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 7972, now seen corresponding path program 1 times [2025-04-26 16:02:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659927313] [2025-04-26 16:02:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:21,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:21,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:21,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:21,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:21,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -242621700, now seen corresponding path program 1 times [2025-04-26 16:02:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:21,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391103799] [2025-04-26 16:02:21,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:21,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:02:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:02:21,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:21,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:02:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:02:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:02:21,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391103799] [2025-04-26 16:02:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391103799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:02:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:02:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:02:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856747996] [2025-04-26 16:02:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:02:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:02:21,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:02:21,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:02:21,966 INFO L87 Difference]: Start difference. First operand 616 states and 1704 transitions. cyclomatic complexity: 1158 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (in total 34), 3 states have internal predecessors, (34), 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:02:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:02:21,985 INFO L93 Difference]: Finished difference Result 592 states and 1606 transitions. [2025-04-26 16:02:21,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 1606 transitions. [2025-04-26 16:02:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 304 [2025-04-26 16:02:21,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 534 states and 1456 transitions. [2025-04-26 16:02:21,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 534 [2025-04-26 16:02:21,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 534 [2025-04-26 16:02:21,995 INFO L74 IsDeterministic]: Start isDeterministic. Operand 534 states and 1456 transitions. [2025-04-26 16:02:21,998 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:02:21,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 534 states and 1456 transitions. [2025-04-26 16:02:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 1456 transitions. [2025-04-26 16:02:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-04-26 16:02:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 534 states have (on average 2.7265917602996255) internal successors, (in total 1456), 533 states have internal predecessors, (1456), 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:02:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1456 transitions. [2025-04-26 16:02:22,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 534 states and 1456 transitions. [2025-04-26 16:02:22,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:02:22,014 INFO L438 stractBuchiCegarLoop]: Abstraction has 534 states and 1456 transitions. [2025-04-26 16:02:22,014 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:02:22,014 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 534 states and 1456 transitions. [2025-04-26 16:02:22,034 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 304 [2025-04-26 16:02:22,034 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:22,034 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:22,034 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, 1, 1, 1, 1, 1] [2025-04-26 16:02:22,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:02:22,035 INFO L752 eck$LassoCheckResult]: Stem: "[168] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[177] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[171] L16-->L16-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[]" "[134] L16-1-->L16-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[]" "[209] L16-2-->L16-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[]" "[185] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[186] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[155] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[147] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[175] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[203] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[205] L-1-2-->L780: 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_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_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} 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]" "[136] L780-->L780-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]" "[138] L780-1-->L781: 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]" "[166] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[150] L781-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[135] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[202] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[169] L2-1-->L781-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[153] L781-2-->L782: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[195] L782-->L782-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]" "[140] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L782-2-->L782-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]" "[262] L782-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base]" "[187] L782-4-->L782-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]" "[212] L782-5-->L783: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[145] L783-->L783-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[193] L783-1-->L783-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[188] L783-2-->L783-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_4| |v_ULTIMATE.start_main_#t~pre11#1_4|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[265] L783-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_6|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_6|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base, thr2Thread1of1ForFork1_#in~_#1.offset]" "[216] $Ultimate##0-->L765: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset]" "[217] L765-->L767-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" "[238] $Ultimate##0-->L750: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base]" "[239] L750-->L752-1: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0]" [2025-04-26 16:02:22,035 INFO L754 eck$LassoCheckResult]: Loop: "[241] L752-1-->L752: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[]" "[244] L752-->L752-1: Formula: (= v_~turn~0_10 0) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10} AuxVars[] AssignedVars[]" [2025-04-26 16:02:22,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -242621094, now seen corresponding path program 1 times [2025-04-26 16:02:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:22,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437829841] [2025-04-26 16:02:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:22,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:02:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:02:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:22,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:02:22,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:02:22,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:22,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 8676, now seen corresponding path program 2 times [2025-04-26 16:02:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:22,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512347904] [2025-04-26 16:02:22,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:02:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:22,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:22,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:22,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:02:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:22,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:02:22,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:02:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:22,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1230629635, now seen corresponding path program 1 times [2025-04-26 16:02:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:22,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003120745] [2025-04-26 16:02:22,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:22,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:02:22,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:02:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:02:22,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:02:22,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:22,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:02:22,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:02:22,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:22,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:02:22,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:02:22,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:22,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:22,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:02:22 BoogieIcfgContainer [2025-04-26 16:02:22,602 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:02:22,603 INFO L158 Benchmark]: Toolchain (without parser) took 2185.26ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 100.7MB in the end (delta: -3.3MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2025-04-26 16:02:22,603 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:02:22,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.80ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 75.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:02:22,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:02:22,604 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 72.8MB in the end (delta: 670.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:02:22,604 INFO L158 Benchmark]: RCFGBuilder took 225.84ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 59.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:02:22,604 INFO L158 Benchmark]: BuchiAutomizer took 1491.97ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 100.7MB in the end (delta: -41.1MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2025-04-26 16:02:22,606 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.81ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 414.80ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 75.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 72.8MB in the end (delta: 670.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 225.84ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 59.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1491.97ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 100.7MB in the end (delta: -41.1MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s 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, 60 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 154 mSDtfsCounter, 19 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.0s InitialAbstraction: - 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 534 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 751]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L746] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L747] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L748] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L780] 0 pthread_t t1, t2; [L781] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L781] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L782] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L783] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=0, flag2=0, t1=-1, t2=0, turn=0, x=0] [L765] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=0, flag2=1, turn=0, x=0] [L750] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Loop: [L751] COND TRUE flag2 >= 1 [L752] COND FALSE !(turn != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 751]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L746] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L747] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L748] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L780] 0 pthread_t t1, t2; [L781] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L781] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L782] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L783] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=0, flag2=0, t1=-1, t2=0, turn=0, x=0] [L765] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=0, flag2=1, turn=0, x=0] [L750] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Loop: [L751] COND TRUE flag2 >= 1 [L752] COND FALSE !(turn != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:02:22,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...