/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/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/m4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:38,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:38,522 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:24:38,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:38,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:38,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:38,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:38,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:38,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:38,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:38,555 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:38,555 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:38,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:38,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:38,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:38,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:38,557 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:38,557 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:38,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:38,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:38,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:38,788 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:38,789 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:38,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/m4.c.bpl [2025-04-26 16:24:38,791 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/m4.c.bpl' [2025-04-26 16:24:38,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:38,808 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:38,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:38,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:38,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:38,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,846 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:38,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:38,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:38,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:38,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:38,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:38,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:38,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:38,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:38,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/1) ... [2025-04-26 16:24:38,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,906 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:24:38,913 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:24:38,932 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:38,933 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:38,933 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:38,933 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:38,934 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:24:38,969 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:38,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:39,047 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:39,048 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:39,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:39,054 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:39,055 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:39 BoogieIcfgContainer [2025-04-26 16:24:39,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:39,056 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:39,056 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:39,060 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:39,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:39,060 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:38" (1/2) ... [2025-04-26 16:24:39,061 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79f572b0 and model type m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:39, skipping insertion in model container [2025-04-26 16:24:39,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:39,061 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:39" (2/2) ... [2025-04-26 16:24:39,062 INFO L376 chiAutomizerObserver]: Analyzing ICFG m4.c.bpl [2025-04-26 16:24:39,112 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:24:39,161 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 16:24:39,163 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:39,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:24:39,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:24:39,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 16:24:39,175 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 16:24:39,185 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:39,185 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:39,185 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:39,186 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:39,186 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:39,186 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:39,186 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:39,186 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:39,188 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:39,238 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-04-26 16:24:39,238 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,238 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:39,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:39,242 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:39,242 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 188 states, but on-demand construction may add more states [2025-04-26 16:24:39,252 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-04-26 16:24:39,252 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,252 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:39,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:39,258 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:39,259 INFO L754 eck$LassoCheckResult]: Loop: "[57] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[59] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:39,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2522, now seen corresponding path program 1 times [2025-04-26 16:24:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819035868] [2025-04-26 16:24:39,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-04-26 16:24:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722140176] [2025-04-26 16:24:39,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2425468, now seen corresponding path program 1 times [2025-04-26 16:24:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809307751] [2025-04-26 16:24:39,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,419 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,420 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,420 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,420 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,420 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:39,420 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,420 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,420 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,420 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:39,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,421 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,474 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,475 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,478 INFO L229 MonitoredProcess]: Starting monitored process 2 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:24:39,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:39,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:39,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:39,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,502 INFO L229 MonitoredProcess]: Starting monitored process 3 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:24:39,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:39,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:39,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,577 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:39,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:39,581 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:39,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:39,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,582 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,604 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,607 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,609 INFO L229 MonitoredProcess]: Starting monitored process 4 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:24:39,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:39,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:39,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:39,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:39,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:39,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:39,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:39,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:39,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:39,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:39,637 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:39,637 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:39,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,642 INFO L229 MonitoredProcess]: Starting monitored process 5 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:24:39,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:39,644 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:39,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:39,647 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:39,648 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:39,648 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:39,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:39,657 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:39,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,745 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:24:39,786 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:39,789 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 188 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:24:39,934 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 188 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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) Result 648 states and 1998 transitions. Complement of second has 7 states. [2025-04-26 16:24:39,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:24:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 16:24:39,946 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:39,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:39,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:39,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 1998 transitions. [2025-04-26 16:24:39,958 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 174 [2025-04-26 16:24:39,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 417 states and 1305 transitions. [2025-04-26 16:24:39,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-04-26 16:24:39,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2025-04-26 16:24:39,968 INFO L74 IsDeterministic]: Start isDeterministic. Operand 417 states and 1305 transitions. [2025-04-26 16:24:39,968 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:39,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 417 states and 1305 transitions. [2025-04-26 16:24:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 1305 transitions. [2025-04-26 16:24:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 270. [2025-04-26 16:24:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 3.2333333333333334) internal successors, (in total 873), 269 states have internal predecessors, (873), 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:24:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 873 transitions. [2025-04-26 16:24:40,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 873 transitions. [2025-04-26 16:24:40,006 INFO L438 stractBuchiCegarLoop]: Abstraction has 270 states and 873 transitions. [2025-04-26 16:24:40,006 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:40,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 873 transitions. [2025-04-26 16:24:40,011 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 140 [2025-04-26 16:24:40,011 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,011 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:40,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,013 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:24:40,013 INFO L754 eck$LassoCheckResult]: Loop: "[67] L43-->L45: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L45-->L43: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:40,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2426077, now seen corresponding path program 1 times [2025-04-26 16:24:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135510419] [2025-04-26 16:24:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:40,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:40,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:40,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-04-26 16:24:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838065406] [2025-04-26 16:24:40,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1963505153, now seen corresponding path program 1 times [2025-04-26 16:24:40,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090352778] [2025-04-26 16:24:40,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:40,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:40,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:40,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:40,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,062 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,062 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:40,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:40,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,062 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,081 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,081 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:40,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,084 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:40,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:40,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:40,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:24:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,104 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24:40,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:40,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:40,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,179 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:40,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:40,183 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,183 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,183 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,183 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,183 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:40,183 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,183 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,183 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,183 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:40,183 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,183 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,204 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:40,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:40,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:40,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:40,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:40,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:40,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:40,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:40,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:40,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:40,223 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:40,223 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:40,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,225 INFO L229 MonitoredProcess]: Starting monitored process 9 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:24:40,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:40,227 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:40,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:40,231 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:40,231 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:40,231 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 16:24:40,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,239 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:40,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:40,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:40,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,283 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:24:40,284 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:40,284 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 873 transitions. cyclomatic complexity: 680 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:24:40,320 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 873 transitions. cyclomatic complexity: 680. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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) Result 725 states and 2571 transitions. Complement of second has 6 states. [2025-04-26 16:24:40,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:24:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:24:40,321 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:40,321 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,321 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:24:40,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,322 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:24:40,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 2571 transitions. [2025-04-26 16:24:40,329 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-04-26 16:24:40,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 433 states and 1530 transitions. [2025-04-26 16:24:40,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-04-26 16:24:40,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2025-04-26 16:24:40,333 INFO L74 IsDeterministic]: Start isDeterministic. Operand 433 states and 1530 transitions. [2025-04-26 16:24:40,334 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:40,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 1530 transitions. [2025-04-26 16:24:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 1530 transitions. [2025-04-26 16:24:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 356. [2025-04-26 16:24:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 3.662921348314607) internal successors, (in total 1304), 355 states have internal predecessors, (1304), 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:24:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1304 transitions. [2025-04-26 16:24:40,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 356 states and 1304 transitions. [2025-04-26 16:24:40,346 INFO L438 stractBuchiCegarLoop]: Abstraction has 356 states and 1304 transitions. [2025-04-26 16:24:40,346 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:40,346 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 1304 transitions. [2025-04-26 16:24:40,348 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-04-26 16:24:40,348 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,348 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:40,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,349 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[56] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:40,349 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:40,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash 75189135, now seen corresponding path program 1 times [2025-04-26 16:24:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719033072] [2025-04-26 16:24:40,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:40,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,387 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:24:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:40,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719033072] [2025-04-26 16:24:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719033072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:40,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:24:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706141138] [2025-04-26 16:24:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:40,392 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:40,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:24:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45865698] [2025-04-26 16:24:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,417 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,417 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,418 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,418 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,418 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:40,418 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,418 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,418 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,418 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:40,418 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,418 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,439 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,439 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:40,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,441 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:40,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:40,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:40,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,462 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:40,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:40,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:40,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,562 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:40,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,567 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:40,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:40,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,567 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,592 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,592 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:40,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,612 INFO L229 MonitoredProcess]: Starting monitored process 12 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:24:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:40,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:40,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:40,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:40,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:40,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:40,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:40,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:40,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:40,627 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:40,629 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:40,629 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:40,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,631 INFO L229 MonitoredProcess]: Starting monitored process 13 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:24:40,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:40,633 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:40,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:40,637 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:40,637 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:40,637 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:24:40,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:24:40,645 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:40,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:40,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:40,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,691 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:24:40,691 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:40,692 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 356 states and 1304 transitions. cyclomatic complexity: 1028 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:24:40,752 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 356 states and 1304 transitions. cyclomatic complexity: 1028. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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) Result 1177 states and 4222 transitions. Complement of second has 7 states. [2025-04-26 16:24:40,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:24:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:24:40,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:40,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:40,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:40,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 4222 transitions. [2025-04-26 16:24:40,764 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-04-26 16:24:40,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 643 states and 2243 transitions. [2025-04-26 16:24:40,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2025-04-26 16:24:40,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-04-26 16:24:40,771 INFO L74 IsDeterministic]: Start isDeterministic. Operand 643 states and 2243 transitions. [2025-04-26 16:24:40,771 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:40,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 643 states and 2243 transitions. [2025-04-26 16:24:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states and 2243 transitions. [2025-04-26 16:24:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 432. [2025-04-26 16:24:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 432 states have (on average 3.6550925925925926) internal successors, (in total 1579), 431 states have internal predecessors, (1579), 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:24:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1579 transitions. [2025-04-26 16:24:40,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 432 states and 1579 transitions. [2025-04-26 16:24:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:40,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:40,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:40,790 INFO L87 Difference]: Start difference. First operand 432 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:24:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:40,808 INFO L93 Difference]: Finished difference Result 124 states and 320 transitions. [2025-04-26 16:24:40,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 320 transitions. [2025-04-26 16:24:40,809 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-04-26 16:24:40,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 305 transitions. [2025-04-26 16:24:40,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 16:24:40,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-04-26 16:24:40,811 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 305 transitions. [2025-04-26 16:24:40,811 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:40,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-04-26 16:24:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 305 transitions. [2025-04-26 16:24:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-04-26 16:24:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 2.563025210084034) internal successors, (in total 305), 118 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 16:24:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 305 transitions. [2025-04-26 16:24:40,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-04-26 16:24:40,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:40,817 INFO L438 stractBuchiCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-04-26 16:24:40,817 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:40,817 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 305 transitions. [2025-04-26 16:24:40,818 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-04-26 16:24:40,818 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,818 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:40,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,818 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[57] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[66] L43-->L47: Formula: (<= v_w_2 v_x2_4) InVars {x2=v_x2_4, w=v_w_2} OutVars{x2=v_x2_4, w=v_w_2} AuxVars[] AssignedVars[]" "[68] L47-->thread3FINAL: Formula: (= v_f_4 (+ v_f_5 1)) InVars {f=v_f_5} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[59] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[56] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 16:24:40,818 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:40,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash 171631286, now seen corresponding path program 1 times [2025-04-26 16:24:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782986796] [2025-04-26 16:24:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:40,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:40,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,862 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:24:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:40,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782986796] [2025-04-26 16:24:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782986796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150170552] [2025-04-26 16:24:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:40,863 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:40,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-04-26 16:24:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300960216] [2025-04-26 16:24:40,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:40,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,885 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,885 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:40,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:40,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,885 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,904 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,904 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:40,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,906 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:40,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:40,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:40,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:24:40,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,926 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:40,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:40,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,999 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:41,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:41,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:41,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:41,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:41,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:41,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:41,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:41,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:41,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:41,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:41,004 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:41,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,019 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:41,019 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:41,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,021 INFO L229 MonitoredProcess]: Starting monitored process 16 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:24:41,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:41,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:41,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:41,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:41,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:41,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:41,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:41,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:41,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:41,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:41,059 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:41,059 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,061 INFO L229 MonitoredProcess]: Starting monitored process 17 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:24:41,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:24:41,079 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:41,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:41,082 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:41,082 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:41,082 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-04-26 16:24:41,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:41,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:41,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:41,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,147 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:24:41,148 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:41,148 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 305 transitions. cyclomatic complexity: 217 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:24:41,169 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 305 transitions. cyclomatic complexity: 217. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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) Result 177 states and 446 transitions. Complement of second has 6 states. [2025-04-26 16:24:41,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:24:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 16:24:41,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:24:41,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:24:41,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:24:41,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 446 transitions. [2025-04-26 16:24:41,171 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2025-04-26 16:24:41,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 103 states and 258 transitions. [2025-04-26 16:24:41,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:24:41,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-04-26 16:24:41,172 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103 states and 258 transitions. [2025-04-26 16:24:41,173 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:41,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 258 transitions. [2025-04-26 16:24:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 258 transitions. [2025-04-26 16:24:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-26 16:24:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.504854368932039) internal successors, (in total 258), 102 states have internal predecessors, (258), 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:24:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 258 transitions. [2025-04-26 16:24:41,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 258 transitions. [2025-04-26 16:24:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:41,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:41,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:41,175 INFO L87 Difference]: Start difference. First operand 103 states and 258 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:24:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:41,183 INFO L93 Difference]: Finished difference Result 46 states and 100 transitions. [2025-04-26 16:24:41,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 100 transitions. [2025-04-26 16:24:41,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:41,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2025-04-26 16:24:41,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:41,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:41,183 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:41,183 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:41,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:41,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:41,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:41,184 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:41,184 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:41,184 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:41,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:41,184 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:41,189 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:41 BoogieIcfgContainer [2025-04-26 16:24:41,189 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:41,190 INFO L158 Benchmark]: Toolchain (without parser) took 2381.91ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 88.3MB in the beginning and 112.8MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:41,190 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:41,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.84ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:41,190 INFO L158 Benchmark]: Boogie Preprocessor took 28.33ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 85.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:41,190 INFO L158 Benchmark]: RCFGBuilder took 177.54ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 76.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:41,190 INFO L158 Benchmark]: BuchiAutomizer took 2133.42ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 76.3MB in the beginning and 112.8MB in the end (delta: -36.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:41,191 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.84ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.33ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 85.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 177.54ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 76.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2133.42ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 76.3MB in the beginning and 112.8MB in the end (delta: -36.5MB). 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 2.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 435 StatesRemovedByMinimization, 3 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 120 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:41,202 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...